./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/mix000.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7bc0c755 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/mix000.opt.i ./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/mix000.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-validation-atomicfix-7bc0c75-m [2024-08-22 20:54:08,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-22 20:54:08,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-22 20:54:08,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-22 20:54:08,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-22 20:54:08,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-22 20:54:08,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-22 20:54:08,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-22 20:54:08,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-22 20:54:08,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-22 20:54:08,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-22 20:54:08,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-22 20:54:08,245 INFO L153 SettingsManager]: * Use SBE=true [2024-08-22 20:54:08,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-22 20:54:08,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-22 20:54:08,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-22 20:54:08,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-22 20:54:08,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-22 20:54:08,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-22 20:54:08,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-22 20:54:08,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-22 20:54:08,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-22 20:54:08,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-22 20:54:08,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-22 20:54:08,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-22 20:54:08,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-22 20:54:08,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-22 20:54:08,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-22 20:54:08,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-22 20:54:08,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-22 20:54:08,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-22 20:54:08,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-22 20:54:08,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-22 20:54:08,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-22 20:54:08,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-22 20:54:08,250 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-22 20:54:08,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-22 20:54:08,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-22 20:54:08,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-22 20:54:08,251 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-22 20:54:08,251 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-22 20:54:08,254 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-22 20:54:08,255 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-22 20:54:08,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-22 20:54:08,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-22 20:54:08,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-22 20:54:08,469 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-22 20:54:08,470 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-22 20:54:08,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/mix000.opt.yml/witness.yml [2024-08-22 20:54:08,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-22 20:54:08,617 INFO L274 PluginConnector]: CDTParser initialized [2024-08-22 20:54:08,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-08-22 20:54:09,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-22 20:54:09,999 INFO L384 CDTParser]: Found 1 translation units. [2024-08-22 20:54:10,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-08-22 20:54:10,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/39c334e5d/d350892d1910415cb6a185412b2a1a8f/FLAG5e6e34ab6 [2024-08-22 20:54:10,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/39c334e5d/d350892d1910415cb6a185412b2a1a8f [2024-08-22 20:54:10,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-22 20:54:10,027 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-22 20:54:10,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-22 20:54:10,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-22 20:54:10,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-22 20:54:10,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.08 08:54:08" (1/2) ... [2024-08-22 20:54:10,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8eab33 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.08 08:54:10, skipping insertion in model container [2024-08-22 20:54:10,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.08 08:54:08" (1/2) ... [2024-08-22 20:54:10,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2eaea8ad and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.08 08:54:10, skipping insertion in model container [2024-08-22 20:54:10,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 08:54:10" (2/2) ... [2024-08-22 20:54:10,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8eab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10, skipping insertion in model container [2024-08-22 20:54:10,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 08:54:10" (2/2) ... [2024-08-22 20:54:10,039 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-22 20:54:10,105 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-22 20:54:10,106 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$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_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$w_buff1_used) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 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 )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$w_buff1_used >= 0LL) && (long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-08-22 20:54:10,106 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$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_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$w_buff1_used) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 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 )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$w_buff1_used >= 0LL) && (long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-08-22 20:54:10,106 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-08-22 20:54:10,106 INFO L106 edCorrectnessWitness]: ghost_update [L827-L827] multithreaded = 1; [2024-08-22 20:54:10,145 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-22 20:54:10,275 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/mix000.opt.i[987,1000] [2024-08-22 20:54:10,443 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-22 20:54:10,451 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-22 20:54:10,478 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/mix000.opt.i[987,1000] Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-22 20:54:10,594 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-22 20:54:10,623 INFO L206 MainTranslator]: Completed translation [2024-08-22 20:54:10,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10 WrapperNode [2024-08-22 20:54:10,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-22 20:54:10,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-22 20:54:10,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-22 20:54:10,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-22 20:54:10,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,693 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-08-22 20:54:10,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-22 20:54:10,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-22 20:54:10,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-22 20:54:10,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-22 20:54:10,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-22 20:54:10,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-22 20:54:10,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-22 20:54:10,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-22 20:54:10,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (1/1) ... [2024-08-22 20:54:10,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-22 20:54:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:54:10,772 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-22 20:54:10,776 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-22 20:54:10,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-22 20:54:10,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-22 20:54:10,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-08-22 20:54:10,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-08-22 20:54:10,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-08-22 20:54:10,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-08-22 20:54:10,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-22 20:54:10,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-22 20:54:10,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-22 20:54:10,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-22 20:54:10,805 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-22 20:54:10,928 INFO L243 CfgBuilder]: Building ICFG [2024-08-22 20:54:10,930 INFO L269 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-22 20:54:11,342 INFO L288 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-22 20:54:11,342 INFO L292 CfgBuilder]: Performing block encoding [2024-08-22 20:54:11,524 INFO L314 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-22 20:54:11,524 INFO L319 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-22 20:54:11,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 08:54:11 BoogieIcfgContainer [2024-08-22 20:54:11,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-22 20:54:11,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-22 20:54:11,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-22 20:54:11,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-22 20:54:11,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.08 08:54:08" (1/4) ... [2024-08-22 20:54:11,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420f56ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 22.08 08:54:11, skipping insertion in model container [2024-08-22 20:54:11,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 08:54:10" (2/4) ... [2024-08-22 20:54:11,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420f56ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 08:54:11, skipping insertion in model container [2024-08-22 20:54:11,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:54:10" (3/4) ... [2024-08-22 20:54:11,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420f56ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 08:54:11, skipping insertion in model container [2024-08-22 20:54:11,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 08:54:11" (4/4) ... [2024-08-22 20:54:11,536 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2024-08-22 20:54:11,549 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-22 20:54:11,549 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-08-22 20:54:11,549 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-22 20:54:11,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-22 20:54:11,619 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-22 20:54:11,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-22 20:54:11,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:54:11,621 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-22 20:54:11,626 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-22 20:54:11,650 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-22 20:54:11,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-08-22 20:54:11,668 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;@34ce7760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-22 20:54:11,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-22 20:54:11,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-22 20:54:11,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2032576853, now seen corresponding path program 1 times [2024-08-22 20:54:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:11,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401797069] [2024-08-22 20:54:11,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:54:12,244 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-22 20:54:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:54:12,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401797069] [2024-08-22 20:54:12,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401797069] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:54:12,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:54:12,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-22 20:54:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156133645] [2024-08-22 20:54:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:54:12,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-22 20:54:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:54:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-22 20:54:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-22 20:54:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:12,271 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:54:12,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-22 20:54:12,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:13,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-22 20:54:13,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-22 20:54:13,087 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-22 20:54:13,089 INFO L308 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2024-08-22 20:54:13,095 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-22 20:54:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-22 20:54:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:54:13,114 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-22 20:54:13,116 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-22 20:54:13,119 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-22 20:54:13,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-22 20:54:13,121 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;@34ce7760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-22 20:54:13,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-08-22 20:54:13,199 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-22 20:54:13,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 345507155, now seen corresponding path program 1 times [2024-08-22 20:54:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574316900] [2024-08-22 20:54:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:54:14,297 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-22 20:54:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:54:14,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574316900] [2024-08-22 20:54:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574316900] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:54:14,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:54:14,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-22 20:54:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548965362] [2024-08-22 20:54:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:54:14,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-22 20:54:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:54:14,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-22 20:54:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-22 20:54:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:14,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:54:14,302 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-22 20:54:14,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:14,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-22 20:54:14,538 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-22 20:54:14,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1456840237, now seen corresponding path program 1 times [2024-08-22 20:54:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980315045] [2024-08-22 20:54:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:14,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:54:19,297 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-22 20:54:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:54:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980315045] [2024-08-22 20:54:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980315045] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:54:19,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:54:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-22 20:54:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244986804] [2024-08-22 20:54:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:54:19,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-22 20:54:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:54:19,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-22 20:54:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-08-22 20:54:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:19,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:54:19,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-22 20:54:19,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:19,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:19,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-22 20:54:19,562 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-22 20:54:19,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1615717707, now seen corresponding path program 1 times [2024-08-22 20:54:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416552137] [2024-08-22 20:54:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:54:19,700 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-22 20:54:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:54:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416552137] [2024-08-22 20:54:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416552137] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:54:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:54:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-22 20:54:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070619221] [2024-08-22 20:54:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:54:19,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-22 20:54:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:54:19,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-22 20:54:19,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-22 20:54:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:19,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:54:19,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-22 20:54:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-22 20:54:19,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-22 20:54:19,844 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-22 20:54:19,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 657447336, now seen corresponding path program 1 times [2024-08-22 20:54:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:19,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645921265] [2024-08-22 20:54:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:54:20,586 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-22 20:54:20,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:54:20,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645921265] [2024-08-22 20:54:20,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645921265] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:54:20,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:54:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-22 20:54:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100706608] [2024-08-22 20:54:20,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:54:20,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-22 20:54:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:54:20,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-22 20:54:20,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-08-22 20:54:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:20,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:54:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-22 20:54:20,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:20,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:20,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-22 20:54:20,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-22 20:54:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-22 20:54:20,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-22 20:54:20,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:54:20,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2013793044, now seen corresponding path program 2 times [2024-08-22 20:54:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582897898] [2024-08-22 20:54:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:54:21,714 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-22 20:54:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:54:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582897898] [2024-08-22 20:54:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582897898] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:54:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:54:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-22 20:54:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351703367] [2024-08-22 20:54:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:54:21,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-22 20:54:21,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:54:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-22 20:54:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-08-22 20:54:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:21,716 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:54:21,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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-22 20:54:21,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:21,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:21,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-22 20:54:21,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-22 20:54:21,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-22 20:54:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-22 20:54:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-22 20:54:22,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-22 20:54:22,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:54:22,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 945272914, now seen corresponding path program 1 times [2024-08-22 20:54:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547765286] [2024-08-22 20:54:22,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:54:24,496 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-22 20:54:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:54:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547765286] [2024-08-22 20:54:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547765286] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:54:24,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:54:24,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-22 20:54:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918410431] [2024-08-22 20:54:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:54:24,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-22 20:54:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:54:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-22 20:54:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-22 20:54:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:24,499 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:54:24,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-22 20:54:24,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:24,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:24,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-22 20:54:24,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-22 20:54:24,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-22 20:54:24,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:54:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-22 20:54:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-22 20:54:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-22 20:54:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-22 20:54:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-22 20:54:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-22 20:54:24,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-22 20:54:24,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:54:24,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:54:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1253258040, now seen corresponding path program 3 times [2024-08-22 20:54:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:54:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468655752] [2024-08-22 20:54:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:54:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:54:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-22 20:54:24,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-22 20:54:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-22 20:54:24,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-22 20:54:24,818 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-22 20:54:24,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-08-22 20:54:24,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-08-22 20:54:24,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-08-22 20:54:24,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-08-22 20:54:24,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-08-22 20:54:24,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-22 20:54:24,820 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-08-22 20:54:24,821 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-08-22 20:54:24,823 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-22 20:54:24,823 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-22 20:54:24,873 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-08-22 20:54:24,873 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-08-22 20:54:24,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 08:54:24 BasicIcfg [2024-08-22 20:54:24,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-22 20:54:24,874 INFO L158 Benchmark]: Toolchain (without parser) took 14847.21ms. Allocated memory was 201.3MB in the beginning and 752.9MB in the end (delta: 551.6MB). Free memory was 169.7MB in the beginning and 335.6MB in the end (delta: -166.0MB). Peak memory consumption was 386.6MB. Max. memory is 16.1GB. [2024-08-22 20:54:24,874 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-22 20:54:24,874 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 134.2MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-22 20:54:24,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.95ms. Allocated memory is still 201.3MB. Free memory was 169.7MB in the beginning and 129.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-08-22 20:54:24,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.62ms. Allocated memory is still 201.3MB. Free memory was 129.8MB in the beginning and 123.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-08-22 20:54:24,874 INFO L158 Benchmark]: Boogie Preprocessor took 46.48ms. Allocated memory is still 201.3MB. Free memory was 123.5MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-22 20:54:24,874 INFO L158 Benchmark]: RCFGBuilder took 784.61ms. Allocated memory is still 201.3MB. Free memory was 121.5MB in the beginning and 142.3MB in the end (delta: -20.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-08-22 20:54:24,875 INFO L158 Benchmark]: TraceAbstraction took 13345.16ms. Allocated memory was 201.3MB in the beginning and 752.9MB in the end (delta: 551.6MB). Free memory was 141.3MB in the beginning and 335.6MB in the end (delta: -194.4MB). Peak memory consumption was 359.3MB. Max. memory is 16.1GB. [2024-08-22 20:54:24,875 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 134.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.68ms. Allocated memory is still 134.2MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.95ms. Allocated memory is still 201.3MB. Free memory was 169.7MB in the beginning and 129.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.62ms. Allocated memory is still 201.3MB. Free memory was 129.8MB in the beginning and 123.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.48ms. Allocated memory is still 201.3MB. Free memory was 123.5MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 784.61ms. Allocated memory is still 201.3MB. Free memory was 121.5MB in the beginning and 142.3MB in the end (delta: -20.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13345.16ms. Allocated memory was 201.3MB in the beginning and 752.9MB in the end (delta: 551.6MB). Free memory was 141.3MB in the beginning and 335.6MB in the end (delta: -194.4MB). Peak memory consumption was 359.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 907, independent: 803, independent conditional: 411, independent unconditional: 392, dependent: 104, dependent conditional: 69, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 890, independent: 803, independent conditional: 411, independent unconditional: 392, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 890, independent: 803, independent conditional: 411, independent unconditional: 392, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 981, independent: 803, independent conditional: 39, independent unconditional: 764, dependent: 178, dependent conditional: 52, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 981, independent: 803, independent conditional: 39, independent unconditional: 764, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 981, independent: 803, independent conditional: 39, independent unconditional: 764, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 447, independent: 396, independent conditional: 3, independent unconditional: 393, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 447, independent: 381, independent conditional: 0, independent unconditional: 381, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 808, independent: 218, independent conditional: 30, independent unconditional: 189, dependent: 590, dependent conditional: 182, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 981, independent: 407, independent conditional: 36, independent unconditional: 371, dependent: 127, dependent conditional: 36, dependent unconditional: 91, unknown: 447, unknown conditional: 16, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 396, Positive conditional cache size: 3, Positive unconditional cache size: 393, Negative cache size: 51, Negative conditional cache size: 13, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.6s, Number of persistent set computation: 95, Number of trivial persistent sets: 65, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 427, independent: 392, independent conditional: 0, independent unconditional: 392, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 907, independent: 803, independent conditional: 411, independent unconditional: 392, dependent: 104, dependent conditional: 69, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 890, independent: 803, independent conditional: 411, independent unconditional: 392, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 890, independent: 803, independent conditional: 411, independent unconditional: 392, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 981, independent: 803, independent conditional: 39, independent unconditional: 764, dependent: 178, dependent conditional: 52, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 981, independent: 803, independent conditional: 39, independent unconditional: 764, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 981, independent: 803, independent conditional: 39, independent unconditional: 764, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 447, independent: 396, independent conditional: 3, independent unconditional: 393, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 447, independent: 381, independent conditional: 0, independent unconditional: 381, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 808, independent: 218, independent conditional: 30, independent unconditional: 189, dependent: 590, dependent conditional: 182, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 981, independent: 407, independent conditional: 36, independent unconditional: 371, dependent: 127, dependent conditional: 36, dependent unconditional: 91, unknown: 447, unknown conditional: 16, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 396, Positive conditional cache size: 3, Positive unconditional cache size: 393, Negative cache size: 51, Negative conditional cache size: 13, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1030, independent: 922, independent conditional: 617, independent unconditional: 305, dependent: 108, dependent conditional: 76, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 987, independent: 922, independent conditional: 617, independent unconditional: 305, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 987, independent: 922, independent conditional: 617, independent unconditional: 305, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1125, independent: 922, independent conditional: 20, independent unconditional: 902, dependent: 203, dependent conditional: 118, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1125, independent: 922, independent conditional: 20, independent unconditional: 902, dependent: 203, dependent conditional: 87, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1125, independent: 922, independent conditional: 20, independent unconditional: 902, dependent: 203, dependent conditional: 87, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 368, independent: 315, independent conditional: 8, independent unconditional: 307, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 368, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 795, independent: 215, independent conditional: 57, independent unconditional: 159, dependent: 580, dependent conditional: 259, dependent unconditional: 321, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1125, independent: 607, independent conditional: 12, independent unconditional: 595, dependent: 150, dependent conditional: 66, dependent unconditional: 84, unknown: 368, unknown conditional: 29, unknown unconditional: 339] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 315, Positive conditional cache size: 8, Positive unconditional cache size: 307, Negative cache size: 53, Negative conditional cache size: 21, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 4, Independence queries for same thread: 43 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 92, Number of trivial persistent sets: 56, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1030, independent: 922, independent conditional: 617, independent unconditional: 305, dependent: 108, dependent conditional: 76, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 987, independent: 922, independent conditional: 617, independent unconditional: 305, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 987, independent: 922, independent conditional: 617, independent unconditional: 305, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1125, independent: 922, independent conditional: 20, independent unconditional: 902, dependent: 203, dependent conditional: 118, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1125, independent: 922, independent conditional: 20, independent unconditional: 902, dependent: 203, dependent conditional: 87, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1125, independent: 922, independent conditional: 20, independent unconditional: 902, dependent: 203, dependent conditional: 87, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 368, independent: 315, independent conditional: 8, independent unconditional: 307, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 368, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 795, independent: 215, independent conditional: 57, independent unconditional: 159, dependent: 580, dependent conditional: 259, dependent unconditional: 321, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1125, independent: 607, independent conditional: 12, independent unconditional: 595, dependent: 150, dependent conditional: 66, dependent unconditional: 84, unknown: 368, unknown conditional: 29, unknown unconditional: 339] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 315, Positive conditional cache size: 8, Positive unconditional cache size: 307, Negative cache size: 53, Negative conditional cache size: 21, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 4, Independence queries for same thread: 43 - 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] 0 //@ assert ((((((((((((((((((!multithreaded || (x$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) x) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$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_p0_EBX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) y) >= 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) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EBX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && ((y == 0) || (y == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L830] 0 //@ assert ((((((((((((((((((!multithreaded || (x$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) x) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$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_p0_EBX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) y) >= 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) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EBX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && ((y == 0) || (y == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L844] 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=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 829]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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, 56 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.0s, 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.2s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 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, 56 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.0s, 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: 48, 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.2s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 2983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-22 20:54:24,901 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-22 20:54:25,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-08-22 20:54:25,306 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