./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/protection-local/rfi000_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-08-08_07-59-58.files/protection-local/rfi000_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-14 10:24:06,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 10:24:06,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-14 10:24:06,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 10:24:06,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 10:24:06,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 10:24:06,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 10:24:06,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 10:24:06,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 10:24:06,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 10:24:06,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 10:24:06,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 10:24:06,243 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 10:24:06,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 10:24:06,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 10:24:06,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 10:24:06,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 10:24:06,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 10:24:06,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 10:24:06,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 10:24:06,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 10:24:06,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 10:24:06,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 10:24:06,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 10:24:06,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 10:24:06,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 10:24:06,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 10:24:06,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 10:24:06,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 10:24:06,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 10:24:06,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 10:24:06,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 10:24:06,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 10:24:06,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 10:24:06,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 10:24:06,256 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-14 10:24:06,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 10:24:06,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 10:24:06,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-14 10:24:06,258 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 10:24:06,259 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-14 10:24:06,259 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-14 10:24:06,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-08-14 10:24:06,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 10:24:06,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 10:24:06,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 10:24:06,554 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 10:24:06,555 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 10:24:06,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-local/rfi000_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-08-14 10:24:06,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 10:24:06,849 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 10:24:06,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2024-08-14 10:24:08,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 10:24:08,569 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 10:24:08,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2024-08-14 10:24:08,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d57b120ba/a122fbe4063846b2ae03ae51de1fc260/FLAGc90b94fc8 [2024-08-14 10:24:08,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d57b120ba/a122fbe4063846b2ae03ae51de1fc260 [2024-08-14 10:24:08,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 10:24:08,611 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-14 10:24:08,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 10:24:08,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 10:24:08,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 10:24:08,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 10:24:06" (1/2) ... [2024-08-14 10:24:08,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1f60e7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 10:24:08, skipping insertion in model container [2024-08-14 10:24:08,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 10:24:06" (1/2) ... [2024-08-14 10:24:08,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4fffb212 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 10:24:08, skipping insertion in model container [2024-08-14 10:24:08,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 10:24:08" (2/2) ... [2024-08-14 10:24:08,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1f60e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:08, skipping insertion in model container [2024-08-14 10:24:08,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 10:24:08" (2/2) ... [2024-08-14 10:24:08,625 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-14 10:24:08,867 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-14 10:24:08,868 INFO L97 edCorrectnessWitness]: Location invariant before [L769-L769] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,868 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,868 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,869 INFO L97 edCorrectnessWitness]: Location invariant before [L766-L766] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,869 INFO L97 edCorrectnessWitness]: Location invariant before [L811-L811] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,869 INFO L97 edCorrectnessWitness]: Location invariant before [L749-L749] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,869 INFO L97 edCorrectnessWitness]: Location invariant before [L738-L738] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,869 INFO L97 edCorrectnessWitness]: Location invariant before [L788-L788] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,870 INFO L97 edCorrectnessWitness]: Location invariant before [L759-L759] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,870 INFO L97 edCorrectnessWitness]: Location invariant before [L804-L804] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,870 INFO L97 edCorrectnessWitness]: Location invariant before [L831-L831] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,870 INFO L97 edCorrectnessWitness]: Location invariant before [L772-L772] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,870 INFO L97 edCorrectnessWitness]: Location invariant before [L842-L842] ((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-08-14 10:24:08,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-14 10:24:09,097 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-08-14 10:24:09,290 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 10:24:09,304 INFO L202 MainTranslator]: Completed pre-run [2024-08-14 10:24:09,316 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] 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-08-14 10:24:09,484 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 10:24:09,551 INFO L206 MainTranslator]: Completed translation [2024-08-14 10:24:09,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09 WrapperNode [2024-08-14 10:24:09,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 10:24:09,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-14 10:24:09,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-14 10:24:09,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-14 10:24:09,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,611 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2024-08-14 10:24:09,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-14 10:24:09,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 10:24:09,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 10:24:09,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 10:24:09,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 10:24:09,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-14 10:24:09,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-14 10:24:09,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-14 10:24:09,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (1/1) ... [2024-08-14 10:24:09,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 10:24:09,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:24:09,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-14 10:24:09,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-14 10:24:09,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-14 10:24:09,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 10:24:09,740 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-08-14 10:24:09,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-08-14 10:24:09,741 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-08-14 10:24:09,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-08-14 10:24:09,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-14 10:24:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-14 10:24:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 10:24:09,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 10:24:09,745 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-14 10:24:09,885 INFO L244 CfgBuilder]: Building ICFG [2024-08-14 10:24:09,886 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 10:24:10,375 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-14 10:24:10,376 INFO L293 CfgBuilder]: Performing block encoding [2024-08-14 10:24:10,731 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 10:24:10,731 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 10:24:10,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 10:24:10 BoogieIcfgContainer [2024-08-14 10:24:10,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-14 10:24:10,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 10:24:10,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 10:24:10,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 10:24:10,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 10:24:06" (1/4) ... [2024-08-14 10:24:10,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84fd04b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 10:24:10, skipping insertion in model container [2024-08-14 10:24:10,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 10:24:08" (2/4) ... [2024-08-14 10:24:10,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84fd04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 10:24:10, skipping insertion in model container [2024-08-14 10:24:10,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:24:09" (3/4) ... [2024-08-14 10:24:10,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84fd04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 10:24:10, skipping insertion in model container [2024-08-14 10:24:10,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 10:24:10" (4/4) ... [2024-08-14 10:24:10,743 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2024-08-14 10:24:10,762 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 10:24:10,763 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-08-14 10:24:10,763 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-14 10:24:10,848 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 10:24:10,899 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:24:10,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 10:24:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:24:10,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 10:24:10,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-14 10:24:10,941 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 10:24:10,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 10:24:10,962 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c9c79a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:24:10,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-08-14 10:24:11,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:11,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 303086755, now seen corresponding path program 1 times [2024-08-14 10:24:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981357105] [2024-08-14 10:24:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:12,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:12,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981357105] [2024-08-14 10:24:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981357105] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:12,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:12,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 10:24:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324730395] [2024-08-14 10:24:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:12,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 10:24:12,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 10:24:12,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 10:24:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:12,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:12,182 INFO L496 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-08-14 10:24:12,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:12,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 10:24:12,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:12,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 805835084, now seen corresponding path program 1 times [2024-08-14 10:24:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061215201] [2024-08-14 10:24:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:12,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061215201] [2024-08-14 10:24:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061215201] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:12,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-14 10:24:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393512142] [2024-08-14 10:24:12,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:12,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 10:24:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 10:24:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-14 10:24:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:12,617 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:12,618 INFO L496 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-08-14 10:24:12,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:12,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:12,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 10:24:12,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:12,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -788833979, now seen corresponding path program 1 times [2024-08-14 10:24:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899977499] [2024-08-14 10:24:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899977499] [2024-08-14 10:24:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899977499] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 10:24:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077011587] [2024-08-14 10:24:13,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:13,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 10:24:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 10:24:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-08-14 10:24:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:13,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:13,200 INFO L496 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-08-14 10:24:13,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:13,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:13,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:13,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 10:24:13,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:13,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1316034542, now seen corresponding path program 1 times [2024-08-14 10:24:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:13,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954235782] [2024-08-14 10:24:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954235782] [2024-08-14 10:24:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954235782] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:14,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:14,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 10:24:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467132687] [2024-08-14 10:24:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:14,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 10:24:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:14,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 10:24:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 10:24:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:14,386 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:14,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:14,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:14,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:14,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:14,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:14,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 10:24:14,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:14,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2142451175, now seen corresponding path program 1 times [2024-08-14 10:24:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:14,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621617127] [2024-08-14 10:24:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:16,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621617127] [2024-08-14 10:24:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621617127] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:16,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:16,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 10:24:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454069279] [2024-08-14 10:24:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:16,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 10:24:16,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 10:24:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-08-14 10:24:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:16,087 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:16,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:16,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:16,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:16,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:16,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:16,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:16,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 10:24:16,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:16,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash -183307441, now seen corresponding path program 1 times [2024-08-14 10:24:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:16,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858417654] [2024-08-14 10:24:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:16,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:16,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858417654] [2024-08-14 10:24:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858417654] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 10:24:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122678289] [2024-08-14 10:24:16,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:16,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 10:24:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 10:24:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-14 10:24:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:16,910 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:16,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:16,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:16,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:16,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:16,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:16,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:16,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:17,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 10:24:17,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:17,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash -875223657, now seen corresponding path program 1 times [2024-08-14 10:24:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:17,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487095287] [2024-08-14 10:24:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:18,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487095287] [2024-08-14 10:24:18,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487095287] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:18,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:18,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 10:24:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301624176] [2024-08-14 10:24:18,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:18,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 10:24:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:18,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 10:24:18,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-08-14 10:24:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:18,319 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:18,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:18,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:18,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:18,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:18,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:18,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:18,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:18,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:18,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 10:24:18,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:18,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -337748817, now seen corresponding path program 1 times [2024-08-14 10:24:18,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:18,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157239396] [2024-08-14 10:24:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157239396] [2024-08-14 10:24:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157239396] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 10:24:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441434765] [2024-08-14 10:24:18,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:18,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 10:24:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 10:24:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 10:24:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:18,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:18,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:18,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:19,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-14 10:24:19,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:19,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -380005699, now seen corresponding path program 2 times [2024-08-14 10:24:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:19,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461150776] [2024-08-14 10:24:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:20,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461150776] [2024-08-14 10:24:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461150776] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-14 10:24:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011570586] [2024-08-14 10:24:20,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 10:24:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:20,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 10:24:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-08-14 10:24:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:20,781 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:20,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:20,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:20,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:20,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:20,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:20,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:20,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:20,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:20,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:20,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:21,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-14 10:24:21,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:21,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1102854495, now seen corresponding path program 3 times [2024-08-14 10:24:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90059416] [2024-08-14 10:24:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:22,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90059416] [2024-08-14 10:24:22,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90059416] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-14 10:24:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126317034] [2024-08-14 10:24:22,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:22,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 10:24:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:22,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 10:24:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-08-14 10:24:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:22,760 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:22,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:22,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:22,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:22,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:24:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 10:24:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 10:24:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 10:24:23,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-14 10:24:23,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:23,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1795725351, now seen corresponding path program 4 times [2024-08-14 10:24:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:23,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979895373] [2024-08-14 10:24:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:24:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:24:24,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:24:24,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979895373] [2024-08-14 10:24:24,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979895373] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:24:24,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:24:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 10:24:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527722427] [2024-08-14 10:24:24,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:24:24,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 10:24:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:24:24,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 10:24:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-08-14 10:24:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:24,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:24:24,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-14 10:24:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-14 10:24:24,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 10:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 10:24:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 10:24:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 10:24:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:24:25,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-14 10:24:25,492 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-14 10:24:25,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:24:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash 133564223, now seen corresponding path program 2 times [2024-08-14 10:24:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:24:25,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736198409] [2024-08-14 10:24:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:24:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:24:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 10:24:25,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 10:24:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 10:24:25,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 10:24:25,608 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 10:24:25,609 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-08-14 10:24:25,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-08-14 10:24:25,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-08-14 10:24:25,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-08-14 10:24:25,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-08-14 10:24:25,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-08-14 10:24:25,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 10:24:25,617 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2024-08-14 10:24:25,619 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2024-08-14 10:24:25,622 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-14 10:24:25,622 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 10:24:25,683 INFO L507 ceAbstractionStarter]: Automizer considered 13 witness invariants [2024-08-14 10:24:25,684 INFO L508 ceAbstractionStarter]: WitnessConsidered=13 [2024-08-14 10:24:25,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 10:24:25 BasicIcfg [2024-08-14 10:24:25,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 10:24:25,685 INFO L158 Benchmark]: Toolchain (without parser) took 17074.19ms. Allocated memory was 161.5MB in the beginning and 788.5MB in the end (delta: 627.0MB). Free memory was 100.0MB in the beginning and 557.0MB in the end (delta: -457.1MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. [2024-08-14 10:24:25,685 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 10:24:25,685 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 161.5MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 10:24:25,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 938.67ms. Allocated memory is still 161.5MB. Free memory was 99.5MB in the beginning and 123.5MB in the end (delta: -24.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-08-14 10:24:25,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.28ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 120.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 10:24:25,686 INFO L158 Benchmark]: Boogie Preprocessor took 55.27ms. Allocated memory is still 161.5MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 10:24:25,686 INFO L158 Benchmark]: RCFGBuilder took 1064.00ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 117.1MB in the beginning and 154.9MB in the end (delta: -37.8MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2024-08-14 10:24:25,686 INFO L158 Benchmark]: TraceAbstraction took 14948.87ms. Allocated memory was 243.3MB in the beginning and 788.5MB in the end (delta: 545.3MB). Free memory was 154.9MB in the beginning and 557.0MB in the end (delta: -402.1MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. [2024-08-14 10:24:25,690 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.19ms. Allocated memory is still 161.5MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.93ms. Allocated memory is still 161.5MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 938.67ms. Allocated memory is still 161.5MB. Free memory was 99.5MB in the beginning and 123.5MB in the end (delta: -24.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.28ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 120.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.27ms. Allocated memory is still 161.5MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1064.00ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 117.1MB in the beginning and 154.9MB in the end (delta: -37.8MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14948.87ms. Allocated memory was 243.3MB in the beginning and 788.5MB in the end (delta: 545.3MB). Free memory was 154.9MB in the beginning and 557.0MB in the end (delta: -402.1MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5051, independent: 4140, independent conditional: 3327, independent unconditional: 813, dependent: 911, dependent conditional: 891, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4231, independent: 4140, independent conditional: 3327, independent unconditional: 813, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4231, independent: 4140, independent conditional: 3327, independent unconditional: 813, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4921, independent: 4140, independent conditional: 76, independent unconditional: 4064, dependent: 781, dependent conditional: 614, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4921, independent: 4140, independent conditional: 76, independent unconditional: 4064, dependent: 781, dependent conditional: 614, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4921, independent: 4140, independent conditional: 76, independent unconditional: 4064, dependent: 781, dependent conditional: 614, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 901, independent: 816, independent conditional: 3, independent unconditional: 813, dependent: 85, dependent conditional: 65, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 901, independent: 536, independent conditional: 0, independent unconditional: 536, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 365, independent: 280, independent conditional: 3, independent unconditional: 277, dependent: 85, dependent conditional: 65, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 365, independent: 280, independent conditional: 3, independent unconditional: 277, dependent: 85, dependent conditional: 65, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2507, independent: 1845, independent conditional: 11, independent unconditional: 1834, dependent: 662, dependent conditional: 482, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4921, independent: 3324, independent conditional: 73, independent unconditional: 3251, dependent: 696, dependent conditional: 549, dependent unconditional: 147, unknown: 901, unknown conditional: 68, unknown unconditional: 833] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 816, Positive conditional cache size: 3, Positive unconditional cache size: 813, Negative cache size: 85, Negative conditional cache size: 65, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 6, Independence queries for same thread: 820 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 2.1s, Number of persistent set computation: 199, Number of trivial persistent sets: 126, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 833, independent: 813, independent conditional: 0, independent unconditional: 813, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5051, independent: 4140, independent conditional: 3327, independent unconditional: 813, dependent: 911, dependent conditional: 891, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4231, independent: 4140, independent conditional: 3327, independent unconditional: 813, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4231, independent: 4140, independent conditional: 3327, independent unconditional: 813, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4921, independent: 4140, independent conditional: 76, independent unconditional: 4064, dependent: 781, dependent conditional: 614, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4921, independent: 4140, independent conditional: 76, independent unconditional: 4064, dependent: 781, dependent conditional: 614, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4921, independent: 4140, independent conditional: 76, independent unconditional: 4064, dependent: 781, dependent conditional: 614, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 901, independent: 816, independent conditional: 3, independent unconditional: 813, dependent: 85, dependent conditional: 65, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 901, independent: 536, independent conditional: 0, independent unconditional: 536, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 365, independent: 280, independent conditional: 3, independent unconditional: 277, dependent: 85, dependent conditional: 65, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 365, independent: 280, independent conditional: 3, independent unconditional: 277, dependent: 85, dependent conditional: 65, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2507, independent: 1845, independent conditional: 11, independent unconditional: 1834, dependent: 662, dependent conditional: 482, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4921, independent: 3324, independent conditional: 73, independent unconditional: 3251, dependent: 696, dependent conditional: 549, dependent unconditional: 147, unknown: 901, unknown conditional: 68, unknown unconditional: 833] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 816, Positive conditional cache size: 3, Positive unconditional cache size: 813, Negative cache size: 85, Negative conditional cache size: 65, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 6, Independence queries for same thread: 820 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1585=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L828] 0 pthread_t t1586; [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1585=-1, t1586=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L766] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L769] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L772] 2 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L804] 2 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L811] 2 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L813] 2 return 0; [L752] 1 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L759] 1 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585=-1, t1586=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585=-1, t1586=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] 0 //@ assert (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585=-1, t1586=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L857] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 835]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that 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: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 74 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 5.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 4035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 10:24:25,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-08-14 10:24:25,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE