./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-20_10-08-36.files/mutex-meet-local/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da67795f 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/safe029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-08-20_10-08-36.files/mutex-meet-local/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-eval-da67795-m [2024-08-27 12:47:19,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 12:47:19,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-27 12:47:19,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 12:47:19,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 12:47:19,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 12:47:19,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 12:47:19,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 12:47:19,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 12:47:19,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 12:47:19,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 12:47:19,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 12:47:19,939 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 12:47:19,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 12:47:19,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 12:47:19,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 12:47:19,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-27 12:47:19,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 12:47:19,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 12:47:19,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 12:47:19,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 12:47:19,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 12:47:19,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 12:47:19,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 12:47:19,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 12:47:19,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 12:47:19,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 12:47:19,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 12:47:19,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 12:47:19,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 12:47:19,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 12:47:19,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 12:47:19,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 12:47:19,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 12:47:19,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-27 12:47:19,943 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 12:47:19,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-27 12:47:19,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 12:47:19,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 12:47:19,944 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 12:47:19,944 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 12:47:19,944 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 12:47:19,944 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-27 12:47:20,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 12:47:20,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 12:47:20,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 12:47:20,175 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 12:47:20,175 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 12:47:20,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/mutex-meet-local/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-08-27 12:47:20,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 12:47:20,400 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 12:47:20,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-08-27 12:47:21,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 12:47:21,809 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 12:47:21,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-08-27 12:47:21,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/517bd3987/b09823ef8e884e05a1ba1e5fff648db4/FLAG195a0557f [2024-08-27 12:47:22,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/517bd3987/b09823ef8e884e05a1ba1e5fff648db4 [2024-08-27 12:47:22,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 12:47:22,151 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 12:47:22,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 12:47:22,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 12:47:22,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 12:47:22,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 12:47:20" (1/2) ... [2024-08-27 12:47:22,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7002f0a4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 12:47:22, skipping insertion in model container [2024-08-27 12:47:22,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 12:47:20" (1/2) ... [2024-08-27 12:47:22,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70e76dd7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 12:47:22, skipping insertion in model container [2024-08-27 12:47:22,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:47:22" (2/2) ... [2024-08-27 12:47:22,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7002f0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22, skipping insertion in model container [2024-08-27 12:47:22,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:47:22" (2/2) ... [2024-08-27 12:47:22,162 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 12:47:22,421 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 12:47:22,421 INFO L1541 ArrayList]: Location invariant before [L795-L795] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,421 INFO L1541 ArrayList]: Location invariant before [L740-L740] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,421 INFO L1541 ArrayList]: Location invariant before [L734-L734] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,422 INFO L1541 ArrayList]: Location invariant before [L775-L775] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,423 INFO L1541 ArrayList]: Location invariant before [L765-L765] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,423 INFO L1541 ArrayList]: Location invariant before [L806-L806] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,423 INFO L1541 ArrayList]: Location invariant before [L747-L747] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,423 INFO L1541 ArrayList]: Location invariant before [L799-L799] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,423 INFO L1541 ArrayList]: Location invariant before [L754-L754] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,423 INFO L1541 ArrayList]: Location invariant before [L768-L768] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,423 INFO L1541 ArrayList]: Location invariant before [L737-L737] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-08-27 12:47:22,455 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 12:47:22,586 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2024-08-27 12:47:22,717 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 12:47:22,733 INFO L202 MainTranslator]: Completed pre-run [2024-08-27 12:47:22,744 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] 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-27 12:47:22,965 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 12:47:22,997 INFO L206 MainTranslator]: Completed translation [2024-08-27 12:47:22,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22 WrapperNode [2024-08-27 12:47:22,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 12:47:22,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 12:47:22,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 12:47:22,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 12:47:23,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,100 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-08-27 12:47:23,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 12:47:23,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 12:47:23,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 12:47:23,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 12:47:23,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 12:47:23,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 12:47:23,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 12:47:23,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 12:47:23,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (1/1) ... [2024-08-27 12:47:23,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 12:47:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 12:47:23,202 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-27 12:47:23,207 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-27 12:47:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-27 12:47:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 12:47:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-08-27 12:47:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-08-27 12:47:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-08-27 12:47:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-08-27 12:47:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-27 12:47:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-27 12:47:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 12:47:23,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 12:47:23,245 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 12:47:23,341 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 12:47:23,343 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 12:47:23,981 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 12:47:23,981 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 12:47:24,338 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 12:47:24,339 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-27 12:47:24,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:47:24 BoogieIcfgContainer [2024-08-27 12:47:24,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 12:47:24,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 12:47:24,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 12:47:24,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 12:47:24,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 12:47:20" (1/4) ... [2024-08-27 12:47:24,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353a515 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 12:47:24, skipping insertion in model container [2024-08-27 12:47:24,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 12:47:22" (2/4) ... [2024-08-27 12:47:24,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353a515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:47:24, skipping insertion in model container [2024-08-27 12:47:24,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:47:22" (3/4) ... [2024-08-27 12:47:24,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353a515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:47:24, skipping insertion in model container [2024-08-27 12:47:24,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:47:24" (4/4) ... [2024-08-27 12:47:24,349 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-08-27 12:47:24,364 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 12:47:24,364 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-08-27 12:47:24,364 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 12:47:24,477 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 12:47:24,508 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 12:47:24,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 12:47:24,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 12:47:24,511 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-27 12:47:24,512 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-27 12:47:24,541 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 12:47:24,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-08-27 12:47:24,558 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;@5cf8e599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 12:47:24,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-08-27 12:47:24,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:24,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash -906197387, now seen corresponding path program 1 times [2024-08-27 12:47:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292575690] [2024-08-27 12:47:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:26,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-27 12:47:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292575690] [2024-08-27 12:47:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292575690] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:26,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-27 12:47:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329320724] [2024-08-27 12:47:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:26,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 12:47:26,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 12:47:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 12:47:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:26,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:26,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-27 12:47:26,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:26,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-27 12:47:26,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:26,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1972652531, now seen corresponding path program 1 times [2024-08-27 12:47:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245853784] [2024-08-27 12:47:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 12:47:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245853784] [2024-08-27 12:47:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245853784] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 12:47:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143803498] [2024-08-27 12:47:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:27,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 12:47:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 12:47:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 12:47:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:27,668 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:27,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-27 12:47:27,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:27,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:28,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-27 12:47:28,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:28,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1022686744, now seen corresponding path program 1 times [2024-08-27 12:47:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261401607] [2024-08-27 12:47:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:28,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:28,930 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-27 12:47:28,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:28,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261401607] [2024-08-27 12:47:28,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261401607] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:28,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:28,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 12:47:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244632435] [2024-08-27 12:47:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:28,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 12:47:28,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:28,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 12:47:28,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-08-27 12:47:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:28,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:28,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-27 12:47:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:29,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-27 12:47:29,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:29,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1638518421, now seen corresponding path program 1 times [2024-08-27 12:47:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965450328] [2024-08-27 12:47:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:31,657 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-27 12:47:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965450328] [2024-08-27 12:47:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965450328] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:31,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:31,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 12:47:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682499605] [2024-08-27 12:47:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:31,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 12:47:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:31,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 12:47:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-27 12:47:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:31,659 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:31,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-27 12:47:31,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:31,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:31,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:31,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:33,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-27 12:47:33,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:33,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 419034602, now seen corresponding path program 1 times [2024-08-27 12:47:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:33,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281106178] [2024-08-27 12:47:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:34,300 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-27 12:47:34,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281106178] [2024-08-27 12:47:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281106178] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:34,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:34,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-27 12:47:34,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272114954] [2024-08-27 12:47:34,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:34,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 12:47:34,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:34,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 12:47:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-27 12:47:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:34,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:34,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-27 12:47:34,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:34,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:34,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:34,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:34,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:34,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-27 12:47:34,698 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:34,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 991617622, now seen corresponding path program 1 times [2024-08-27 12:47:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:34,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365031053] [2024-08-27 12:47:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:38,711 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-27 12:47:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365031053] [2024-08-27 12:47:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365031053] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:38,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-27 12:47:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73285539] [2024-08-27 12:47:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:38,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-27 12:47:38,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:38,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-27 12:47:38,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-08-27 12:47:38,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:38,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:38,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-27 12:47:38,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:38,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:38,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:38,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:38,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:38,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 12:47:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-27 12:47:39,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:39,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1304350500, now seen corresponding path program 1 times [2024-08-27 12:47:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756645873] [2024-08-27 12:47:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:39,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-27 12:47:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:39,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756645873] [2024-08-27 12:47:39,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756645873] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:39,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:39,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 12:47:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680972110] [2024-08-27 12:47:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:39,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 12:47:39,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 12:47:39,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 12:47:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:39,957 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:39,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 12:47:39,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:39,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:39,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:39,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:39,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 12:47:39,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:39,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 12:47:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:40,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-27 12:47:40,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:40,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 343195320, now seen corresponding path program 1 times [2024-08-27 12:47:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:40,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848375657] [2024-08-27 12:47:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:42,339 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-27 12:47:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848375657] [2024-08-27 12:47:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848375657] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 12:47:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824691800] [2024-08-27 12:47:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 12:47:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 12:47:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-08-27 12:47:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:42,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:42,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:42,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 12:47:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:42,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-27 12:47:42,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-08-27 12:47:42,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash -812060030, now seen corresponding path program 2 times [2024-08-27 12:47:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:42,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192459473] [2024-08-27 12:47:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:42,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:45,557 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-27 12:47:45,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:45,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192459473] [2024-08-27 12:47:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192459473] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:45,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-27 12:47:45,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350175208] [2024-08-27 12:47:45,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:45,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-27 12:47:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-27 12:47:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-08-27 12:47:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:45,559 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:45,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-27 12:47:45,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:45,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:45,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:45,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:45,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 12:47:45,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:45,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:45,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:45,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 12:47:46,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 5 remaining) [2024-08-27 12:47:46,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-08-27 12:47:46,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-08-27 12:47:46,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 5 remaining) [2024-08-27 12:47:46,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 5 remaining) [2024-08-27 12:47:46,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-27 12:47:46,742 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-08-27 12:47:46,743 INFO L308 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/3) [2024-08-27 12:47:46,746 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 12:47:46,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 12:47:46,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 12:47:46,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 12:47:46,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-08-27 12:47:46,768 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 12:47:46,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 12:47:46,768 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;@5cf8e599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 12:47:46,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-08-27 12:47:46,911 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-27 12:47:46,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1022683719, now seen corresponding path program 1 times [2024-08-27 12:47:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433988384] [2024-08-27 12:47:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:47,477 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-27 12:47:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433988384] [2024-08-27 12:47:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433988384] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:47,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-27 12:47:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235184621] [2024-08-27 12:47:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:47,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 12:47:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:47,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 12:47:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 12:47:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:47,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:47,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 12:47:47,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:47,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-27 12:47:47,663 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-27 12:47:47,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1638516293, now seen corresponding path program 1 times [2024-08-27 12:47:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370204937] [2024-08-27 12:47:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:48,562 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-27 12:47:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370204937] [2024-08-27 12:47:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370204937] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 12:47:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540574641] [2024-08-27 12:47:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:48,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 12:47:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 12:47:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 12:47:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:48,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:48,564 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-27 12:47:48,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:48,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:48,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-27 12:47:48,881 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-27 12:47:48,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash -745538262, now seen corresponding path program 1 times [2024-08-27 12:47:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957903450] [2024-08-27 12:47:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:49,488 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-27 12:47:49,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:49,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957903450] [2024-08-27 12:47:49,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957903450] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:49,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:49,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 12:47:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251234547] [2024-08-27 12:47:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:49,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 12:47:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 12:47:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 12:47:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:49,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:49,490 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-27 12:47:49,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:49,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:49,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:49,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-27 12:47:49,659 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-27 12:47:49,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1636783513, now seen corresponding path program 1 times [2024-08-27 12:47:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214013788] [2024-08-27 12:47:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:51,238 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-27 12:47:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214013788] [2024-08-27 12:47:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214013788] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 12:47:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018545841] [2024-08-27 12:47:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:51,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 12:47:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 12:47:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-27 12:47:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:51,239 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:51,239 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-27 12:47:51,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:51,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:51,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:51,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:51,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-08-27 12:47:51,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 12:47:51,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash 893776219, now seen corresponding path program 1 times [2024-08-27 12:47:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404009423] [2024-08-27 12:47:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:51,803 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-27 12:47:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404009423] [2024-08-27 12:47:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404009423] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:51,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:51,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 12:47:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158372145] [2024-08-27 12:47:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:51,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 12:47:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:51,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 12:47:51,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 12:47:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:51,804 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:51,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 12:47:51,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:51,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:51,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:51,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:51,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:52,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-27 12:47:52,394 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 12:47:52,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1648584132, now seen corresponding path program 1 times [2024-08-27 12:47:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:52,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33548056] [2024-08-27 12:47:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 12:47:54,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33548056] [2024-08-27 12:47:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33548056] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-27 12:47:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320604308] [2024-08-27 12:47:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:54,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-27 12:47:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-27 12:47:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2024-08-27 12:47:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:54,102 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:54,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 12:47:54,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:54,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:54,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:54,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:54,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:54,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:54,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-27 12:47:54,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 12:47:54,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 595996407, now seen corresponding path program 1 times [2024-08-27 12:47:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:54,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325198667] [2024-08-27 12:47:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:54,897 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-27 12:47:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:54,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325198667] [2024-08-27 12:47:54,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325198667] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:54,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:54,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-27 12:47:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081659591] [2024-08-27 12:47:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:54,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-27 12:47:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-27 12:47:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-08-27 12:47:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:54,899 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:54,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 12:47:54,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:54,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:54,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:54,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:54,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:54,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:54,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-08-27 12:47:55,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 12:47:55,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1986601648, now seen corresponding path program 2 times [2024-08-27 12:47:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:55,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487202184] [2024-08-27 12:47:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 12:47:57,465 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-27 12:47:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 12:47:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487202184] [2024-08-27 12:47:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487202184] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 12:47:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 12:47:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-27 12:47:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026162995] [2024-08-27 12:47:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 12:47:57,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-27 12:47:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 12:47:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-27 12:47:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-08-27 12:47:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:57,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 12:47:57,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 12:47:57,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:57,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:57,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:57,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:57,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:57,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:57,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:57,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 12:47:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 12:47:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 12:47:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 12:47:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 12:47:57,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-27 12:47:57,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 12:47:57,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 12:47:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash 57382371, now seen corresponding path program 2 times [2024-08-27 12:47:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 12:47:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850588209] [2024-08-27 12:47:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 12:47:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 12:47:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 12:47:57,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 12:47:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 12:47:57,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 12:47:57,828 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 12:47:57,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-08-27 12:47:57,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-08-27 12:47:57,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-08-27 12:47:57,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-08-27 12:47:57,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-08-27 12:47:57,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-08-27 12:47:57,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-08-27 12:47:57,830 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-08-27 12:47:57,831 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-08-27 12:47:57,836 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-27 12:47:57,836 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-27 12:47:57,887 INFO L507 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-08-27 12:47:57,887 INFO L508 ceAbstractionStarter]: WitnessConsidered=11 [2024-08-27 12:47:57,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 12:47:57 BasicIcfg [2024-08-27 12:47:57,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-27 12:47:57,888 INFO L158 Benchmark]: Toolchain (without parser) took 35737.25ms. Allocated memory was 180.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 124.7MB in the beginning and 695.2MB in the end (delta: -570.5MB). Peak memory consumption was 918.3MB. Max. memory is 16.1GB. [2024-08-27 12:47:57,888 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 134.2MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 12:47:57,888 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 134.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 12:47:57,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 842.22ms. Allocated memory is still 180.4MB. Free memory was 124.7MB in the beginning and 64.0MB in the end (delta: 60.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-08-27 12:47:57,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.14ms. Allocated memory is still 180.4MB. Free memory was 64.0MB in the beginning and 136.6MB in the end (delta: -72.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-08-27 12:47:57,889 INFO L158 Benchmark]: Boogie Preprocessor took 69.67ms. Allocated memory is still 180.4MB. Free memory was 136.6MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-27 12:47:57,889 INFO L158 Benchmark]: RCFGBuilder took 1168.19ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 132.4MB in the beginning and 85.1MB in the end (delta: 47.3MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2024-08-27 12:47:57,889 INFO L158 Benchmark]: TraceAbstraction took 33545.40ms. Allocated memory was 218.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 84.1MB in the beginning and 695.2MB in the end (delta: -611.2MB). Peak memory consumption was 841.1MB. Max. memory is 16.1GB. [2024-08-27 12:47:57,890 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.09ms. Allocated memory is still 134.2MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.57ms. Allocated memory is still 134.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 842.22ms. Allocated memory is still 180.4MB. Free memory was 124.7MB in the beginning and 64.0MB in the end (delta: 60.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.14ms. Allocated memory is still 180.4MB. Free memory was 64.0MB in the beginning and 136.6MB in the end (delta: -72.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.67ms. Allocated memory is still 180.4MB. Free memory was 136.6MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1168.19ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 132.4MB in the beginning and 85.1MB in the end (delta: 47.3MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33545.40ms. Allocated memory was 218.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 84.1MB in the beginning and 695.2MB in the end (delta: -611.2MB). Peak memory consumption was 841.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2204, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 284, dependent conditional: 257, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 156, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 771, independent: 701, independent conditional: 8, independent unconditional: 693, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 771, independent: 503, independent conditional: 0, independent unconditional: 503, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4076, independent: 2919, independent conditional: 92, independent unconditional: 2826, dependent: 1158, dependent conditional: 693, dependent unconditional: 464, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2167, independent: 1219, independent conditional: 20, independent unconditional: 1199, dependent: 177, dependent conditional: 111, dependent unconditional: 66, unknown: 771, unknown conditional: 51, unknown unconditional: 720] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 701, Positive conditional cache size: 8, Positive unconditional cache size: 693, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 8, Independence queries for same thread: 221 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 3.3s, Number of persistent set computation: 118, Number of trivial persistent sets: 85, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 715, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2204, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 284, dependent conditional: 257, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 156, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 771, independent: 701, independent conditional: 8, independent unconditional: 693, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 771, independent: 503, independent conditional: 0, independent unconditional: 503, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4076, independent: 2919, independent conditional: 92, independent unconditional: 2826, dependent: 1158, dependent conditional: 693, dependent unconditional: 464, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2167, independent: 1219, independent conditional: 20, independent unconditional: 1199, dependent: 177, dependent conditional: 111, dependent unconditional: 66, unknown: 771, unknown conditional: 51, unknown unconditional: 720] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 701, Positive conditional cache size: 8, Positive unconditional cache size: 693, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 8, Independence queries for same thread: 221 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1319, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 175, dependent conditional: 160, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 539, independent: 506, independent conditional: 3, independent unconditional: 503, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 539, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1879, independent: 1429, independent conditional: 21, independent unconditional: 1408, dependent: 450, dependent conditional: 190, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1241, independent: 638, independent conditional: 4, independent unconditional: 634, dependent: 64, dependent conditional: 45, dependent unconditional: 19, unknown: 539, unknown conditional: 21, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 506, Positive conditional cache size: 3, Positive unconditional cache size: 503, Negative cache size: 33, Negative conditional cache size: 18, Negative unconditional cache size: 15, 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: 148 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 1.7s, Number of persistent set computation: 80, Number of trivial persistent sets: 43, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 518, independent: 503, independent conditional: 0, independent unconditional: 503, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1319, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 175, dependent conditional: 160, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 539, independent: 506, independent conditional: 3, independent unconditional: 503, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 539, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1879, independent: 1429, independent conditional: 21, independent unconditional: 1408, dependent: 450, dependent conditional: 190, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1241, independent: 638, independent conditional: 4, independent unconditional: 634, dependent: 64, dependent conditional: 45, dependent unconditional: 19, unknown: 539, unknown conditional: 21, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 506, Positive conditional cache size: 3, Positive unconditional cache size: 503, Negative cache size: 33, Negative conditional cache size: 18, Negative unconditional cache size: 15, 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: 148 - 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L777] 2 return 0; [L740] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 66 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 6.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 53, 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.4s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 4783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 66 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 3.2s, 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: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 4767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-27 12:47:57,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-08-27 12:47:58,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-08-27 12:47:58,335 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