./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 02:51:26,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 02:51:26,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 02:51:26,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 02:51:26,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 02:51:26,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 02:51:26,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 02:51:26,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 02:51:26,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 02:51:27,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 02:51:27,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 02:51:27,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 02:51:27,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 02:51:27,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 02:51:27,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 02:51:27,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 02:51:27,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 02:51:27,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 02:51:27,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 02:51:27,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 02:51:27,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 02:51:27,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 02:51:27,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 02:51:27,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 02:51:27,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 02:51:27,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 02:51:27,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 02:51:27,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 02:51:27,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 02:51:27,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 02:51:27,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 02:51:27,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 02:51:27,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 02:51:27,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 02:51:27,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 02:51:27,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 02:51:27,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 02:51:27,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 02:51:27,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 02:51:27,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 02:51:27,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 02:51:27,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 02:51:27,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 02:51:27,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 02:51:27,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 02:51:27,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 02:51:27,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 02:51:27,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 02:51:27,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 02:51:27,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 02:51:27,080 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 02:51:27,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 02:51:27,080 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 02:51:27,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 02:51:27,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 02:51:27,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 02:51:27,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 02:51:27,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 02:51:27,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 02:51:27,081 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 02:51:27,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 02:51:27,082 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 02:51:27,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 02:51:27,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 02:51:27,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 02:51:27,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 02:51:27,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:51:27,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 02:51:27,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 02:51:27,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 02:51:27,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 02:51:27,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 02:51:27,092 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 02:51:27,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 02:51:27,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 02:51:27,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 [2021-12-28 02:51:27,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 02:51:27,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 02:51:27,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 02:51:27,452 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 02:51:27,452 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 02:51:27,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2021-12-28 02:51:27,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38136ba01/33f9585e350c492c8b132977df27c85c/FLAGddcf2bf83 [2021-12-28 02:51:27,998 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 02:51:27,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2021-12-28 02:51:28,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38136ba01/33f9585e350c492c8b132977df27c85c/FLAGddcf2bf83 [2021-12-28 02:51:28,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38136ba01/33f9585e350c492c8b132977df27c85c [2021-12-28 02:51:28,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 02:51:28,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 02:51:28,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 02:51:28,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 02:51:28,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 02:51:28,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:28,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bd5421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28, skipping insertion in model container [2021-12-28 02:51:28,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:28,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 02:51:28,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 02:51:28,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2021-12-28 02:51:28,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:51:28,842 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 02:51:28,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2021-12-28 02:51:28,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:51:28,960 INFO L208 MainTranslator]: Completed translation [2021-12-28 02:51:28,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28 WrapperNode [2021-12-28 02:51:28,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 02:51:28,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 02:51:28,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 02:51:28,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 02:51:28,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,046 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2021-12-28 02:51:29,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 02:51:29,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 02:51:29,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 02:51:29,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 02:51:29,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 02:51:29,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 02:51:29,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 02:51:29,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 02:51:29,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (1/1) ... [2021-12-28 02:51:29,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:51:29,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 02:51:29,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 02:51:29,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 02:51:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 02:51:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 02:51:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 02:51:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 02:51:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 02:51:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-28 02:51:29,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-28 02:51:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-28 02:51:29,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-28 02:51:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-28 02:51:29,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-28 02:51:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 02:51:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 02:51:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 02:51:29,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 02:51:29,246 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 02:51:29,410 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 02:51:29,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 02:51:29,931 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 02:51:30,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 02:51:30,273 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 02:51:30,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:51:30 BoogieIcfgContainer [2021-12-28 02:51:30,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 02:51:30,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 02:51:30,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 02:51:30,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 02:51:30,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:51:28" (1/3) ... [2021-12-28 02:51:30,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbb1c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:51:30, skipping insertion in model container [2021-12-28 02:51:30,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:28" (2/3) ... [2021-12-28 02:51:30,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbb1c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:51:30, skipping insertion in model container [2021-12-28 02:51:30,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:51:30" (3/3) ... [2021-12-28 02:51:30,284 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2021-12-28 02:51:30,289 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 02:51:30,289 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 02:51:30,289 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 02:51:30,289 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 02:51:30,341 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,342 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,342 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,342 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,342 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,342 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,343 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,343 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,343 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,344 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,347 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,347 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,347 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,347 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,351 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,351 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,351 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,351 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,351 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,352 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,352 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,352 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,353 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,353 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,353 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,353 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,353 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,353 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,354 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,354 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,354 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,355 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,355 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,355 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,355 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,356 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,356 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,356 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,356 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,356 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,357 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,357 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,357 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,357 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,357 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,357 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,358 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,358 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,358 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,359 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,359 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,359 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,359 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,359 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,360 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,361 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,364 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,364 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,365 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,366 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,366 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,367 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,367 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,367 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,367 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,367 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,367 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,368 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,368 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:51:30,371 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-28 02:51:30,411 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 02:51:30,417 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 02:51:30,417 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-28 02:51:30,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2021-12-28 02:51:30,471 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-12-28 02:51:30,472 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:51:30,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-12-28 02:51:30,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2021-12-28 02:51:30,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2021-12-28 02:51:30,494 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-12-28 02:51:30,494 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:51:30,494 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:30,495 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:30,495 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -284253320, now seen corresponding path program 1 times [2021-12-28 02:51:30,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:30,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388953039] [2021-12-28 02:51:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:30,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:30,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388953039] [2021-12-28 02:51:30,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388953039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:30,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:30,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 02:51:30,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984190487] [2021-12-28 02:51:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:30,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 02:51:30,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:30,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 02:51:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 02:51:30,826 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2021-12-28 02:51:30,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:30,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:30,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2021-12-28 02:51:30,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:31,017 INFO L129 PetriNetUnfolder]: 57/324 cut-off events. [2021-12-28 02:51:31,018 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-12-28 02:51:31,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 324 events. 57/324 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1316 event pairs, 11 based on Foata normal form. 12/319 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2021-12-28 02:51:31,022 INFO L132 encePairwiseOnDemand]: 110/115 looper letters, 13 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2021-12-28 02:51:31,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 268 flow [2021-12-28 02:51:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 02:51:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 02:51:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2021-12-28 02:51:31,036 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.936231884057971 [2021-12-28 02:51:31,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2021-12-28 02:51:31,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2021-12-28 02:51:31,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:31,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2021-12-28 02:51:31,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,052 INFO L186 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 323 transitions. [2021-12-28 02:51:31,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 268 flow [2021-12-28 02:51:31,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-28 02:51:31,059 INFO L242 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2021-12-28 02:51:31,061 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2021-12-28 02:51:31,064 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2021-12-28 02:51:31,065 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2021-12-28 02:51:31,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,065 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:31,065 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:31,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 02:51:31,066 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2047081111, now seen corresponding path program 1 times [2021-12-28 02:51:31,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:31,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490679313] [2021-12-28 02:51:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:31,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:31,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490679313] [2021-12-28 02:51:31,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490679313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:31,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:31,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:51:31,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409360093] [2021-12-28 02:51:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:31,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:51:31,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:51:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:51:31,307 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2021-12-28 02:51:31,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:31,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2021-12-28 02:51:31,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:31,741 INFO L129 PetriNetUnfolder]: 330/1069 cut-off events. [2021-12-28 02:51:31,742 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2021-12-28 02:51:31,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 1069 events. 330/1069 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7126 event pairs, 59 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1645. Up to 257 conditions per place. [2021-12-28 02:51:31,751 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 18 selfloop transitions, 2 changer transitions 45/145 dead transitions. [2021-12-28 02:51:31,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 422 flow [2021-12-28 02:51:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:51:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:51:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions. [2021-12-28 02:51:31,760 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8714975845410629 [2021-12-28 02:51:31,765 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions. [2021-12-28 02:51:31,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions. [2021-12-28 02:51:31,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:31,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions. [2021-12-28 02:51:31,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,774 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,775 INFO L186 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 902 transitions. [2021-12-28 02:51:31,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 422 flow [2021-12-28 02:51:31,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 145 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-28 02:51:31,781 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2021-12-28 02:51:31,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2021-12-28 02:51:31,782 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2021-12-28 02:51:31,782 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2021-12-28 02:51:31,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:31,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:31,783 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:31,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 02:51:31,784 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1250987432, now seen corresponding path program 1 times [2021-12-28 02:51:31,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:31,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755131077] [2021-12-28 02:51:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:31,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:32,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:32,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755131077] [2021-12-28 02:51:32,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755131077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:32,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:32,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:51:32,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167825321] [2021-12-28 02:51:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:32,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:51:32,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:51:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:51:32,058 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-12-28 02:51:32,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:32,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:32,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-12-28 02:51:32,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:32,483 INFO L129 PetriNetUnfolder]: 268/658 cut-off events. [2021-12-28 02:51:32,483 INFO L130 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2021-12-28 02:51:32,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 658 events. 268/658 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3679 event pairs, 58 based on Foata normal form. 16/646 useless extension candidates. Maximal degree in co-relation 1248. Up to 141 conditions per place. [2021-12-28 02:51:32,488 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 20 selfloop transitions, 4 changer transitions 32/134 dead transitions. [2021-12-28 02:51:32,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 431 flow [2021-12-28 02:51:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:51:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:51:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2021-12-28 02:51:32,491 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8504347826086956 [2021-12-28 02:51:32,491 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 978 transitions. [2021-12-28 02:51:32,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 978 transitions. [2021-12-28 02:51:32,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:32,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 978 transitions. [2021-12-28 02:51:32,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.8) internal successors, (978), 10 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:32,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:32,498 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:32,498 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 10 states and 978 transitions. [2021-12-28 02:51:32,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 431 flow [2021-12-28 02:51:32,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 134 transitions, 397 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-28 02:51:32,508 INFO L242 Difference]: Finished difference. Result has 121 places, 96 transitions, 232 flow [2021-12-28 02:51:32,508 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=121, PETRI_TRANSITIONS=96} [2021-12-28 02:51:32,510 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2021-12-28 02:51:32,511 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 232 flow [2021-12-28 02:51:32,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:32,511 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:32,512 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:32,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 02:51:32,512 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:32,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1258115765, now seen corresponding path program 1 times [2021-12-28 02:51:32,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:32,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049012669] [2021-12-28 02:51:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:32,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:32,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049012669] [2021-12-28 02:51:32,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049012669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:32,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:32,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:51:32,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903825693] [2021-12-28 02:51:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:32,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:51:32,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:51:32,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:51:32,829 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2021-12-28 02:51:32,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:32,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:32,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2021-12-28 02:51:32,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:33,303 INFO L129 PetriNetUnfolder]: 229/656 cut-off events. [2021-12-28 02:51:33,304 INFO L130 PetriNetUnfolder]: For 194/196 co-relation queries the response was YES. [2021-12-28 02:51:33,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 656 events. 229/656 cut-off events. For 194/196 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3425 event pairs, 95 based on Foata normal form. 12/637 useless extension candidates. Maximal degree in co-relation 1218. Up to 255 conditions per place. [2021-12-28 02:51:33,309 INFO L132 encePairwiseOnDemand]: 102/115 looper letters, 23 selfloop transitions, 12 changer transitions 41/152 dead transitions. [2021-12-28 02:51:33,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 152 transitions, 540 flow [2021-12-28 02:51:33,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:51:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-28 02:51:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1519 transitions. [2021-12-28 02:51:33,314 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8255434782608696 [2021-12-28 02:51:33,314 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1519 transitions. [2021-12-28 02:51:33,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1519 transitions. [2021-12-28 02:51:33,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:33,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1519 transitions. [2021-12-28 02:51:33,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 94.9375) internal successors, (1519), 16 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,325 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,325 INFO L186 Difference]: Start difference. First operand has 121 places, 96 transitions, 232 flow. Second operand 16 states and 1519 transitions. [2021-12-28 02:51:33,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 152 transitions, 540 flow [2021-12-28 02:51:33,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 152 transitions, 482 flow, removed 24 selfloop flow, removed 10 redundant places. [2021-12-28 02:51:33,334 INFO L242 Difference]: Finished difference. Result has 132 places, 105 transitions, 300 flow [2021-12-28 02:51:33,335 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=300, PETRI_PLACES=132, PETRI_TRANSITIONS=105} [2021-12-28 02:51:33,336 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 12 predicate places. [2021-12-28 02:51:33,337 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 105 transitions, 300 flow [2021-12-28 02:51:33,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,340 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:33,340 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:33,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 02:51:33,340 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:33,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1388455529, now seen corresponding path program 2 times [2021-12-28 02:51:33,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:33,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027363466] [2021-12-28 02:51:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:33,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:33,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:33,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027363466] [2021-12-28 02:51:33,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027363466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:33,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:33,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:51:33,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336344919] [2021-12-28 02:51:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:33,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:51:33,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:33,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:51:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:51:33,596 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-28 02:51:33,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 105 transitions, 300 flow. Second operand has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:33,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-28 02:51:33,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:33,900 INFO L129 PetriNetUnfolder]: 213/627 cut-off events. [2021-12-28 02:51:33,900 INFO L130 PetriNetUnfolder]: For 911/939 co-relation queries the response was YES. [2021-12-28 02:51:33,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1692 conditions, 627 events. 213/627 cut-off events. For 911/939 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3172 event pairs, 97 based on Foata normal form. 12/607 useless extension candidates. Maximal degree in co-relation 1621. Up to 238 conditions per place. [2021-12-28 02:51:33,905 INFO L132 encePairwiseOnDemand]: 103/115 looper letters, 23 selfloop transitions, 14 changer transitions 28/142 dead transitions. [2021-12-28 02:51:33,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 612 flow [2021-12-28 02:51:33,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 02:51:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-28 02:51:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1151 transitions. [2021-12-28 02:51:33,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8340579710144927 [2021-12-28 02:51:33,909 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1151 transitions. [2021-12-28 02:51:33,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1151 transitions. [2021-12-28 02:51:33,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:33,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1151 transitions. [2021-12-28 02:51:33,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.91666666666667) internal successors, (1151), 12 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,915 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,915 INFO L186 Difference]: Start difference. First operand has 132 places, 105 transitions, 300 flow. Second operand 12 states and 1151 transitions. [2021-12-28 02:51:33,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 612 flow [2021-12-28 02:51:33,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 142 transitions, 580 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-28 02:51:33,920 INFO L242 Difference]: Finished difference. Result has 134 places, 110 transitions, 381 flow [2021-12-28 02:51:33,921 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=381, PETRI_PLACES=134, PETRI_TRANSITIONS=110} [2021-12-28 02:51:33,921 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 14 predicate places. [2021-12-28 02:51:33,921 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 110 transitions, 381 flow [2021-12-28 02:51:33,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:33,922 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:33,922 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:33,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 02:51:33,922 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1380219225, now seen corresponding path program 1 times [2021-12-28 02:51:33,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:33,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606381012] [2021-12-28 02:51:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:33,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:34,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:34,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606381012] [2021-12-28 02:51:34,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606381012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:34,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:34,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:51:34,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906237958] [2021-12-28 02:51:34,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:34,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:51:34,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:34,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:51:34,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:51:34,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-28 02:51:34,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 110 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:34,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:34,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-28 02:51:34,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:34,473 INFO L129 PetriNetUnfolder]: 749/1644 cut-off events. [2021-12-28 02:51:34,474 INFO L130 PetriNetUnfolder]: For 5667/5826 co-relation queries the response was YES. [2021-12-28 02:51:34,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5282 conditions, 1644 events. 749/1644 cut-off events. For 5667/5826 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10125 event pairs, 43 based on Foata normal form. 16/1607 useless extension candidates. Maximal degree in co-relation 5208. Up to 470 conditions per place. [2021-12-28 02:51:34,486 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 40 selfloop transitions, 7 changer transitions 51/176 dead transitions. [2021-12-28 02:51:34,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 176 transitions, 966 flow [2021-12-28 02:51:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:51:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:51:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2021-12-28 02:51:34,489 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8626086956521739 [2021-12-28 02:51:34,489 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2021-12-28 02:51:34,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2021-12-28 02:51:34,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:34,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2021-12-28 02:51:34,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:34,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:34,495 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:34,496 INFO L186 Difference]: Start difference. First operand has 134 places, 110 transitions, 381 flow. Second operand 10 states and 992 transitions. [2021-12-28 02:51:34,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 176 transitions, 966 flow [2021-12-28 02:51:34,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 176 transitions, 895 flow, removed 13 selfloop flow, removed 10 redundant places. [2021-12-28 02:51:34,504 INFO L242 Difference]: Finished difference. Result has 133 places, 108 transitions, 365 flow [2021-12-28 02:51:34,505 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=365, PETRI_PLACES=133, PETRI_TRANSITIONS=108} [2021-12-28 02:51:34,507 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places. [2021-12-28 02:51:34,507 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 108 transitions, 365 flow [2021-12-28 02:51:34,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:34,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:34,507 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:34,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 02:51:34,508 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1898747140, now seen corresponding path program 1 times [2021-12-28 02:51:34,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:34,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330417348] [2021-12-28 02:51:34,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:34,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:34,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:34,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330417348] [2021-12-28 02:51:34,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330417348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:34,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:34,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:51:34,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051444419] [2021-12-28 02:51:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:34,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:51:34,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:51:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:51:34,634 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-28 02:51:34,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 108 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:34,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:34,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-28 02:51:34,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:35,002 INFO L129 PetriNetUnfolder]: 342/965 cut-off events. [2021-12-28 02:51:35,002 INFO L130 PetriNetUnfolder]: For 3361/3474 co-relation queries the response was YES. [2021-12-28 02:51:35,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 965 events. 342/965 cut-off events. For 3361/3474 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5769 event pairs, 35 based on Foata normal form. 29/976 useless extension candidates. Maximal degree in co-relation 3383. Up to 220 conditions per place. [2021-12-28 02:51:35,012 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 48 selfloop transitions, 18 changer transitions 24/168 dead transitions. [2021-12-28 02:51:35,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 168 transitions, 1050 flow [2021-12-28 02:51:35,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 02:51:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-28 02:51:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1087 transitions. [2021-12-28 02:51:35,016 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8592885375494071 [2021-12-28 02:51:35,016 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1087 transitions. [2021-12-28 02:51:35,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1087 transitions. [2021-12-28 02:51:35,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:35,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1087 transitions. [2021-12-28 02:51:35,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,022 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,022 INFO L186 Difference]: Start difference. First operand has 133 places, 108 transitions, 365 flow. Second operand 11 states and 1087 transitions. [2021-12-28 02:51:35,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 168 transitions, 1050 flow [2021-12-28 02:51:35,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 168 transitions, 1032 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-28 02:51:35,029 INFO L242 Difference]: Finished difference. Result has 141 places, 123 transitions, 540 flow [2021-12-28 02:51:35,030 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=540, PETRI_PLACES=141, PETRI_TRANSITIONS=123} [2021-12-28 02:51:35,030 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 21 predicate places. [2021-12-28 02:51:35,031 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 123 transitions, 540 flow [2021-12-28 02:51:35,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,031 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:35,031 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:35,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 02:51:35,032 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 468726475, now seen corresponding path program 1 times [2021-12-28 02:51:35,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:35,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352255883] [2021-12-28 02:51:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:35,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:35,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:35,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352255883] [2021-12-28 02:51:35,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352255883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:35,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:35,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:51:35,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203147491] [2021-12-28 02:51:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:35,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:51:35,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:51:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:51:35,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-28 02:51:35,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 123 transitions, 540 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:35,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-28 02:51:35,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:35,499 INFO L129 PetriNetUnfolder]: 289/855 cut-off events. [2021-12-28 02:51:35,500 INFO L130 PetriNetUnfolder]: For 3836/3952 co-relation queries the response was YES. [2021-12-28 02:51:35,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3408 conditions, 855 events. 289/855 cut-off events. For 3836/3952 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5191 event pairs, 46 based on Foata normal form. 10/845 useless extension candidates. Maximal degree in co-relation 3330. Up to 186 conditions per place. [2021-12-28 02:51:35,507 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 41 selfloop transitions, 22 changer transitions 26/167 dead transitions. [2021-12-28 02:51:35,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 1094 flow [2021-12-28 02:51:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 02:51:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-28 02:51:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1351 transitions. [2021-12-28 02:51:35,510 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8391304347826087 [2021-12-28 02:51:35,510 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1351 transitions. [2021-12-28 02:51:35,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1351 transitions. [2021-12-28 02:51:35,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:35,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1351 transitions. [2021-12-28 02:51:35,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.5) internal successors, (1351), 14 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,517 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,517 INFO L186 Difference]: Start difference. First operand has 141 places, 123 transitions, 540 flow. Second operand 14 states and 1351 transitions. [2021-12-28 02:51:35,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 1094 flow [2021-12-28 02:51:35,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 167 transitions, 974 flow, removed 56 selfloop flow, removed 6 redundant places. [2021-12-28 02:51:35,529 INFO L242 Difference]: Finished difference. Result has 155 places, 124 transitions, 544 flow [2021-12-28 02:51:35,530 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=544, PETRI_PLACES=155, PETRI_TRANSITIONS=124} [2021-12-28 02:51:35,530 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 35 predicate places. [2021-12-28 02:51:35,530 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 124 transitions, 544 flow [2021-12-28 02:51:35,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,531 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:35,531 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:35,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 02:51:35,531 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash 955317872, now seen corresponding path program 1 times [2021-12-28 02:51:35,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:35,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30106223] [2021-12-28 02:51:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:35,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:35,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:35,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30106223] [2021-12-28 02:51:35,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30106223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:35,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:35,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:51:35,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946977959] [2021-12-28 02:51:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:35,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:51:35,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:35,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:51:35,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:51:35,644 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-12-28 02:51:35,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 124 transitions, 544 flow. Second operand has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:35,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-12-28 02:51:35,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:35,872 INFO L129 PetriNetUnfolder]: 131/754 cut-off events. [2021-12-28 02:51:35,872 INFO L130 PetriNetUnfolder]: For 1838/1908 co-relation queries the response was YES. [2021-12-28 02:51:35,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2280 conditions, 754 events. 131/754 cut-off events. For 1838/1908 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5783 event pairs, 7 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 2215. Up to 95 conditions per place. [2021-12-28 02:51:35,878 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 26 selfloop transitions, 1 changer transitions 19/145 dead transitions. [2021-12-28 02:51:35,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 145 transitions, 747 flow [2021-12-28 02:51:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 02:51:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-28 02:51:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 677 transitions. [2021-12-28 02:51:35,880 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8409937888198757 [2021-12-28 02:51:35,880 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 677 transitions. [2021-12-28 02:51:35,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 677 transitions. [2021-12-28 02:51:35,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:35,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 677 transitions. [2021-12-28 02:51:35,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,884 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,884 INFO L186 Difference]: Start difference. First operand has 155 places, 124 transitions, 544 flow. Second operand 7 states and 677 transitions. [2021-12-28 02:51:35,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 145 transitions, 747 flow [2021-12-28 02:51:35,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 145 transitions, 610 flow, removed 45 selfloop flow, removed 17 redundant places. [2021-12-28 02:51:35,899 INFO L242 Difference]: Finished difference. Result has 146 places, 122 transitions, 448 flow [2021-12-28 02:51:35,899 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=146, PETRI_TRANSITIONS=122} [2021-12-28 02:51:35,900 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 26 predicate places. [2021-12-28 02:51:35,900 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 122 transitions, 448 flow [2021-12-28 02:51:35,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:35,901 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:35,901 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:35,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 02:51:35,901 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:35,902 INFO L85 PathProgramCache]: Analyzing trace with hash 834315528, now seen corresponding path program 2 times [2021-12-28 02:51:35,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:35,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259603123] [2021-12-28 02:51:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:35,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:51:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:51:36,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:51:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259603123] [2021-12-28 02:51:36,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259603123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:51:36,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:51:36,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 02:51:36,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709593540] [2021-12-28 02:51:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:51:36,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 02:51:36,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:51:36,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 02:51:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-28 02:51:36,167 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2021-12-28 02:51:36,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 122 transitions, 448 flow. Second operand has 11 states, 11 states have (on average 90.9090909090909) internal successors, (1000), 11 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:36,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:51:36,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2021-12-28 02:51:36,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:51:36,386 INFO L129 PetriNetUnfolder]: 100/707 cut-off events. [2021-12-28 02:51:36,387 INFO L130 PetriNetUnfolder]: For 630/647 co-relation queries the response was YES. [2021-12-28 02:51:36,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 707 events. 100/707 cut-off events. For 630/647 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5507 event pairs, 1 based on Foata normal form. 1/676 useless extension candidates. Maximal degree in co-relation 1696. Up to 88 conditions per place. [2021-12-28 02:51:36,393 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 22 selfloop transitions, 9 changer transitions 6/132 dead transitions. [2021-12-28 02:51:36,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 132 transitions, 558 flow [2021-12-28 02:51:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:51:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:51:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2021-12-28 02:51:36,396 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8048309178743961 [2021-12-28 02:51:36,396 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2021-12-28 02:51:36,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2021-12-28 02:51:36,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:51:36,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2021-12-28 02:51:36,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:36,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:36,401 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:36,401 INFO L186 Difference]: Start difference. First operand has 146 places, 122 transitions, 448 flow. Second operand 9 states and 833 transitions. [2021-12-28 02:51:36,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 132 transitions, 558 flow [2021-12-28 02:51:36,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 132 transitions, 533 flow, removed 8 selfloop flow, removed 8 redundant places. [2021-12-28 02:51:36,411 INFO L242 Difference]: Finished difference. Result has 146 places, 124 transitions, 473 flow [2021-12-28 02:51:36,411 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2021-12-28 02:51:36,412 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 26 predicate places. [2021-12-28 02:51:36,412 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 473 flow [2021-12-28 02:51:36,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.9090909090909) internal successors, (1000), 11 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:51:36,413 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:51:36,413 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:36,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 02:51:36,413 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:51:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:51:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 106931942, now seen corresponding path program 3 times [2021-12-28 02:51:36,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:51:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060161913] [2021-12-28 02:51:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:51:36,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:51:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:51:36,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 02:51:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:51:36,549 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 02:51:36,550 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 02:51:36,551 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-28 02:51:36,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-28 02:51:36,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-28 02:51:36,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-28 02:51:36,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-28 02:51:36,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-28 02:51:36,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 02:51:36,559 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 02:51:36,564 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-28 02:51:36,564 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 02:51:36,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:51:36 BasicIcfg [2021-12-28 02:51:36,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 02:51:36,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 02:51:36,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 02:51:36,672 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 02:51:36,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:51:30" (3/4) ... [2021-12-28 02:51:36,675 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 02:51:36,778 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 02:51:36,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 02:51:36,779 INFO L158 Benchmark]: Toolchain (without parser) took 8426.12ms. Allocated memory was 52.4MB in the beginning and 216.0MB in the end (delta: 163.6MB). Free memory was 28.3MB in the beginning and 102.1MB in the end (delta: -73.7MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2021-12-28 02:51:36,779 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:51:36,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.28ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.0MB in the beginning and 34.0MB in the end (delta: -5.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2021-12-28 02:51:36,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.89ms. Allocated memory is still 62.9MB. Free memory was 34.0MB in the beginning and 43.3MB in the end (delta: -9.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2021-12-28 02:51:36,780 INFO L158 Benchmark]: Boogie Preprocessor took 62.53ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 41.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 02:51:36,781 INFO L158 Benchmark]: RCFGBuilder took 1159.38ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 41.0MB in the beginning and 37.1MB in the end (delta: 3.9MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2021-12-28 02:51:36,781 INFO L158 Benchmark]: TraceAbstraction took 6394.16ms. Allocated memory was 77.6MB in the beginning and 216.0MB in the end (delta: 138.4MB). Free memory was 36.7MB in the beginning and 130.4MB in the end (delta: -93.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2021-12-28 02:51:36,781 INFO L158 Benchmark]: Witness Printer took 106.57ms. Allocated memory is still 216.0MB. Free memory was 130.4MB in the beginning and 102.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-28 02:51:36,783 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.28ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.0MB in the beginning and 34.0MB in the end (delta: -5.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.89ms. Allocated memory is still 62.9MB. Free memory was 34.0MB in the beginning and 43.3MB in the end (delta: -9.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.53ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 41.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1159.38ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 41.0MB in the beginning and 37.1MB in the end (delta: 3.9MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6394.16ms. Allocated memory was 77.6MB in the beginning and 216.0MB in the end (delta: 138.4MB). Free memory was 36.7MB in the beginning and 130.4MB in the end (delta: -93.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 106.57ms. Allocated memory is still 216.0MB. Free memory was 130.4MB in the beginning and 102.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2284; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-2, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 708 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1105 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 74 mSDtfsCounter, 1105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=8, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 3346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-28 02:51:36,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE