./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 11:10:19,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 11:10:20,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 11:10:20,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 11:10:20,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 11:10:20,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 11:10:20,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 11:10:20,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 11:10:20,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 11:10:20,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 11:10:20,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 11:10:20,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 11:10:20,113 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 11:10:20,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 11:10:20,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 11:10:20,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 11:10:20,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 11:10:20,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 11:10:20,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 11:10:20,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 11:10:20,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 11:10:20,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 11:10:20,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 11:10:20,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 11:10:20,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 11:10:20,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 11:10:20,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 11:10:20,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 11:10:20,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 11:10:20,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 11:10:20,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 11:10:20,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 11:10:20,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 11:10:20,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 11:10:20,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 11:10:20,126 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 11:10:20,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 11:10:20,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 11:10:20,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 11:10:20,127 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 11:10:20,136 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 11:10:20,138 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-08 11:10:20,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 11:10:20,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 11:10:20,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 11:10:20,375 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 11:10:20,375 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 11:10:20,376 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-09-08 11:10:20,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 11:10:20,485 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 11:10:20,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-09-08 11:10:22,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 11:10:22,238 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 11:10:22,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-09-08 11:10:22,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/744014e59/5cc25c8993d940368be3ab67a0dc29f4/FLAG623144cb6 [2024-09-08 11:10:22,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/744014e59/5cc25c8993d940368be3ab67a0dc29f4 [2024-09-08 11:10:22,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 11:10:22,579 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 11:10:22,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 11:10:22,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 11:10:22,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 11:10:22,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 11:10:20" (1/2) ... [2024-09-08 11:10:22,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715d6d8a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 11:10:22, skipping insertion in model container [2024-09-08 11:10:22,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 11:10:20" (1/2) ... [2024-09-08 11:10:22,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@36190808 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 11:10:22, skipping insertion in model container [2024-09-08 11:10:22,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:10:22" (2/2) ... [2024-09-08 11:10:22,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715d6d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:22, skipping insertion in model container [2024-09-08 11:10:22,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:10:22" (2/2) ... [2024-09-08 11:10:22,655 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 11:10:22,656 INFO L1541 ArrayList]: Location invariant before [L817-L817] ((((((((((((((((! multithreaded || x$read_delayed == (_Bool)0) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL) && (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 )weak$$choice0) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$w_buff1_used >= 0LL) && (long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 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 >= 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 || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0) [2024-09-08 11:10:22,656 INFO L1541 ArrayList]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || x$read_delayed == (_Bool)0) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL) && (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 )weak$$choice0) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$w_buff1_used >= 0LL) && (long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 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 >= 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 || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0) [2024-09-08 11:10:22,657 INFO L1541 ArrayList]: ghost_variable multithreaded = 0 [2024-09-08 11:10:22,657 INFO L1541 ArrayList]: ghost_update [L814-L814] multithreaded = 1; [2024-09-08 11:10:22,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 11:10:22,899 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-09-08 11:10:23,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 11:10:23,124 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 11:10:23,164 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-08 11:10:23,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 11:10:23,343 INFO L204 MainTranslator]: Completed translation [2024-09-08 11:10:23,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23 WrapperNode [2024-09-08 11:10:23,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 11:10:23,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 11:10:23,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 11:10:23,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 11:10:23,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,425 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2024-09-08 11:10:23,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 11:10:23,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 11:10:23,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 11:10:23,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 11:10:23,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 11:10:23,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 11:10:23,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 11:10:23,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 11:10:23,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (1/1) ... [2024-09-08 11:10:23,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 11:10:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 11:10:23,523 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-08 11:10:23,526 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-08 11:10:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 11:10:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 11:10:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-08 11:10:23,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-08 11:10:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-08 11:10:23,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-08 11:10:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 11:10:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 11:10:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 11:10:23,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 11:10:23,581 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 11:10:23,708 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 11:10:23,709 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 11:10:24,209 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 11:10:24,209 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 11:10:24,370 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 11:10:24,370 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-08 11:10:24,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:10:24 BoogieIcfgContainer [2024-09-08 11:10:24,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 11:10:24,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 11:10:24,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 11:10:24,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 11:10:24,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 11:10:20" (1/4) ... [2024-09-08 11:10:24,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248462ea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 11:10:24, skipping insertion in model container [2024-09-08 11:10:24,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:10:22" (2/4) ... [2024-09-08 11:10:24,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248462ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:10:24, skipping insertion in model container [2024-09-08 11:10:24,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:23" (3/4) ... [2024-09-08 11:10:24,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248462ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:10:24, skipping insertion in model container [2024-09-08 11:10:24,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:10:24" (4/4) ... [2024-09-08 11:10:24,382 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-09-08 11:10:24,403 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 11:10:24,404 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-08 11:10:24,404 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 11:10:24,458 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 11:10:24,501 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 11:10:24,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 11:10:24,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 11:10:24,504 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-08 11:10:24,507 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-08 11:10:24,543 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 11:10:24,555 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-09-08 11:10:24,563 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;@7cb2f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 11:10:24,564 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 11:10:24,833 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 11:10:24,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 11:10:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1493048863, now seen corresponding path program 1 times [2024-09-08 11:10:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 11:10:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675896513] [2024-09-08 11:10:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 11:10:24,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 11:10:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 11:10:25,484 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-08 11:10:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 11:10:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675896513] [2024-09-08 11:10:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675896513] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 11:10:25,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 11:10:25,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 11:10:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847543716] [2024-09-08 11:10:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 11:10:25,493 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 11:10:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 11:10:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 11:10:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 11:10:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:25,525 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 11:10:25,526 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 11:10:25,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:26,760 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-08 11:10:26,761 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 11:10:26,768 INFO L408 BasicCegarLoop]: Path program histogram: [1] [2024-09-08 11:10:26,771 INFO L312 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2024-09-08 11:10:26,776 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 11:10:26,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 11:10:26,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 11:10:26,778 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-08 11:10:26,780 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-08 11:10:26,783 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 11:10:26,783 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 11:10:26,784 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;@7cb2f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 11:10:26,785 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-08 11:10:26,869 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-08 11:10:26,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 11:10:26,869 INFO L85 PathProgramCache]: Analyzing trace with hash 313659633, now seen corresponding path program 1 times [2024-09-08 11:10:26,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 11:10:26,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166703846] [2024-09-08 11:10:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 11:10:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 11:10:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 11:10:28,437 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-08 11:10:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 11:10:28,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166703846] [2024-09-08 11:10:28,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166703846] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 11:10:28,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 11:10:28,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 11:10:28,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186265535] [2024-09-08 11:10:28,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 11:10:28,440 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 11:10:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 11:10:28,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 11:10:28,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 11:10:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:28,442 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 11:10:28,442 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-08 11:10:28,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:28,728 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 11:10:28,728 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-08 11:10:28,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 11:10:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2050501752, now seen corresponding path program 1 times [2024-09-08 11:10:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 11:10:28,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935331904] [2024-09-08 11:10:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 11:10:28,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 11:10:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 11:10:33,340 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-08 11:10:33,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 11:10:33,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935331904] [2024-09-08 11:10:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935331904] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 11:10:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 11:10:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-08 11:10:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801727627] [2024-09-08 11:10:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 11:10:33,341 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-08 11:10:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 11:10:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-08 11:10:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-08 11:10:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:33,344 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 11:10:33,345 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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-08 11:10:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:33,628 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 11:10:33,629 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-08 11:10:33,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 11:10:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 345332587, now seen corresponding path program 1 times [2024-09-08 11:10:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 11:10:33,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755021190] [2024-09-08 11:10:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 11:10:33,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 11:10:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 11:10:33,874 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-08 11:10:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 11:10:33,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755021190] [2024-09-08 11:10:33,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755021190] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 11:10:33,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 11:10:33,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 11:10:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73018358] [2024-09-08 11:10:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 11:10:33,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 11:10:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 11:10:33,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 11:10:33,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-08 11:10:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:33,877 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 11:10:33,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-08 11:10:33,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:33,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:33,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 11:10:34,163 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 11:10:34,163 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-08 11:10:34,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 11:10:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash 329933704, now seen corresponding path program 1 times [2024-09-08 11:10:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 11:10:34,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656130198] [2024-09-08 11:10:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 11:10:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 11:10:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 11:10:34,741 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-08 11:10:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 11:10:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656130198] [2024-09-08 11:10:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656130198] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 11:10:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 11:10:34,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-08 11:10:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915129810] [2024-09-08 11:10:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 11:10:34,743 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 11:10:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 11:10:34,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 11:10:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-08 11:10:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:34,744 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 11:10:34,744 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-08 11:10:34,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:34,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:34,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 11:10:34,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 11:10:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 11:10:35,416 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 11:10:35,416 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-08 11:10:35,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 11:10:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash 780808908, now seen corresponding path program 2 times [2024-09-08 11:10:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 11:10:35,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875847926] [2024-09-08 11:10:35,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 11:10:35,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 11:10:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 11:10:35,988 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-08 11:10:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 11:10:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875847926] [2024-09-08 11:10:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875847926] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 11:10:35,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 11:10:35,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-08 11:10:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161416888] [2024-09-08 11:10:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 11:10:35,989 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 11:10:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 11:10:35,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 11:10:35,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-08 11:10:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:35,990 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 11:10:35,990 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-08 11:10:35,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:35,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:35,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 11:10:35,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 11:10:35,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 11:10:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 11:10:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 11:10:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 11:10:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 11:10:36,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 11:10:36,835 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 11:10:36,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 11:10:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 860263608, now seen corresponding path program 3 times [2024-09-08 11:10:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 11:10:36,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543134840] [2024-09-08 11:10:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 11:10:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 11:10:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 11:10:36,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 11:10:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 11:10:36,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 11:10:36,976 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 11:10:36,976 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-08 11:10:36,977 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-09-08 11:10:36,977 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-08 11:10:36,977 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-09-08 11:10:36,977 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-09-08 11:10:36,980 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 11:10:36,982 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-08 11:10:36,982 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-09-08 11:10:37,065 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 11:10:37,065 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 11:10:37,068 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-08 11:10:37,068 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-08 11:10:37,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 11:10:37 BasicIcfg [2024-09-08 11:10:37,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 11:10:37,069 INFO L158 Benchmark]: Toolchain (without parser) took 14490.65ms. Allocated memory was 169.9MB in the beginning and 593.5MB in the end (delta: 423.6MB). Free memory was 110.9MB in the beginning and 299.3MB in the end (delta: -188.3MB). Peak memory consumption was 235.7MB. Max. memory is 16.1GB. [2024-09-08 11:10:37,069 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 11:10:37,070 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 11:10:37,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.64ms. Allocated memory is still 169.9MB. Free memory was 110.5MB in the beginning and 74.5MB in the end (delta: 36.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-09-08 11:10:37,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.06ms. Allocated memory is still 169.9MB. Free memory was 74.5MB in the beginning and 69.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-08 11:10:37,070 INFO L158 Benchmark]: Boogie Preprocessor took 57.43ms. Allocated memory is still 169.9MB. Free memory was 69.5MB in the beginning and 66.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-08 11:10:37,070 INFO L158 Benchmark]: RCFGBuilder took 886.70ms. Allocated memory is still 169.9MB. Free memory was 66.9MB in the beginning and 79.5MB in the end (delta: -12.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-09-08 11:10:37,071 INFO L158 Benchmark]: TraceAbstraction took 12695.44ms. Allocated memory was 169.9MB in the beginning and 593.5MB in the end (delta: 423.6MB). Free memory was 78.7MB in the beginning and 299.3MB in the end (delta: -220.6MB). Peak memory consumption was 203.9MB. Max. memory is 16.1GB. [2024-09-08 11:10:37,073 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.11ms. Allocated memory is still 169.9MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.64ms. Allocated memory is still 169.9MB. Free memory was 110.5MB in the beginning and 74.5MB in the end (delta: 36.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.06ms. Allocated memory is still 169.9MB. Free memory was 74.5MB in the beginning and 69.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.43ms. Allocated memory is still 169.9MB. Free memory was 69.5MB in the beginning and 66.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 886.70ms. Allocated memory is still 169.9MB. Free memory was 66.9MB in the beginning and 79.5MB in the end (delta: -12.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12695.44ms. Allocated memory was 169.9MB in the beginning and 593.5MB in the end (delta: 423.6MB). Free memory was 78.7MB in the beginning and 299.3MB in the end (delta: -220.6MB). Peak memory consumption was 203.9MB. 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: 881, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 76, dependent conditional: 45, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 868, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 63, dependent conditional: 32, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 868, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 63, dependent conditional: 32, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 925, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 120, dependent conditional: 89, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 925, independent: 805, independent conditional: 25, independent unconditional: 780, dependent: 120, dependent conditional: 30, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 925, independent: 805, independent conditional: 25, independent unconditional: 780, dependent: 120, dependent conditional: 30, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 479, independent: 434, independent conditional: 3, independent unconditional: 431, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 479, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 58, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1285, independent: 302, independent conditional: 63, independent unconditional: 239, dependent: 983, dependent conditional: 287, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 925, independent: 371, independent conditional: 22, independent unconditional: 349, dependent: 75, dependent conditional: 19, dependent unconditional: 56, unknown: 479, unknown conditional: 14, unknown unconditional: 465] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 434, Positive conditional cache size: 3, Positive unconditional cache size: 431, Negative cache size: 45, Negative conditional cache size: 11, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 409, Maximal queried relation: 1, Independence queries for same thread: 13, Persistent sets #1 benchmarks: Persistent set computation time: 0.9s, Number of persistent set computation: 97, Number of trivial persistent sets: 65, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 461, independent: 430, independent conditional: 0, independent unconditional: 430, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 881, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 76, dependent conditional: 45, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 868, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 63, dependent conditional: 32, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 868, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 63, dependent conditional: 32, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 925, independent: 805, independent conditional: 375, independent unconditional: 430, dependent: 120, dependent conditional: 89, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 925, independent: 805, independent conditional: 25, independent unconditional: 780, dependent: 120, dependent conditional: 30, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 925, independent: 805, independent conditional: 25, independent unconditional: 780, dependent: 120, dependent conditional: 30, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 479, independent: 434, independent conditional: 3, independent unconditional: 431, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 479, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 58, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1285, independent: 302, independent conditional: 63, independent unconditional: 239, dependent: 983, dependent conditional: 287, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 925, independent: 371, independent conditional: 22, independent unconditional: 349, dependent: 75, dependent conditional: 19, dependent unconditional: 56, unknown: 479, unknown conditional: 14, unknown unconditional: 465] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 434, Positive conditional cache size: 3, Positive unconditional cache size: 431, Negative cache size: 45, Negative conditional cache size: 11, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 409, Maximal queried relation: 1, Independence queries for same thread: 13 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 825, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 73, dependent conditional: 41, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 800, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 48, dependent conditional: 16, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 800, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 48, dependent conditional: 16, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 878, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 126, dependent conditional: 94, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 878, independent: 752, independent conditional: 10, independent unconditional: 742, dependent: 126, dependent conditional: 44, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 878, independent: 752, independent conditional: 10, independent unconditional: 742, dependent: 126, dependent conditional: 44, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 383, independent: 336, independent conditional: 6, independent unconditional: 330, dependent: 47, dependent conditional: 15, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 383, independent: 318, independent conditional: 0, independent unconditional: 318, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 47, dependent conditional: 15, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 47, dependent conditional: 15, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1171, independent: 274, independent conditional: 45, independent unconditional: 229, dependent: 897, dependent conditional: 319, dependent unconditional: 577, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 878, independent: 416, independent conditional: 4, independent unconditional: 412, dependent: 79, dependent conditional: 29, dependent unconditional: 50, unknown: 383, unknown conditional: 21, unknown unconditional: 362] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 336, Positive conditional cache size: 6, Positive unconditional cache size: 330, Negative cache size: 47, Negative conditional cache size: 15, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 464, Maximal queried relation: 4, Independence queries for same thread: 25, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 91, Number of trivial persistent sets: 57, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 328, independent conditional: 0, independent unconditional: 328, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 825, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 73, dependent conditional: 41, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 800, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 48, dependent conditional: 16, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 800, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 48, dependent conditional: 16, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 878, independent: 752, independent conditional: 424, independent unconditional: 328, dependent: 126, dependent conditional: 94, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 878, independent: 752, independent conditional: 10, independent unconditional: 742, dependent: 126, dependent conditional: 44, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 878, independent: 752, independent conditional: 10, independent unconditional: 742, dependent: 126, dependent conditional: 44, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 383, independent: 336, independent conditional: 6, independent unconditional: 330, dependent: 47, dependent conditional: 15, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 383, independent: 318, independent conditional: 0, independent unconditional: 318, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 47, dependent conditional: 15, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 47, dependent conditional: 15, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1171, independent: 274, independent conditional: 45, independent unconditional: 229, dependent: 897, dependent conditional: 319, dependent unconditional: 577, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 878, independent: 416, independent conditional: 4, independent unconditional: 412, dependent: 79, dependent conditional: 29, dependent unconditional: 50, unknown: 383, unknown conditional: 21, unknown unconditional: 362] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 336, Positive conditional cache size: 6, Positive unconditional cache size: 330, Negative cache size: 47, Negative conditional cache size: 15, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 464, Maximal queried relation: 4, Independence queries for same thread: 25 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L1] 0 //@ ghost int multithreaded = 0; [L813] 0 pthread_t t1633; [L814] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-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] [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-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] [L815] 0 pthread_t t1634; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-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] [L816] 0 //@ assert (((((((((((((((((!multithreaded || (x$read_delayed == (_Bool) 0)) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((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) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1) >= 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) >= 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 || (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed_var == 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-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] [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-2, t1634=-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] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L817] 0 //@ assert (((((((((((((((((!multithreaded || (x$read_delayed == (_Bool) 0)) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((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) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1) >= 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) >= 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 || (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed_var == 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-2, t1634=-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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 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) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 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 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L800] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 816]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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, 59 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 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, 59 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.5s, 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: 42, 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.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 2191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-09-08 11:10:37,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-09-08 11:10:37,302 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-08 11:10:37,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE