./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/mix022_tso.yml/witness.yml --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version e94c40da
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/mix022_tso.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/mix022_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-e94c40d-m
[2024-09-22 21:05:19,377 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-09-22 21:05:19,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-09-22 21:05:19,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-09-22 21:05:19,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-09-22 21:05:19,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-09-22 21:05:19,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-09-22 21:05:19,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-09-22 21:05:19,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-09-22 21:05:19,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-09-22 21:05:19,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-09-22 21:05:19,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-09-22 21:05:19,496 INFO L153 SettingsManager]: * Use SBE=true
[2024-09-22 21:05:19,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-09-22 21:05:19,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-09-22 21:05:19,500 INFO L153 SettingsManager]: * sizeof long=4
[2024-09-22 21:05:19,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-09-22 21:05:19,500 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-09-22 21:05:19,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-09-22 21:05:19,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-09-22 21:05:19,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-09-22 21:05:19,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-09-22 21:05:19,505 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-09-22 21:05:19,506 INFO L153 SettingsManager]: * sizeof long double=12
[2024-09-22 21:05:19,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-09-22 21:05:19,506 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-09-22 21:05:19,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-09-22 21:05:19,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-09-22 21:05:19,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-09-22 21:05:19,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-09-22 21:05:19,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-09-22 21:05:19,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-09-22 21:05:19,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-09-22 21:05:19,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-09-22 21:05:19,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-09-22 21:05:19,508 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-09-22 21:05:19,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-09-22 21:05:19,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-09-22 21:05:19,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-09-22 21:05:19,510 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-09-22 21:05:19,510 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-09-22 21:05:19,511 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: Positions where we compute the Hoare Annotation -> None
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
[2024-09-22 21:05:19,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-09-22 21:05:19,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-09-22 21:05:19,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-09-22 21:05:19,792 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-09-22 21:05:19,793 INFO L274 PluginConnector]: Witness Parser initialized
[2024-09-22 21:05:19,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/mix022_tso.yml/witness.yml
[2024-09-22 21:05:19,948 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-09-22 21:05:19,948 INFO L274 PluginConnector]: CDTParser initialized
[2024-09-22 21:05:19,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i
[2024-09-22 21:05:21,374 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-09-22 21:05:21,613 INFO L384 CDTParser]: Found 1 translation units.
[2024-09-22 21:05:21,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i
[2024-09-22 21:05:21,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/365ef999e/5d7041f0600e4220947ba72c4fb6636e/FLAGb0d844fa6
[2024-09-22 21:05:21,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/365ef999e/5d7041f0600e4220947ba72c4fb6636e
[2024-09-22 21:05:21,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-09-22 21:05:21,942 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-09-22 21:05:21,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-09-22 21:05:21,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-09-22 21:05:21,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-09-22 21:05:21,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.09 09:05:19" (1/2) ...
[2024-09-22 21:05:21,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e1aac4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.09 09:05:21, skipping insertion in model container
[2024-09-22 21:05:21,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.09 09:05:19" (1/2) ...
[2024-09-22 21:05:21,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b14ccbd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.09 09:05:21, skipping insertion in model container
[2024-09-22 21:05:21,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 09:05:21" (2/2) ...
[2024-09-22 21:05:21,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e1aac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:21, skipping insertion in model container
[2024-09-22 21:05:21,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 09:05:21" (2/2) ...
[2024-09-22 21:05:22,013 INFO L93 nessWitnessExtractor]: Found the following entries in the witness:
[2024-09-22 21:05:22,014 INFO L1541 ArrayList]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || ((x == 0 || x == 1) || x == 2)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 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 )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (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_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) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (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$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$w_buff0 == 0 || x$w_buff0 == 2))) && (! 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)
[2024-09-22 21:05:22,015 INFO L1541 ArrayList]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || ((x == 0 || x == 1) || x == 2)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 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 )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (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_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) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (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$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$w_buff0 == 0 || x$w_buff0 == 2))) && (! 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)
[2024-09-22 21:05:22,015 INFO L1541 ArrayList]: ghost_variable multithreaded = 0
[2024-09-22 21:05:22,015 INFO L1541 ArrayList]: ghost_update [L811-L811] multithreaded = 1;
[2024-09-22 21:05:22,062 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-09-22 21:05:22,228 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i[944,957]
[2024-09-22 21:05:22,439 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-09-22 21:05:22,455 INFO L200 MainTranslator]: Completed pre-run
Start Parsing Local
[2024-09-22 21:05:22,492 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i[944,957]
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-09-22 21:05:22,649 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-09-22 21:05:22,698 INFO L204 MainTranslator]: Completed translation
[2024-09-22 21:05:22,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22 WrapperNode
[2024-09-22 21:05:22,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-09-22 21:05:22,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-09-22 21:05:22,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-09-22 21:05:22,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-09-22 21:05:22,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,773 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152
[2024-09-22 21:05:22,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-09-22 21:05:22,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-09-22 21:05:22,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-09-22 21:05:22,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-09-22 21:05:22,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-09-22 21:05:22,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-09-22 21:05:22,817 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-09-22 21:05:22,817 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-09-22 21:05:22,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (1/1) ...
[2024-09-22 21:05:22,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-09-22 21:05:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-09-22 21:05:22,870 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-09-22 21:05:22,872 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-09-22 21:05:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-09-22 21:05:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-09-22 21:05:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-09-22 21:05:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-09-22 21:05:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-09-22 21:05:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-09-22 21:05:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-09-22 21:05:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-09-22 21:05:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-09-22 21:05:22,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-09-22 21:05:22,915 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-09-22 21:05:23,049 INFO L242 CfgBuilder]: Building ICFG
[2024-09-22 21:05:23,051 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-09-22 21:05:23,537 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-09-22 21:05:23,537 INFO L291 CfgBuilder]: Performing block encoding
[2024-09-22 21:05:23,751 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-09-22 21:05:23,751 INFO L318 CfgBuilder]: Removed 0 assume(true) statements.
[2024-09-22 21:05:23,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 09:05:23 BoogieIcfgContainer
[2024-09-22 21:05:23,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-09-22 21:05:23,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-09-22 21:05:23,754 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-09-22 21:05:23,759 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-09-22 21:05:23,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.09 09:05:19" (1/4) ...
[2024-09-22 21:05:23,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ff2e59 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 22.09 09:05:23, skipping insertion in model container
[2024-09-22 21:05:23,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 09:05:21" (2/4) ...
[2024-09-22 21:05:23,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ff2e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 09:05:23, skipping insertion in model container
[2024-09-22 21:05:23,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 09:05:22" (3/4) ...
[2024-09-22 21:05:23,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ff2e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 09:05:23, skipping insertion in model container
[2024-09-22 21:05:23,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 09:05:23" (4/4) ...
[2024-09-22 21:05:23,763 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i
[2024-09-22 21:05:23,780 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-09-22 21:05:23,780 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-09-22 21:05:23,780 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-09-22 21:05:23,833 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-09-22 21:05:23,877 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-22 21:05:23,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-09-22 21:05:23,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-09-22 21:05:23,880 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-09-22 21:05:23,882 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-09-22 21:05:23,914 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-09-22 21:05:23,927 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ========
[2024-09-22 21:05:23,935 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@35c23d55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-22 21:05:23,936 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-09-22 21:05:24,243 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-09-22 21:05:24,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash -641519630, now seen corresponding path program 1 times
[2024-09-22 21:05:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204459307]
[2024-09-22 21:05:24,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-22 21:05:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-22 21:05:24,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-22 21:05:24,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204459307]
[2024-09-22 21:05:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204459307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-22 21:05:24,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-22 21:05:24,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-09-22 21:05:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086795446]
[2024-09-22 21:05:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-22 21:05:24,968 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-09-22 21:05:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-22 21:05:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-09-22 21:05:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-09-22 21:05:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:24,992 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-22 21:05:24,993 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-09-22 21:05:24,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-09-22 21:05:26,374 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-09-22 21:05:26,375 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-09-22 21:05:26,382 INFO L408 BasicCegarLoop]: Path program histogram: [1]
[2024-09-22 21:05:26,384 INFO L312 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2)
[2024-09-22 21:05:26,388 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-22 21:05:26,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-09-22 21:05:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-09-22 21:05:26,408 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-09-22 21:05:26,425 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-09-22 21:05:26,429 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-09-22 21:05:26,430 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-09-22 21:05:26,430 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@35c23d55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-22 21:05:26,431 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-09-22 21:05:26,514 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-22 21:05:26,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 352634366, now seen corresponding path program 1 times
[2024-09-22 21:05:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436414069]
[2024-09-22 21:05:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-22 21:05:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-22 21:05:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-22 21:05:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436414069]
[2024-09-22 21:05:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436414069] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-22 21:05:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-22 21:05:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-09-22 21:05:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742282927]
[2024-09-22 21:05:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-22 21:05:27,666 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-09-22 21:05:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-22 21:05:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-09-22 21:05:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-09-22 21:05:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:27,667 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-22 21:05:27,667 INFO L475 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-09-22 21:05:27,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:27,929 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-09-22 21:05:27,930 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-22 21:05:27,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash 457266279, now seen corresponding path program 1 times
[2024-09-22 21:05:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080403192]
[2024-09-22 21:05:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-22 21:05:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-22 21:05:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-22 21:05:35,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080403192]
[2024-09-22 21:05:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080403192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-22 21:05:35,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-22 21:05:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-09-22 21:05:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795222520]
[2024-09-22 21:05:35,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-22 21:05:35,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-09-22 21:05:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-22 21:05:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-09-22 21:05:35,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-09-22 21:05:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:35,978 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-22 21:05:35,979 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-09-22 21:05:35,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:35,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:36,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:36,339 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-09-22 21:05:36,339 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-22 21:05:36,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1735338154, now seen corresponding path program 1 times
[2024-09-22 21:05:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:36,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223746405]
[2024-09-22 21:05:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:36,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-22 21:05:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-22 21:05:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-22 21:05:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223746405]
[2024-09-22 21:05:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223746405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-22 21:05:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-22 21:05:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-09-22 21:05:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88729460]
[2024-09-22 21:05:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-22 21:05:36,646 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-09-22 21:05:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-22 21:05:36,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-09-22 21:05:36,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-09-22 21:05:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:36,647 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-22 21:05:36,647 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-09-22 21:05:36,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:36,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:36,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-09-22 21:05:36,863 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-09-22 21:05:36,863 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-22 21:05:36,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash -52750834, now seen corresponding path program 1 times
[2024-09-22 21:05:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:36,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228251405]
[2024-09-22 21:05:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-22 21:05:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-22 21:05:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-22 21:05:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228251405]
[2024-09-22 21:05:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228251405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-22 21:05:38,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-22 21:05:38,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2024-09-22 21:05:38,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396442990]
[2024-09-22 21:05:38,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-22 21:05:38,939 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-09-22 21:05:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-22 21:05:38,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-09-22 21:05:38,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2024-09-22 21:05:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:38,940 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-22 21:05:38,940 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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-09-22 21:05:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-09-22 21:05:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-09-22 21:05:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-09-22 21:05:40,103 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-09-22 21:05:40,103 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-22 21:05:40,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1315040054, now seen corresponding path program 2 times
[2024-09-22 21:05:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966889360]
[2024-09-22 21:05:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-22 21:05:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-22 21:05:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-22 21:05:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966889360]
[2024-09-22 21:05:41,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966889360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-22 21:05:41,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-22 21:05:41,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-09-22 21:05:41,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124621312]
[2024-09-22 21:05:41,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-22 21:05:41,226 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-09-22 21:05:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-22 21:05:41,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-09-22 21:05:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-09-22 21:05:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:41,227 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-22 21:05:41,227 INFO L475 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-09-22 21:05:41,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:41,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:41,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-09-22 21:05:41,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2024-09-22 21:05:41,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-09-22 21:05:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-09-22 21:05:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-09-22 21:05:42,032 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-09-22 21:05:42,032 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-22 21:05:42,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash -459743187, now seen corresponding path program 1 times
[2024-09-22 21:05:42,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804155667]
[2024-09-22 21:05:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-22 21:05:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-22 21:05:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-22 21:05:44,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804155667]
[2024-09-22 21:05:44,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804155667] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-22 21:05:44,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-22 21:05:44,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-09-22 21:05:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66985126]
[2024-09-22 21:05:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-22 21:05:44,724 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-09-22 21:05:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-22 21:05:44,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-09-22 21:05:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-09-22 21:05:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:44,725 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-22 21:05:44,726 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-09-22 21:05:44,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:44,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:44,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-09-22 21:05:44,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2024-09-22 21:05:44,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2024-09-22 21:05:44,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-09-22 21:05:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-09-22 21:05:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-09-22 21:05:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-09-22 21:05:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-09-22 21:05:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-09-22 21:05:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-09-22 21:05:45,171 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-09-22 21:05:45,171 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-22 21:05:45,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-09-22 21:05:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1082813020, now seen corresponding path program 3 times
[2024-09-22 21:05:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-22 21:05:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56875974]
[2024-09-22 21:05:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-22 21:05:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-22 21:05:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-09-22 21:05:45,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-09-22 21:05:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-09-22 21:05:45,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-09-22 21:05:45,344 INFO L326 BasicCegarLoop]: Counterexample is feasible
[2024-09-22 21:05:45,344 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-09-22 21:05:45,344 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining)
[2024-09-22 21:05:45,345 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining)
[2024-09-22 21:05:45,345 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-09-22 21:05:45,345 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining)
[2024-09-22 21:05:45,345 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-09-22 21:05:45,346 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2024-09-22 21:05:45,346 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2)
[2024-09-22 21:05:45,426 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-09-22 21:05:45,426 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-09-22 21:05:45,428 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants
[2024-09-22 21:05:45,428 INFO L470 ceAbstractionStarter]: WitnessConsidered=2
[2024-09-22 21:05:45,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 09:05:45 BasicIcfg
[2024-09-22 21:05:45,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-09-22 21:05:45,430 INFO L158 Benchmark]: Toolchain (without parser) took 23488.17ms. Allocated memory was 167.8MB in the beginning and 992.0MB in the end (delta: 824.2MB). Free memory was 131.1MB in the beginning and 530.6MB in the end (delta: -399.5MB). Peak memory consumption was 424.1MB. Max. memory is 16.1GB.
[2024-09-22 21:05:45,430 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 121.6MB. Free memory was 85.0MB in the beginning and 84.8MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-09-22 21:05:45,430 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-09-22 21:05:45,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.57ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 94.1MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB.
[2024-09-22 21:05:45,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.93ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 87.9MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-09-22 21:05:45,431 INFO L158 Benchmark]: Boogie Preprocessor took 41.68ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 85.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-09-22 21:05:45,431 INFO L158 Benchmark]: RCFGBuilder took 934.82ms. Allocated memory is still 167.8MB. Free memory was 84.5MB in the beginning and 118.4MB in the end (delta: -33.9MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB.
[2024-09-22 21:05:45,431 INFO L158 Benchmark]: TraceAbstraction took 21675.55ms. Allocated memory was 167.8MB in the beginning and 992.0MB in the end (delta: 824.2MB). Free memory was 117.4MB in the beginning and 530.6MB in the end (delta: -413.2MB). Peak memory consumption was 410.0MB. Max. memory is 16.1GB.
[2024-09-22 21:05:45,433 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.18ms. Allocated memory is still 121.6MB. Free memory was 85.0MB in the beginning and 84.8MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB.
* CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 756.57ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 94.1MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 73.93ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 87.9MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 41.68ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 85.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 934.82ms. Allocated memory is still 167.8MB. Free memory was 84.5MB in the beginning and 118.4MB in the end (delta: -33.9MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 21675.55ms. Allocated memory was 167.8MB in the beginning and 992.0MB in the end (delta: 824.2MB). Free memory was 117.4MB in the beginning and 530.6MB in the end (delta: -413.2MB). Peak memory consumption was 410.0MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Partial order reduction statistics
Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 850, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 103, dependent conditional: 64, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 837, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 90, dependent conditional: 51, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 837, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 90, dependent conditional: 51, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 932, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 185, dependent conditional: 146, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 932, independent: 747, independent conditional: 44, independent unconditional: 703, dependent: 185, dependent conditional: 50, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 932, independent: 747, independent conditional: 44, independent unconditional: 703, dependent: 185, dependent conditional: 50, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 370, independent conditional: 7, independent unconditional: 363, dependent: 56, dependent conditional: 13, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 351, independent conditional: 0, independent unconditional: 351, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 56, dependent conditional: 13, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 56, dependent conditional: 13, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1458, independent: 432, independent conditional: 164, independent unconditional: 268, dependent: 1026, dependent conditional: 239, dependent unconditional: 786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 932, independent: 377, independent conditional: 37, independent unconditional: 340, dependent: 129, dependent conditional: 37, dependent unconditional: 92, unknown: 426, unknown conditional: 20, unknown unconditional: 406] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 370, Positive conditional cache size: 7, Positive unconditional cache size: 363, Negative cache size: 56, Negative conditional cache size: 13, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 437, Maximal queried relation: 1, Independence queries for same thread: 13, Persistent sets #1 benchmarks: Persistent set computation time: 1.0s, Number of persistent set computation: 95, Number of trivial persistent sets: 62, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 401, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 850, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 103, dependent conditional: 64, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 837, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 90, dependent conditional: 51, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 837, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 90, dependent conditional: 51, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 932, independent: 747, independent conditional: 385, independent unconditional: 362, dependent: 185, dependent conditional: 146, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 932, independent: 747, independent conditional: 44, independent unconditional: 703, dependent: 185, dependent conditional: 50, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 932, independent: 747, independent conditional: 44, independent unconditional: 703, dependent: 185, dependent conditional: 50, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 370, independent conditional: 7, independent unconditional: 363, dependent: 56, dependent conditional: 13, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 351, independent conditional: 0, independent unconditional: 351, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 56, dependent conditional: 13, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 56, dependent conditional: 13, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1458, independent: 432, independent conditional: 164, independent unconditional: 268, dependent: 1026, dependent conditional: 239, dependent unconditional: 786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 932, independent: 377, independent conditional: 37, independent unconditional: 340, dependent: 129, dependent conditional: 37, dependent unconditional: 92, unknown: 426, unknown conditional: 20, unknown unconditional: 406] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 370, Positive conditional cache size: 7, Positive unconditional cache size: 363, Negative cache size: 56, Negative conditional cache size: 13, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 437, Maximal queried relation: 1, Independence queries for same thread: 13
- StatisticsResult: Partial order reduction statistics
Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1057, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 117, dependent conditional: 83, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1014, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 74, dependent conditional: 40, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1014, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 74, dependent conditional: 40, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1195, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 255, dependent conditional: 221, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1195, independent: 940, independent conditional: 22, independent unconditional: 918, dependent: 255, dependent conditional: 103, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1195, independent: 940, independent conditional: 22, independent unconditional: 918, dependent: 255, dependent conditional: 103, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 361, independent: 303, independent conditional: 8, independent unconditional: 295, dependent: 58, dependent conditional: 24, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 361, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 58, dependent conditional: 24, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 58, dependent conditional: 24, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1145, independent: 274, independent conditional: 67, independent unconditional: 207, dependent: 871, dependent conditional: 365, dependent unconditional: 507, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1195, independent: 637, independent conditional: 14, independent unconditional: 623, dependent: 197, dependent conditional: 79, dependent unconditional: 118, unknown: 361, unknown conditional: 32, unknown unconditional: 329] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 303, Positive conditional cache size: 8, Positive unconditional cache size: 295, Negative cache size: 58, Negative conditional cache size: 24, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 743, Maximal queried relation: 4, Independence queries for same thread: 43, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 86, Number of trivial persistent sets: 49, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 327, independent: 293, independent conditional: 0, independent unconditional: 293, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1057, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 117, dependent conditional: 83, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1014, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 74, dependent conditional: 40, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1014, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 74, dependent conditional: 40, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1195, independent: 940, independent conditional: 647, independent unconditional: 293, dependent: 255, dependent conditional: 221, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1195, independent: 940, independent conditional: 22, independent unconditional: 918, dependent: 255, dependent conditional: 103, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1195, independent: 940, independent conditional: 22, independent unconditional: 918, dependent: 255, dependent conditional: 103, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 361, independent: 303, independent conditional: 8, independent unconditional: 295, dependent: 58, dependent conditional: 24, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 361, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 58, dependent conditional: 24, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 21, independent conditional: 8, independent unconditional: 13, dependent: 58, dependent conditional: 24, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1145, independent: 274, independent conditional: 67, independent unconditional: 207, dependent: 871, dependent conditional: 365, dependent unconditional: 507, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1195, independent: 637, independent conditional: 14, independent unconditional: 623, dependent: 197, dependent conditional: 79, dependent unconditional: 118, unknown: 361, unknown conditional: 32, unknown unconditional: 329] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 303, Positive conditional cache size: 8, Positive unconditional cache size: 295, Negative cache size: 58, Negative conditional cache size: 24, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 743, Maximal queried relation: 4, Independence queries for same thread: 43
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p1_EAX = 0;
[L712] 0 int __unbuffered_p1_EBX = 0;
[L713] 0 _Bool main$tmp_guard0;
[L714] 0 _Bool main$tmp_guard1;
[L716] 0 int x = 0;
[L717] 0 _Bool x$flush_delayed;
[L718] 0 int x$mem_tmp;
[L719] 0 _Bool x$r_buff0_thd0;
[L720] 0 _Bool x$r_buff0_thd1;
[L721] 0 _Bool x$r_buff0_thd2;
[L722] 0 _Bool x$r_buff1_thd0;
[L723] 0 _Bool x$r_buff1_thd1;
[L724] 0 _Bool x$r_buff1_thd2;
[L725] 0 _Bool x$read_delayed;
[L726] 0 int *x$read_delayed_var;
[L727] 0 int x$w_buff0;
[L728] 0 _Bool x$w_buff0_used;
[L729] 0 int x$w_buff1;
[L730] 0 _Bool x$w_buff1_used;
[L732] 0 int y = 0;
[L733] 0 _Bool weak$$choice0;
[L734] 0 _Bool weak$$choice2;
[L1] 0 //@ ghost int multithreaded = 0;
[L810] 0 pthread_t t597;
[L811] 0 //@ ghost multithreaded = 1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-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]
[L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-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]
[L812] 0 pthread_t t598;
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-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]
[L813] 0 //@ assert ((((((((((((((((!multithreaded || (((x == 0) || (x == 1)) || (x == 2))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2)))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 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) x) + (long long) x$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (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_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)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (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$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$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!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_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0)));
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-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]
[L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-2, t598=-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]
[L758] 2 x$w_buff1 = x$w_buff0
[L759] 2 x$w_buff0 = 2
[L760] 2 x$w_buff1_used = x$w_buff0_used
[L761] 2 x$w_buff0_used = (_Bool)1
[L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L766] 2 x$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L769] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L770] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L771] 2 x$flush_delayed = weak$$choice2
[L772] 2 x$mem_tmp = x
[L773] 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)
[L774] 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))
[L775] 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))
[L776] 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))
[L777] 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))
[L778] 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))
[L779] 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))
[L780] 2 __unbuffered_p1_EAX = x
[L781] 2 x = x$flush_delayed ? x$mem_tmp : x
[L782] 2 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L785] 2 __unbuffered_p1_EBX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L814] 0 //@ assert ((((((((((((((((!multithreaded || (((x == 0) || (x == 1)) || (x == 2))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2)))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 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) x) + (long long) x$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (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_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)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (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$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$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!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_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0)));
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-2, t598=-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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L738] 1 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L741] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L788] 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)
[L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L790] 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
[L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L792] 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_p1_EAX=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L797] 2 return 0;
[L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-2, t598=-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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L817] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L817] RET 0 assume_abort_if_not(main$tmp_guard0)
[L819] 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)
[L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L821] 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
[L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L823] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-2, t598=-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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L826] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L827] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L828] 0 x$flush_delayed = weak$$choice2
[L829] 0 x$mem_tmp = x
[L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
[L838] 0 x = x$flush_delayed ? x$mem_tmp : x
[L839] 0 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-2, t598=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L841] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
- UnprovableResult [Line: 813]: Unable to prove that invariant of correctness witness holds
Unable to prove that invariant of correctness witness holds
Reason: Not analyzed.
- UnprovableResult [Line: 814]: Unable to prove that invariant of correctness witness holds
Unable to prove that invariant of correctness witness holds
Reason: Not analyzed.
- UnprovableResult [Line: 811]: 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: 813]: 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, 55 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.7s, 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: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 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, 55 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 51, 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.5s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 3269 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-09-22 21:05:45,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0
[2024-09-22 21:05:45,669 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-09-22 21:05:45,871 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