./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi010.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-20_10-08-36.files/mutex-meet-ghost/rfi010.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da67795f 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/rfi010.i ./goblint.2024-08-20_10-08-36.files/mutex-meet-ghost/rfi010.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.dk.goblint-eval-da67795-m [2024-08-27 06:29:11,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 06:29:11,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-27 06:29:11,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 06:29:11,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 06:29:11,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 06:29:11,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 06:29:11,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 06:29:11,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 06:29:11,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 06:29:11,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 06:29:11,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 06:29:11,180 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 06:29:11,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 06:29:11,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 06:29:11,181 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 06:29:11,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-27 06:29:11,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 06:29:11,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 06:29:11,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 06:29:11,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 06:29:11,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 06:29:11,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 06:29:11,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 06:29:11,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 06:29:11,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 06:29:11,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 06:29:11,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 06:29:11,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 06:29:11,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 06:29:11,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 06:29:11,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 06:29:11,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 06:29:11,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 06:29:11,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-27 06:29:11,189 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 06:29:11,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-27 06:29:11,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 06:29:11,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 06:29:11,190 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 06:29:11,190 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 06:29:11,190 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 06:29:11,191 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-08-27 06:29:11,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 06:29:11,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 06:29:11,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 06:29:11,446 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 06:29:11,447 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 06:29:11,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/mutex-meet-ghost/rfi010.yml/witness.yml [2024-08-27 06:29:11,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 06:29:11,590 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 06:29:11,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-08-27 06:29:13,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 06:29:13,244 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 06:29:13,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-08-27 06:29:13,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/533d42ff9/abc989578cad43428f7e6f17e43ccb14/FLAG251531a66 [2024-08-27 06:29:13,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/533d42ff9/abc989578cad43428f7e6f17e43ccb14 [2024-08-27 06:29:13,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 06:29:13,281 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 06:29:13,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 06:29:13,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 06:29:13,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 06:29:13,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 06:29:11" (1/2) ... [2024-08-27 06:29:13,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a3aea4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 06:29:13, skipping insertion in model container [2024-08-27 06:29:13,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 06:29:11" (1/2) ... [2024-08-27 06:29:13,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7677a1b2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 06:29:13, skipping insertion in model container [2024-08-27 06:29:13,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:29:13" (2/2) ... [2024-08-27 06:29:13,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a3aea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13, skipping insertion in model container [2024-08-27 06:29:13,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:29:13" (2/2) ... [2024-08-27 06:29:13,297 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 06:29:13,356 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 06:29:13,357 INFO L1541 ArrayList]: Location invariant before [L826-L826] ((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 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_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )x) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL) && (long long )x - (long long )y$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$w_buff1_used >= 0LL) && (long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL) && (long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$read_delayed - (long long )y$w_buff1_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_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0) [2024-08-27 06:29:13,357 INFO L1541 ArrayList]: Location invariant before [L827-L827] ((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 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_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )x) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL) && (long long )x - (long long )y$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$w_buff1_used >= 0LL) && (long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL) && (long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$read_delayed - (long long )y$w_buff1_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_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0) [2024-08-27 06:29:13,358 INFO L1541 ArrayList]: ghost_variable multithreaded = 0 [2024-08-27 06:29:13,358 INFO L1541 ArrayList]: ghost_update [L824-L824] multithreaded = 1; [2024-08-27 06:29:13,398 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 06:29:13,555 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/rfi010.i[983,996] [2024-08-27 06:29:13,798 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 06:29:13,815 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-27 06:29:13,843 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/rfi010.i[983,996] Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-27 06:29:13,951 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 06:29:13,981 INFO L206 MainTranslator]: Completed translation [2024-08-27 06:29:13,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13 WrapperNode [2024-08-27 06:29:13,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 06:29:13,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 06:29:13,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 06:29:13,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 06:29:13,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,065 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-08-27 06:29:14,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 06:29:14,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 06:29:14,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 06:29:14,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 06:29:14,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 06:29:14,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 06:29:14,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 06:29:14,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 06:29:14,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (1/1) ... [2024-08-27 06:29:14,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 06:29:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 06:29:14,167 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-08-27 06:29:14,171 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-08-27 06:29:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-27 06:29:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 06:29:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-08-27 06:29:14,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-08-27 06:29:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-08-27 06:29:14,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-08-27 06:29:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-27 06:29:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-27 06:29:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 06:29:14,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 06:29:14,214 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 06:29:14,360 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 06:29:14,363 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 06:29:14,754 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 06:29:14,754 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 06:29:14,957 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 06:29:14,957 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-27 06:29:14,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:29:14 BoogieIcfgContainer [2024-08-27 06:29:14,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 06:29:14,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 06:29:14,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 06:29:14,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 06:29:14,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 06:29:11" (1/4) ... [2024-08-27 06:29:14,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfc842f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 06:29:14, skipping insertion in model container [2024-08-27 06:29:14,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:29:13" (2/4) ... [2024-08-27 06:29:14,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfc842f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:29:14, skipping insertion in model container [2024-08-27 06:29:14,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:13" (3/4) ... [2024-08-27 06:29:14,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfc842f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:29:14, skipping insertion in model container [2024-08-27 06:29:14,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:29:14" (4/4) ... [2024-08-27 06:29:14,967 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2024-08-27 06:29:14,983 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 06:29:14,983 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-08-27 06:29:14,983 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 06:29:15,033 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 06:29:15,068 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 06:29:15,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 06:29:15,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 06:29:15,072 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-08-27 06:29:15,076 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-08-27 06:29:15,105 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 06:29:15,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-08-27 06:29:15,119 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;@5bb1aa55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 06:29:15,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 06:29:15,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-27 06:29:15,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 06:29:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -603913411, now seen corresponding path program 1 times [2024-08-27 06:29:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 06:29:15,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038878151] [2024-08-27 06:29:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 06:29:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 06:29:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 06:29:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 06:29:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 06:29:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038878151] [2024-08-27 06:29:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038878151] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 06:29:16,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 06:29:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-27 06:29:16,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350472191] [2024-08-27 06:29:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 06:29:16,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 06:29:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 06:29:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 06:29:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 06:29:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:16,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 06:29:16,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-08-27 06:29:16,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:17,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-27 06:29:17,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-27 06:29:17,192 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-27 06:29:17,193 INFO L308 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2024-08-27 06:29:17,199 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 06:29:17,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 06:29:17,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 06:29:17,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 06:29:17,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-08-27 06:29:17,223 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 06:29:17,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 06:29:17,227 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;@5bb1aa55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 06:29:17,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-08-27 06:29:17,356 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-08-27 06:29:17,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 06:29:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash 346076999, now seen corresponding path program 1 times [2024-08-27 06:29:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 06:29:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757295444] [2024-08-27 06:29:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 06:29:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 06:29:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 06:29:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 06:29:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 06:29:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757295444] [2024-08-27 06:29:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757295444] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 06:29:18,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 06:29:18,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-27 06:29:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094185235] [2024-08-27 06:29:18,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 06:29:18,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 06:29:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 06:29:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 06:29:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 06:29:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:18,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 06:29:18,818 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-08-27 06:29:18,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-27 06:29:19,047 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-08-27 06:29:19,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 06:29:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash -312779869, now seen corresponding path program 1 times [2024-08-27 06:29:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 06:29:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908475507] [2024-08-27 06:29:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 06:29:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 06:29:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 06:29:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 06:29:25,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 06:29:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908475507] [2024-08-27 06:29:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908475507] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 06:29:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 06:29:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-27 06:29:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367492250] [2024-08-27 06:29:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 06:29:25,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-27 06:29:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 06:29:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-27 06:29:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-08-27 06:29:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:25,881 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 06:29:25,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-08-27 06:29:25,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:25,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 06:29:26,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-27 06:29:26,360 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-08-27 06:29:26,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 06:29:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1604764894, now seen corresponding path program 1 times [2024-08-27 06:29:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 06:29:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034445623] [2024-08-27 06:29:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 06:29:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 06:29:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 06:29:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 06:29:26,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 06:29:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034445623] [2024-08-27 06:29:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034445623] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 06:29:26,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 06:29:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 06:29:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957150327] [2024-08-27 06:29:26,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 06:29:26,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 06:29:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 06:29:26,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 06:29:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 06:29:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:26,607 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 06:29:26,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-08-27 06:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 06:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 06:29:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 06:29:26,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-27 06:29:26,767 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-08-27 06:29:26,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 06:29:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1247839163, now seen corresponding path program 1 times [2024-08-27 06:29:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 06:29:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968881560] [2024-08-27 06:29:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 06:29:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 06:29:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 06:29:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 06:29:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 06:29:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968881560] [2024-08-27 06:29:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968881560] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 06:29:28,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 06:29:28,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-27 06:29:28,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783681747] [2024-08-27 06:29:28,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 06:29:28,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-27 06:29:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 06:29:28,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-27 06:29:28,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-08-27 06:29:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:28,789 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 06:29:28,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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-08-27 06:29:28,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:28,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 06:29:28,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 06:29:28,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 06:29:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 06:29:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 06:29:29,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-27 06:29:29,790 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-08-27 06:29:29,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 06:29:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash 567586050, now seen corresponding path program 1 times [2024-08-27 06:29:29,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 06:29:29,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842875789] [2024-08-27 06:29:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 06:29:29,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 06:29:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 06:29:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 06:29:33,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 06:29:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842875789] [2024-08-27 06:29:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842875789] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 06:29:33,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 06:29:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-27 06:29:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136472235] [2024-08-27 06:29:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 06:29:33,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-27 06:29:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 06:29:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-27 06:29:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-27 06:29:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:33,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 06:29:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-08-27 06:29:33,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:33,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 06:29:33,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 06:29:33,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 06:29:33,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 06:29:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 06:29:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 06:29:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 06:29:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 06:29:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 06:29:33,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-27 06:29:33,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-27 06:29:33,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 06:29:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1775124679, now seen corresponding path program 2 times [2024-08-27 06:29:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 06:29:33,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880436330] [2024-08-27 06:29:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 06:29:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 06:29:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 06:29:33,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 06:29:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 06:29:33,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 06:29:33,661 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 06:29:33,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-08-27 06:29:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-08-27 06:29:33,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-08-27 06:29:33,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-08-27 06:29:33,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-08-27 06:29:33,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-27 06:29:33,667 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-08-27 06:29:33,667 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-08-27 06:29:33,670 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-27 06:29:33,674 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-27 06:29:33,739 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-08-27 06:29:33,739 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-08-27 06:29:33,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:29:33 BasicIcfg [2024-08-27 06:29:33,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-27 06:29:33,740 INFO L158 Benchmark]: Toolchain (without parser) took 20458.66ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 136.9MB in the beginning and 762.8MB in the end (delta: -625.9MB). Peak memory consumption was 303.3MB. Max. memory is 16.1GB. [2024-08-27 06:29:33,740 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 06:29:33,740 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 211.8MB. Free memory is still 184.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 06:29:33,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.99ms. Allocated memory is still 211.8MB. Free memory was 136.7MB in the beginning and 165.8MB in the end (delta: -29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-27 06:29:33,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.86ms. Allocated memory is still 211.8MB. Free memory was 165.8MB in the beginning and 159.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-08-27 06:29:33,741 INFO L158 Benchmark]: Boogie Preprocessor took 65.20ms. Allocated memory is still 211.8MB. Free memory was 159.5MB in the beginning and 157.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-27 06:29:33,741 INFO L158 Benchmark]: RCFGBuilder took 825.58ms. Allocated memory is still 211.8MB. Free memory was 157.0MB in the beginning and 149.4MB in the end (delta: 7.7MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-08-27 06:29:33,741 INFO L158 Benchmark]: TraceAbstraction took 18779.98ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 148.3MB in the beginning and 762.8MB in the end (delta: -614.5MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. [2024-08-27 06:29:33,742 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.17ms. Allocated memory is still 117.4MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 211.8MB. Free memory is still 184.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.99ms. Allocated memory is still 211.8MB. Free memory was 136.7MB in the beginning and 165.8MB in the end (delta: -29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.86ms. Allocated memory is still 211.8MB. Free memory was 165.8MB in the beginning and 159.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.20ms. Allocated memory is still 211.8MB. Free memory was 159.5MB in the beginning and 157.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 825.58ms. Allocated memory is still 211.8MB. Free memory was 157.0MB in the beginning and 149.4MB in the end (delta: 7.7MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18779.98ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 148.3MB in the beginning and 762.8MB in the end (delta: -614.5MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 861, independent: 789, independent conditional: 372, independent unconditional: 417, dependent: 72, dependent conditional: 43, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 849, independent: 789, independent conditional: 372, independent unconditional: 417, dependent: 60, dependent conditional: 31, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 849, independent: 789, independent conditional: 372, independent unconditional: 417, dependent: 60, dependent conditional: 31, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 905, independent: 789, independent conditional: 25, independent unconditional: 764, dependent: 116, dependent conditional: 31, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 905, independent: 789, independent conditional: 25, independent unconditional: 764, dependent: 116, dependent conditional: 30, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 905, independent: 789, independent conditional: 25, independent unconditional: 764, dependent: 116, dependent conditional: 30, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 464, independent: 421, independent conditional: 3, independent unconditional: 418, dependent: 43, dependent conditional: 11, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 464, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 43, dependent conditional: 11, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 43, dependent conditional: 11, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1175, independent: 298, independent conditional: 73, independent unconditional: 226, dependent: 877, dependent conditional: 310, dependent unconditional: 567, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 905, independent: 368, independent conditional: 22, independent unconditional: 346, dependent: 73, dependent conditional: 19, dependent unconditional: 54, unknown: 464, unknown conditional: 14, unknown unconditional: 450] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 421, Positive conditional cache size: 3, Positive unconditional cache size: 418, Negative cache size: 43, Negative conditional cache size: 11, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1, Independence queries for same thread: 12 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.8s, Number of persistent set computation: 97, Number of trivial persistent sets: 65, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 446, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 861, independent: 789, independent conditional: 372, independent unconditional: 417, dependent: 72, dependent conditional: 43, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 849, independent: 789, independent conditional: 372, independent unconditional: 417, dependent: 60, dependent conditional: 31, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 849, independent: 789, independent conditional: 372, independent unconditional: 417, dependent: 60, dependent conditional: 31, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 905, independent: 789, independent conditional: 25, independent unconditional: 764, dependent: 116, dependent conditional: 31, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 905, independent: 789, independent conditional: 25, independent unconditional: 764, dependent: 116, dependent conditional: 30, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 905, independent: 789, independent conditional: 25, independent unconditional: 764, dependent: 116, dependent conditional: 30, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 464, independent: 421, independent conditional: 3, independent unconditional: 418, dependent: 43, dependent conditional: 11, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 464, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 43, dependent conditional: 11, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 43, dependent conditional: 11, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1175, independent: 298, independent conditional: 73, independent unconditional: 226, dependent: 877, dependent conditional: 310, dependent unconditional: 567, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 905, independent: 368, independent conditional: 22, independent unconditional: 346, dependent: 73, dependent conditional: 19, dependent unconditional: 54, unknown: 464, unknown conditional: 14, unknown unconditional: 450] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 421, Positive conditional cache size: 3, Positive unconditional cache size: 418, Negative cache size: 43, Negative conditional cache size: 11, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1, Independence queries for same thread: 12 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 898, independent: 818, independent conditional: 485, independent unconditional: 333, dependent: 80, dependent conditional: 51, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 866, independent: 818, independent conditional: 485, independent unconditional: 333, dependent: 48, dependent conditional: 19, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 866, independent: 818, independent conditional: 485, independent unconditional: 333, dependent: 48, dependent conditional: 19, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 937, independent: 818, independent conditional: 15, independent unconditional: 803, dependent: 119, dependent conditional: 56, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 937, independent: 818, independent conditional: 15, independent unconditional: 803, dependent: 119, dependent conditional: 43, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937, independent: 818, independent conditional: 15, independent unconditional: 803, dependent: 119, dependent conditional: 43, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 385, independent: 343, independent conditional: 8, independent unconditional: 335, dependent: 42, dependent conditional: 13, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 385, independent: 323, independent conditional: 0, independent unconditional: 323, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 42, dependent conditional: 13, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 42, dependent conditional: 13, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 971, independent: 275, independent conditional: 55, independent unconditional: 220, dependent: 696, dependent conditional: 218, dependent unconditional: 477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 937, independent: 475, independent conditional: 7, independent unconditional: 468, dependent: 77, dependent conditional: 30, dependent unconditional: 47, unknown: 385, unknown conditional: 21, unknown unconditional: 364] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 343, Positive conditional cache size: 8, Positive unconditional cache size: 335, Negative cache size: 42, Negative conditional cache size: 13, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 3, Independence queries for same thread: 32 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.7s, Number of persistent set computation: 90, Number of trivial persistent sets: 56, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 362, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 898, independent: 818, independent conditional: 485, independent unconditional: 333, dependent: 80, dependent conditional: 51, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 866, independent: 818, independent conditional: 485, independent unconditional: 333, dependent: 48, dependent conditional: 19, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 866, independent: 818, independent conditional: 485, independent unconditional: 333, dependent: 48, dependent conditional: 19, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 937, independent: 818, independent conditional: 15, independent unconditional: 803, dependent: 119, dependent conditional: 56, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 937, independent: 818, independent conditional: 15, independent unconditional: 803, dependent: 119, dependent conditional: 43, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937, independent: 818, independent conditional: 15, independent unconditional: 803, dependent: 119, dependent conditional: 43, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 385, independent: 343, independent conditional: 8, independent unconditional: 335, dependent: 42, dependent conditional: 13, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 385, independent: 323, independent conditional: 0, independent unconditional: 323, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 42, dependent conditional: 13, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 42, dependent conditional: 13, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 971, independent: 275, independent conditional: 55, independent unconditional: 220, dependent: 696, dependent conditional: 218, dependent unconditional: 477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 937, independent: 475, independent conditional: 7, independent unconditional: 468, dependent: 77, dependent conditional: 30, dependent unconditional: 47, unknown: 385, unknown conditional: 21, unknown unconditional: 364] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 343, Positive conditional cache size: 8, Positive unconditional cache size: 335, Negative cache size: 42, Negative conditional cache size: 13, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 3, Independence queries for same thread: 32 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-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] [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-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] [L825] 0 pthread_t t1762; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-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] [L826] 0 //@ assert (((((((((((((((((!multithreaded || ((y == 0) || (y == 1))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((0LL - (long long) y) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$mem_tmp) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 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_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice2) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) x) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_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_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-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] [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-1, t1762=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=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] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L798] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L827] 0 //@ assert (((((((((((((((((!multithreaded || ((y == 0) || (y == 1))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((0LL - (long long) y) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$mem_tmp) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 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_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice2) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) x) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_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_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-1, t1762=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 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) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-1, t1762=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 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) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-1, t1762=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-1, t1762=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 826]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.4s, 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: 3, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 2.3s, 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: 36, 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, 13.4s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 2843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-08-27 06:29:33,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-08-27 06:29:33,981 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-08-27 06:29:34,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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