./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-local/mix009.oepc.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/mix009.oepc.i ./goblint.2024-09-02_08-21-23.files/protection-local/mix009.oepc.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 18:29:57,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 18:29:57,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 18:29:57,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 18:29:57,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 18:29:57,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 18:29:57,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 18:29:57,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 18:29:57,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 18:29:57,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 18:29:57,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 18:29:57,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 18:29:57,259 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 18:29:57,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 18:29:57,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 18:29:57,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 18:29:57,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 18:29:57,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 18:29:57,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 18:29:57,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 18:29:57,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 18:29:57,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 18:29:57,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 18:29:57,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 18:29:57,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 18:29:57,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 18:29:57,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 18:29:57,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 18:29:57,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 18:29:57,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 18:29:57,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 18:29:57,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 18:29:57,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 18:29:57,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 18:29:57,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 18:29:57,269 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 18:29:57,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 18:29:57,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 18:29:57,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 18:29:57,270 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 18:29:57,270 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 18:29:57,271 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 18:29:57,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 18:29:57,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 18:29:57,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 18:29:57,574 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 18:29:57,574 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 18:29:57,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-local/mix009.oepc.yml/witness.yml [2024-09-08 18:29:57,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 18:29:57,763 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 18:29:57,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-09-08 18:29:59,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 18:29:59,605 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 18:29:59,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-09-08 18:29:59,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/82a9e7df7/771308314c6c48519308be0fa0141663/FLAGe838f0a0a [2024-09-08 18:29:59,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/82a9e7df7/771308314c6c48519308be0fa0141663 [2024-09-08 18:29:59,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 18:29:59,912 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 18:29:59,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 18:29:59,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 18:29:59,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 18:29:59,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:29:57" (1/2) ... [2024-09-08 18:29:59,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9b4e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:29:59, skipping insertion in model container [2024-09-08 18:29:59,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:29:57" (1/2) ... [2024-09-08 18:29:59,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5470306b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:29:59, skipping insertion in model container [2024-09-08 18:29:59,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:29:59" (2/2) ... [2024-09-08 18:29:59,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9b4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:59, skipping insertion in model container [2024-09-08 18:29:59,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:29:59" (2/2) ... [2024-09-08 18:30:00,129 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 18:30:00,129 INFO L1541 ArrayList]: Location invariant before [L764-L764] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,130 INFO L1541 ArrayList]: Location invariant before [L778-L778] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,130 INFO L1541 ArrayList]: Location invariant before [L784-L784] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,130 INFO L1541 ArrayList]: Location invariant before [L807-L807] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,133 INFO L1541 ArrayList]: Location invariant before [L744-L744] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,133 INFO L1541 ArrayList]: Location invariant before [L827-L827] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,133 INFO L1541 ArrayList]: Location invariant before [L761-L761] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,133 INFO L1541 ArrayList]: Location invariant before [L831-L831] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,134 INFO L1541 ArrayList]: Location invariant before [L838-L838] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,134 INFO L1541 ArrayList]: Location invariant before [L781-L781] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,134 INFO L1541 ArrayList]: Location invariant before [L758-L758] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,134 INFO L1541 ArrayList]: Location invariant before [L755-L755] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,134 INFO L1541 ArrayList]: Location invariant before [L800-L800] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,134 INFO L1541 ArrayList]: Location invariant before [L771-L771] (((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool)0)) && (z$r_buff0_thd0 == (_Bool)0)) && (z$r_buff0_thd2 == (_Bool)0)) && (z$r_buff1_thd0 == (_Bool)0)) && (z$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1) [2024-09-08 18:30:00,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 18:30:00,385 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/mix009.oepc.i[945,958] [2024-09-08 18:30:00,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 18:30:00,580 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 18:30:00,599 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/mix009.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-08 18:30:00,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 18:30:00,795 INFO L204 MainTranslator]: Completed translation [2024-09-08 18:30:00,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00 WrapperNode [2024-09-08 18:30:00,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 18:30:00,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 18:30:00,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 18:30:00,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 18:30:00,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,908 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2024-09-08 18:30:00,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 18:30:00,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 18:30:00,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 18:30:00,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 18:30:00,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:00,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 18:30:00,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 18:30:00,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 18:30:00,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 18:30:00,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (1/1) ... [2024-09-08 18:30:01,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 18:30:01,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:30:01,035 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 18:30:01,038 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 18:30:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 18:30:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 18:30:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-08 18:30:01,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-08 18:30:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-08 18:30:01,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-08 18:30:01,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 18:30:01,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 18:30:01,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 18:30:01,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 18:30:01,092 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 18:30:01,262 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 18:30:01,264 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 18:30:01,860 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 18:30:01,861 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 18:30:02,181 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 18:30:02,182 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-08 18:30:02,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:30:02 BoogieIcfgContainer [2024-09-08 18:30:02,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 18:30:02,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 18:30:02,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 18:30:02,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 18:30:02,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:29:57" (1/4) ... [2024-09-08 18:30:02,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cfd375 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 06:30:02, skipping insertion in model container [2024-09-08 18:30:02,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:29:59" (2/4) ... [2024-09-08 18:30:02,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cfd375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:30:02, skipping insertion in model container [2024-09-08 18:30:02,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:30:00" (3/4) ... [2024-09-08 18:30:02,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cfd375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:30:02, skipping insertion in model container [2024-09-08 18:30:02,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:30:02" (4/4) ... [2024-09-08 18:30:02,220 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2024-09-08 18:30:02,276 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 18:30:02,277 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-09-08 18:30:02,277 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 18:30:02,377 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 18:30:02,421 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 18:30:02,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 18:30:02,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:30:02,424 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 18:30:02,425 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 18:30:02,462 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 18:30:02,476 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 18:30:02,483 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;@160be59e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 18:30:02,484 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-08 18:30:02,860 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:02,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1859716691, now seen corresponding path program 1 times [2024-09-08 18:30:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:02,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149362881] [2024-09-08 18:30:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:04,053 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 18:30:04,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149362881] [2024-09-08 18:30:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149362881] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:04,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 18:30:04,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592378509] [2024-09-08 18:30:04,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:04,063 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 18:30:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 18:30:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 18:30:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:04,095 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:04,097 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:30:04,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:04,353 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 18:30:04,354 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:04,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1816717715, now seen corresponding path program 1 times [2024-09-08 18:30:04,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676320554] [2024-09-08 18:30:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:04,746 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 18:30:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676320554] [2024-09-08 18:30:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676320554] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:04,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 18:30:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405082628] [2024-09-08 18:30:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:04,751 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 18:30:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 18:30:04,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-08 18:30:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:04,754 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:04,754 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 18:30:04,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:04,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:05,403 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 18:30:05,404 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:05,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 483751381, now seen corresponding path program 1 times [2024-09-08 18:30:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:05,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191097459] [2024-09-08 18:30:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:05,920 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 18:30:05,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:05,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191097459] [2024-09-08 18:30:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191097459] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 18:30:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601101191] [2024-09-08 18:30:05,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:05,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 18:30:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:05,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 18:30:05,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 18:30:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:05,924 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:05,924 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:30:05,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:05,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:05,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:06,735 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 18:30:06,736 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:06,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1136658343, now seen corresponding path program 1 times [2024-09-08 18:30:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603582183] [2024-09-08 18:30:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:07,101 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 18:30:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:07,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603582183] [2024-09-08 18:30:07,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603582183] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:07,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:07,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 18:30:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920789210] [2024-09-08 18:30:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:07,103 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 18:30:07,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:07,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 18:30:07,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-08 18:30:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:07,105 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:07,105 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 18:30:07,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:07,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:07,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:07,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:07,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 18:30:07,743 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:07,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1713239074, now seen corresponding path program 1 times [2024-09-08 18:30:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:07,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336465553] [2024-09-08 18:30:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:09,402 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 18:30:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336465553] [2024-09-08 18:30:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336465553] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-08 18:30:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062631917] [2024-09-08 18:30:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:09,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 18:30:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 18:30:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-09-08 18:30:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:09,406 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:09,406 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:30:09,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:09,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:09,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:09,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:09,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 18:30:09,790 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 18:30:09,791 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:09,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2136120818, now seen corresponding path program 1 times [2024-09-08 18:30:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:09,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016045838] [2024-09-08 18:30:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:09,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:10,377 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 18:30:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:10,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016045838] [2024-09-08 18:30:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016045838] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 18:30:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312746048] [2024-09-08 18:30:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:10,379 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-08 18:30:10,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-08 18:30:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-09-08 18:30:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:10,380 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:10,380 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:30:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:10,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:10,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 18:30:10,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 18:30:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:30:11,737 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 18:30:11,737 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:11,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2130311176, now seen corresponding path program 2 times [2024-09-08 18:30:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549088302] [2024-09-08 18:30:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:13,155 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 18:30:13,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549088302] [2024-09-08 18:30:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549088302] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:13,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:13,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-08 18:30:13,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750076746] [2024-09-08 18:30:13,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:13,158 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 18:30:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 18:30:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2024-09-08 18:30:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:13,161 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:13,161 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:30:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 18:30:13,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:30:13,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 18:30:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:30:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 18:30:14,155 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 18:30:14,156 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:14,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash 555714850, now seen corresponding path program 3 times [2024-09-08 18:30:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518081174] [2024-09-08 18:30:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:30:15,425 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 18:30:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:30:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518081174] [2024-09-08 18:30:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518081174] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:30:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:30:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-08 18:30:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004292366] [2024-09-08 18:30:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:30:15,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 18:30:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:30:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 18:30:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-09-08 18:30:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:15,428 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:30:15,428 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:30:15,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:15,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:15,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:15,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:15,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 18:30:15,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:30:15,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 18:30:15,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:30:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:30:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:30:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 18:30:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 18:30:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:30:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 18:30:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 18:30:15,999 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 18:30:15,999 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 18:30:15,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:30:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash 115111694, now seen corresponding path program 2 times [2024-09-08 18:30:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:30:16,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952487411] [2024-09-08 18:30:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:30:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:30:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 18:30:16,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 18:30:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 18:30:16,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 18:30:16,193 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 18:30:16,194 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-08 18:30:16,196 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-09-08 18:30:16,197 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-09-08 18:30:16,198 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-09-08 18:30:16,198 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-08 18:30:16,198 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-08 18:30:16,198 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-08 18:30:16,208 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-09-08 18:30:16,210 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2024-09-08 18:30:16,312 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 18:30:16,313 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 18:30:16,317 INFO L469 ceAbstractionStarter]: Automizer considered 14 witness invariants [2024-09-08 18:30:16,317 INFO L470 ceAbstractionStarter]: WitnessConsidered=14 [2024-09-08 18:30:16,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:30:16 BasicIcfg [2024-09-08 18:30:16,318 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 18:30:16,319 INFO L158 Benchmark]: Toolchain (without parser) took 16406.59ms. Allocated memory was 184.5MB in the beginning and 574.6MB in the end (delta: 390.1MB). Free memory was 123.9MB in the beginning and 426.7MB in the end (delta: -302.9MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2024-09-08 18:30:16,319 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 18:30:16,319 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 18:30:16,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 882.18ms. Allocated memory is still 184.5MB. Free memory was 123.5MB in the beginning and 148.7MB in the end (delta: -25.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2024-09-08 18:30:16,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.96ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 148.7MB in the beginning and 223.1MB in the end (delta: -74.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-09-08 18:30:16,320 INFO L158 Benchmark]: Boogie Preprocessor took 72.66ms. Allocated memory is still 257.9MB. Free memory was 223.1MB in the beginning and 220.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 18:30:16,320 INFO L158 Benchmark]: RCFGBuilder took 1196.73ms. Allocated memory is still 257.9MB. Free memory was 220.2MB in the beginning and 109.0MB in the end (delta: 111.1MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2024-09-08 18:30:16,321 INFO L158 Benchmark]: TraceAbstraction took 14110.28ms. Allocated memory was 257.9MB in the beginning and 574.6MB in the end (delta: 316.7MB). Free memory was 220.8MB in the beginning and 426.7MB in the end (delta: -206.0MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2024-09-08 18:30:16,322 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.13ms. Allocated memory is still 184.5MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 882.18ms. Allocated memory is still 184.5MB. Free memory was 123.5MB in the beginning and 148.7MB in the end (delta: -25.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.96ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 148.7MB in the beginning and 223.1MB in the end (delta: -74.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.66ms. Allocated memory is still 257.9MB. Free memory was 223.1MB in the beginning and 220.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1196.73ms. Allocated memory is still 257.9MB. Free memory was 220.2MB in the beginning and 109.0MB in the end (delta: 111.1MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14110.28ms. Allocated memory was 257.9MB in the beginning and 574.6MB in the end (delta: 316.7MB). Free memory was 220.8MB in the beginning and 426.7MB in the end (delta: -206.0MB). Peak memory consumption was 110.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: 3607, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 515, dependent conditional: 501, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3138, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 46, dependent conditional: 32, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3138, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 46, dependent conditional: 32, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3350, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 258, dependent conditional: 244, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3350, independent: 3092, independent conditional: 33, independent unconditional: 3059, dependent: 258, dependent conditional: 179, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3350, independent: 3092, independent conditional: 33, independent unconditional: 3059, dependent: 258, dependent conditional: 179, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1019, independent: 976, independent conditional: 3, independent unconditional: 973, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1019, independent: 653, independent conditional: 0, independent unconditional: 653, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 366, independent: 323, independent conditional: 3, independent unconditional: 320, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 366, independent: 323, independent conditional: 3, independent unconditional: 320, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3268, independent: 2686, independent conditional: 13, independent unconditional: 2673, dependent: 582, dependent conditional: 396, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3350, independent: 2116, independent conditional: 30, independent unconditional: 2086, dependent: 215, dependent conditional: 150, dependent unconditional: 65, unknown: 1019, unknown conditional: 32, unknown unconditional: 987] , Statistics on independence cache: Total cache size (in pairs): 1019, Positive cache size: 976, Positive conditional cache size: 3, Positive unconditional cache size: 973, Negative cache size: 43, Negative conditional cache size: 29, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2151, Maximal queried relation: 5, Independence queries for same thread: 469, Persistent sets #1 benchmarks: Persistent set computation time: 3.0s, Number of persistent set computation: 199, Number of trivial persistent sets: 136, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 987, independent: 973, independent conditional: 0, independent unconditional: 973, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3607, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 515, dependent conditional: 501, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3138, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 46, dependent conditional: 32, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3138, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 46, dependent conditional: 32, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3350, independent: 3092, independent conditional: 2119, independent unconditional: 973, dependent: 258, dependent conditional: 244, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3350, independent: 3092, independent conditional: 33, independent unconditional: 3059, dependent: 258, dependent conditional: 179, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3350, independent: 3092, independent conditional: 33, independent unconditional: 3059, dependent: 258, dependent conditional: 179, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1019, independent: 976, independent conditional: 3, independent unconditional: 973, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1019, independent: 653, independent conditional: 0, independent unconditional: 653, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 366, independent: 323, independent conditional: 3, independent unconditional: 320, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 366, independent: 323, independent conditional: 3, independent unconditional: 320, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3268, independent: 2686, independent conditional: 13, independent unconditional: 2673, dependent: 582, dependent conditional: 396, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3350, independent: 2116, independent conditional: 30, independent unconditional: 2086, dependent: 215, dependent conditional: 150, dependent unconditional: 65, unknown: 1019, unknown conditional: 32, unknown unconditional: 987] , Statistics on independence cache: Total cache size (in pairs): 1019, Positive cache size: 976, Positive conditional cache size: 3, Positive unconditional cache size: 973, Negative cache size: 43, Negative conditional cache size: 29, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2151, Maximal queried relation: 5, Independence queries for same thread: 469 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t242; [L825] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L758] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L761] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L778] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L781] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L784] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L807] 2 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 2 return 0; [L764] 1 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 1 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L827] 0 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 //@ assert ((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))); [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-2, t242=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 827]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 78 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 6.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 56, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 3451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 18:30:16,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-09-08 18:30:16,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE