./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2520d7ca Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-2520d7c-m [2024-07-17 15:59:49,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-07-17 15:59:49,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-07-17 15:59:49,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-07-17 15:59:49,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-07-17 15:59:49,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-07-17 15:59:49,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-07-17 15:59:49,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-07-17 15:59:49,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-07-17 15:59:49,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-07-17 15:59:49,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-07-17 15:59:49,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-07-17 15:59:49,400 INFO L153 SettingsManager]: * Use SBE=true [2024-07-17 15:59:49,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-07-17 15:59:49,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-07-17 15:59:49,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-07-17 15:59:49,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-07-17 15:59:49,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-07-17 15:59:49,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-07-17 15:59:49,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-07-17 15:59:49,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-07-17 15:59:49,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-07-17 15:59:49,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-07-17 15:59:49,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-07-17 15:59:49,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-07-17 15:59:49,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-07-17 15:59:49,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-07-17 15:59:49,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-07-17 15:59:49,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-07-17 15:59:49,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-07-17 15:59:49,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-17 15:59:49,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-07-17 15:59:49,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-07-17 15:59:49,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-07-17 15:59:49,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-07-17 15:59:49,405 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-07-17 15:59:49,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-07-17 15:59:49,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-07-17 15:59:49,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-07-17 15:59:49,406 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-07-17 15:59:49,406 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-07-17 15:59:49,406 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-07-17 15:59:49,407 INFO L153 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/UGemCutter-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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-07-17 15:59:49,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-07-17 15:59:49,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-07-17 15:59:49,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-07-17 15:59:49,692 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-07-17 15:59:49,693 INFO L274 PluginConnector]: Witness Parser initialized [2024-07-17 15:59:49,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-07-17 15:59:49,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-07-17 15:59:49,766 INFO L274 PluginConnector]: CDTParser initialized [2024-07-17 15:59:49,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-07-17 15:59:50,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-07-17 15:59:51,048 INFO L384 CDTParser]: Found 1 translation units. [2024-07-17 15:59:51,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-07-17 15:59:51,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9a9c6c736/0970fb576836483d802e0ce7bfca7f9e/FLAGb704895a4 [2024-07-17 15:59:51,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9a9c6c736/0970fb576836483d802e0ce7bfca7f9e [2024-07-17 15:59:51,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-07-17 15:59:51,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-07-17 15:59:51,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-07-17 15:59:51,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-07-17 15:59:51,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-07-17 15:59:51,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 17.07 03:59:49" (1/2) ... [2024-07-17 15:59:51,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acc4618 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 17.07 03:59:51, skipping insertion in model container [2024-07-17 15:59:51,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 17.07 03:59:49" (1/2) ... [2024-07-17 15:59:51,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5103a060 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 17.07 03:59:51, skipping insertion in model container [2024-07-17 15:59:51,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 03:59:51" (2/2) ... [2024-07-17 15:59:51,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acc4618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51, skipping insertion in model container [2024-07-17 15:59:51,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 03:59:51" (2/2) ... [2024-07-17 15:59:51,086 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-07-17 15:59:51,105 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-07-17 15:59:51,105 INFO L97 edCorrectnessWitness]: Location invariant before [L795-L795] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL) && (2LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) [2024-07-17 15:59:51,106 INFO L97 edCorrectnessWitness]: Location invariant before [L796-L796] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL) && (2LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) [2024-07-17 15:59:51,106 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-07-17 15:59:51,106 INFO L106 edCorrectnessWitness]: ghost_update [L793-L793] multithreaded = 1; [2024-07-17 15:59:51,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-07-17 15:59:51,290 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-07-17 15:59:51,429 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-17 15:59:51,447 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-07-17 15:59:51,480 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] Start Parsing Local Start Parsing Local Start Parsing Local [2024-07-17 15:59:51,621 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-17 15:59:51,662 INFO L206 MainTranslator]: Completed translation [2024-07-17 15:59:51,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51 WrapperNode [2024-07-17 15:59:51,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-07-17 15:59:51,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-07-17 15:59:51,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-07-17 15:59:51,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-07-17 15:59:51,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,744 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-07-17 15:59:51,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-07-17 15:59:51,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-07-17 15:59:51,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-07-17 15:59:51,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-07-17 15:59:51,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-07-17 15:59:51,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-07-17 15:59:51,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-07-17 15:59:51,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-07-17 15:59:51,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (1/1) ... [2024-07-17 15:59:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-17 15:59:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 15:59:51,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-07-17 15:59:51,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-07-17 15:59:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-07-17 15:59:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-07-17 15:59:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-07-17 15:59:51,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-07-17 15:59:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-07-17 15:59:51,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-07-17 15:59:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-07-17 15:59:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-07-17 15:59:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-07-17 15:59:51,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-07-17 15:59:51,974 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-07-17 15:59:52,078 INFO L244 CfgBuilder]: Building ICFG [2024-07-17 15:59:52,080 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-07-17 15:59:52,468 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-07-17 15:59:52,469 INFO L293 CfgBuilder]: Performing block encoding [2024-07-17 15:59:52,604 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-07-17 15:59:52,604 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-07-17 15:59:52,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 03:59:52 BoogieIcfgContainer [2024-07-17 15:59:52,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-07-17 15:59:52,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-07-17 15:59:52,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-07-17 15:59:52,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-07-17 15:59:52,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 17.07 03:59:49" (1/4) ... [2024-07-17 15:59:52,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c28ad02 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 17.07 03:59:52, skipping insertion in model container [2024-07-17 15:59:52,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 03:59:51" (2/4) ... [2024-07-17 15:59:52,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c28ad02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 03:59:52, skipping insertion in model container [2024-07-17 15:59:52,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 03:59:51" (3/4) ... [2024-07-17 15:59:52,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c28ad02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 03:59:52, skipping insertion in model container [2024-07-17 15:59:52,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 03:59:52" (4/4) ... [2024-07-17 15:59:52,619 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-07-17 15:59:52,632 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-07-17 15:59:52,632 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-07-17 15:59:52,632 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-07-17 15:59:52,665 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-17 15:59:52,722 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 15:59:52,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-17 15:59:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 15:59:52,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-07-17 15:59:52,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-07-17 15:59:52,827 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-17 15:59:52,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-17 15:59:52,842 INFO L357 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=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22f5e547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 15:59:52,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-07-17 15:59:52,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 15:59:52,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 15:59:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 306675205, now seen corresponding path program 1 times [2024-07-17 15:59:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 15:59:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922759730] [2024-07-17 15:59:52,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 15:59:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 15:59:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 15:59:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 15:59:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 15:59:54,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922759730] [2024-07-17 15:59:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922759730] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 15:59:54,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 15:59:54,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-07-17 15:59:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115516684] [2024-07-17 15:59:54,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 15:59:54,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-07-17 15:59:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 15:59:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-07-17 15:59:54,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-07-17 15:59:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:54,231 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 15:59:54,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2024-07-17 15:59:54,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:54,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-07-17 15:59:54,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 15:59:54,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 15:59:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1718579468, now seen corresponding path program 1 times [2024-07-17 15:59:54,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 15:59:54,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802007712] [2024-07-17 15:59:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 15:59:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 15:59:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 15:59:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 15:59:57,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 15:59:57,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802007712] [2024-07-17 15:59:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802007712] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 15:59:57,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 15:59:57,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-17 15:59:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844323710] [2024-07-17 15:59:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 15:59:57,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-07-17 15:59:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 15:59:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-07-17 15:59:57,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-07-17 15:59:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:57,068 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 15:59:57,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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) [2024-07-17 15:59:57,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:57,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 15:59:57,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-07-17 15:59:57,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 15:59:57,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 15:59:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1508504654, now seen corresponding path program 1 times [2024-07-17 15:59:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 15:59:57,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50216174] [2024-07-17 15:59:57,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 15:59:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 15:59:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 15:59:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 15:59:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 15:59:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50216174] [2024-07-17 15:59:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50216174] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 15:59:57,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 15:59:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-07-17 15:59:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811302509] [2024-07-17 15:59:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 15:59:57,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 15:59:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 15:59:57,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 15:59:57,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-07-17 15:59:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:57,536 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 15:59:57,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-07-17 15:59:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 15:59:57,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 15:59:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 15:59:57,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-07-17 15:59:57,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 15:59:57,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 15:59:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash -702372204, now seen corresponding path program 1 times [2024-07-17 15:59:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 15:59:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831636507] [2024-07-17 15:59:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 15:59:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 15:59:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 15:59:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 15:59:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 15:59:58,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831636507] [2024-07-17 15:59:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831636507] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 15:59:58,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 15:59:58,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-17 15:59:58,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069908921] [2024-07-17 15:59:58,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 15:59:58,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-07-17 15:59:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 15:59:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-07-17 15:59:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-07-17 15:59:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:58,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 15:59:58,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-07-17 15:59:58,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:58,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 15:59:58,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 15:59:58,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 15:59:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 15:59:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 15:59:58,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-07-17 15:59:58,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 15:59:58,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 15:59:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2007563091, now seen corresponding path program 1 times [2024-07-17 15:59:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 15:59:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391475045] [2024-07-17 15:59:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 15:59:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 15:59:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 15:59:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 15:59:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 15:59:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391475045] [2024-07-17 15:59:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391475045] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 15:59:58,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 15:59:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-07-17 15:59:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929534676] [2024-07-17 15:59:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 15:59:58,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 15:59:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 15:59:58,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 15:59:58,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-07-17 15:59:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:58,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 15:59:58,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-07-17 15:59:58,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:58,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 15:59:58,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 15:59:58,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-17 15:59:58,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 15:59:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 15:59:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 15:59:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 15:59:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 15:59:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 15:59:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-07-17 15:59:58,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 15:59:58,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 15:59:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 827870193, now seen corresponding path program 1 times [2024-07-17 15:59:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 15:59:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732180775] [2024-07-17 15:59:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 15:59:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 15:59:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 16:00:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 16:00:01,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 16:00:01,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732180775] [2024-07-17 16:00:01,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732180775] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 16:00:01,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 16:00:01,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-07-17 16:00:01,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024255158] [2024-07-17 16:00:01,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 16:00:01,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-17 16:00:01,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 16:00:01,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-17 16:00:01,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-07-17 16:00:01,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:01,146 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 16:00:01,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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) [2024-07-17 16:00:01,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:01,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:01,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:01,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:01,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:01,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 16:00:01,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-07-17 16:00:01,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 16:00:01,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 16:00:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1252632336, now seen corresponding path program 1 times [2024-07-17 16:00:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 16:00:01,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712971764] [2024-07-17 16:00:01,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 16:00:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 16:00:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 16:00:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 16:00:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 16:00:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712971764] [2024-07-17 16:00:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712971764] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 16:00:03,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 16:00:03,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-07-17 16:00:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061470844] [2024-07-17 16:00:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 16:00:03,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-17 16:00:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 16:00:03,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-17 16:00:03,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-07-17 16:00:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:03,803 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 16:00:03,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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) [2024-07-17 16:00:03,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:03,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:03,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:03,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:03,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:03,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 16:00:03,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 16:00:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 16:00:04,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-07-17 16:00:04,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 16:00:04,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 16:00:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1620193330, now seen corresponding path program 1 times [2024-07-17 16:00:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 16:00:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318206238] [2024-07-17 16:00:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 16:00:04,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 16:00:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 16:00:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 16:00:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 16:00:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318206238] [2024-07-17 16:00:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318206238] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 16:00:05,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 16:00:05,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-07-17 16:00:05,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454637422] [2024-07-17 16:00:05,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 16:00:05,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 16:00:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 16:00:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 16:00:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-07-17 16:00:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:05,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 16:00:05,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 16:00:05,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 16:00:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 16:00:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:06,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-07-17 16:00:06,230 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 16:00:06,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 16:00:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 498424621, now seen corresponding path program 2 times [2024-07-17 16:00:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 16:00:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436175815] [2024-07-17 16:00:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 16:00:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 16:00:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 16:00:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 16:00:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 16:00:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436175815] [2024-07-17 16:00:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436175815] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 16:00:08,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 16:00:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-07-17 16:00:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751585522] [2024-07-17 16:00:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 16:00:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-17 16:00:08,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 16:00:08,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-17 16:00:08,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-07-17 16:00:08,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:08,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 16:00:08,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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) [2024-07-17 16:00:08,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:08,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:08,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:08,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:08,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:08,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 16:00:08,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 16:00:08,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:08,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-17 16:00:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 16:00:08,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-07-17 16:00:08,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-17 16:00:08,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 16:00:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash 596615006, now seen corresponding path program 2 times [2024-07-17 16:00:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 16:00:08,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840173195] [2024-07-17 16:00:08,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 16:00:08,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 16:00:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 16:00:08,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-17 16:00:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 16:00:09,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-17 16:00:09,012 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-17 16:00:09,012 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-07-17 16:00:09,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-07-17 16:00:09,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-07-17 16:00:09,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-07-17 16:00:09,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-07-17 16:00:09,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-07-17 16:00:09,021 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-07-17 16:00:09,023 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-07-17 16:00:09,026 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-07-17 16:00:09,026 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-07-17 16:00:09,068 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-07-17 16:00:09,068 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-07-17 16:00:09,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 04:00:09 BasicIcfg [2024-07-17 16:00:09,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-07-17 16:00:09,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-07-17 16:00:09,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-07-17 16:00:09,069 INFO L274 PluginConnector]: Witness Printer initialized [2024-07-17 16:00:09,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 03:59:52" (4/5) ... [2024-07-17 16:00:09,070 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-07-17 16:00:09,150 INFO L149 WitnessManager]: Wrote witness to /storage/repos/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i-witness.graphml [2024-07-17 16:00:09,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-07-17 16:00:09,151 INFO L158 Benchmark]: Toolchain (without parser) took 18073.65ms. Allocated memory was 184.5MB in the beginning and 851.4MB in the end (delta: 666.9MB). Free memory was 152.5MB in the beginning and 652.8MB in the end (delta: -500.3MB). Peak memory consumption was 166.0MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,151 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-07-17 16:00:09,151 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 184.5MB. Free memory was 149.9MB in the beginning and 149.8MB in the end (delta: 124.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.34ms. Allocated memory is still 184.5MB. Free memory was 151.9MB in the beginning and 119.8MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.56ms. Allocated memory is still 184.5MB. Free memory was 119.8MB in the beginning and 113.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,152 INFO L158 Benchmark]: Boogie Preprocessor took 135.05ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 147.6MB in the end (delta: -34.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,152 INFO L158 Benchmark]: RCFGBuilder took 723.37ms. Allocated memory is still 184.5MB. Free memory was 147.6MB in the beginning and 71.8MB in the end (delta: 75.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,153 INFO L158 Benchmark]: TraceAbstraction took 16462.19ms. Allocated memory was 184.5MB in the beginning and 851.4MB in the end (delta: 666.9MB). Free memory was 70.7MB in the beginning and 665.4MB in the end (delta: -594.7MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,153 INFO L158 Benchmark]: Witness Printer took 81.77ms. Allocated memory is still 851.4MB. Free memory was 665.4MB in the beginning and 652.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-07-17 16:00:09,155 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.92ms. Allocated memory is still 184.5MB. Free memory was 149.9MB in the beginning and 149.8MB in the end (delta: 124.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.34ms. Allocated memory is still 184.5MB. Free memory was 151.9MB in the beginning and 119.8MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.56ms. Allocated memory is still 184.5MB. Free memory was 119.8MB in the beginning and 113.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.05ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 147.6MB in the end (delta: -34.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 723.37ms. Allocated memory is still 184.5MB. Free memory was 147.6MB in the beginning and 71.8MB in the end (delta: 75.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16462.19ms. Allocated memory was 184.5MB in the beginning and 851.4MB in the end (delta: 666.9MB). Free memory was 70.7MB in the beginning and 665.4MB in the end (delta: -594.7MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Witness Printer took 81.77ms. Allocated memory is still 851.4MB. Free memory was 665.4MB in the beginning and 652.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2005, independent: 1726, independent conditional: 1417, independent unconditional: 309, dependent: 279, dependent conditional: 241, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1876, independent: 1726, independent conditional: 1417, independent unconditional: 309, dependent: 150, dependent conditional: 112, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1876, independent: 1726, independent conditional: 1417, independent unconditional: 309, dependent: 150, dependent conditional: 112, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2490, independent: 1726, independent conditional: 168, independent unconditional: 1558, dependent: 764, dependent conditional: 446, dependent unconditional: 318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2490, independent: 1726, independent conditional: 168, independent unconditional: 1558, dependent: 764, dependent conditional: 323, dependent unconditional: 441, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2490, independent: 1726, independent conditional: 168, independent unconditional: 1558, dependent: 764, dependent conditional: 323, dependent unconditional: 441, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 459, independent: 355, independent conditional: 42, independent unconditional: 313, dependent: 104, dependent conditional: 59, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 459, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 158, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 104, dependent conditional: 59, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 158, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 104, dependent conditional: 59, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1390, independent: 514, independent conditional: 407, independent unconditional: 107, dependent: 876, dependent conditional: 557, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2490, independent: 1371, independent conditional: 126, independent unconditional: 1245, dependent: 660, dependent conditional: 264, dependent unconditional: 396, unknown: 459, unknown conditional: 101, unknown unconditional: 358] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 355, Positive conditional cache size: 42, Positive unconditional cache size: 313, Negative cache size: 104, Negative conditional cache size: 59, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 123, Maximal queried relation: 7, Independence queries for same thread: 129 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 132, Number of trivial persistent sets: 85, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 347, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2005, independent: 1726, independent conditional: 1417, independent unconditional: 309, dependent: 279, dependent conditional: 241, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1876, independent: 1726, independent conditional: 1417, independent unconditional: 309, dependent: 150, dependent conditional: 112, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1876, independent: 1726, independent conditional: 1417, independent unconditional: 309, dependent: 150, dependent conditional: 112, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2490, independent: 1726, independent conditional: 168, independent unconditional: 1558, dependent: 764, dependent conditional: 446, dependent unconditional: 318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2490, independent: 1726, independent conditional: 168, independent unconditional: 1558, dependent: 764, dependent conditional: 323, dependent unconditional: 441, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2490, independent: 1726, independent conditional: 168, independent unconditional: 1558, dependent: 764, dependent conditional: 323, dependent unconditional: 441, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 459, independent: 355, independent conditional: 42, independent unconditional: 313, dependent: 104, dependent conditional: 59, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 459, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 158, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 104, dependent conditional: 59, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 158, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 104, dependent conditional: 59, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1390, independent: 514, independent conditional: 407, independent unconditional: 107, dependent: 876, dependent conditional: 557, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2490, independent: 1371, independent conditional: 126, independent unconditional: 1245, dependent: 660, dependent conditional: 264, dependent unconditional: 396, unknown: 459, unknown conditional: 101, unknown unconditional: 358] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 355, Positive conditional cache size: 42, Positive unconditional cache size: 313, Negative cache size: 104, Negative conditional cache size: 59, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 123, Maximal queried relation: 7, Independence queries for same thread: 129 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L795] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) y$flush_delayed) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL))); [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) y$flush_delayed) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L779] 2 return 0; [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 52 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 3.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 61, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 6370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2024-07-17 16:00:09,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-07-17 16:00:09,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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