./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix043.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix043.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:51:03,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:51:03,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:51:03,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:51:03,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:51:03,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:51:03,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:51:03,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:51:03,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:51:03,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:51:03,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:51:03,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:51:03,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:51:03,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:51:03,510 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:51:03,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:51:03,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:51:03,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:51:03,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:51:03,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:51:03,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:51:03,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:51:03,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:51:03,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:51:03,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:51:03,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:51:03,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:51:03,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:51:03,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:51:03,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:51:03,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:51:03,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:51:03,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:51:03,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:51:03,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:51:03,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:51:03,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:51:03,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:51:03,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:51:03,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:51:03,517 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:51:03,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:51:03,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:51:03,517 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 23:51:03,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:51:03,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:51:03,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:51:03,748 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:51:03,748 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:51:03,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix043.oepc.yml/witness.yml [2024-06-27 23:51:03,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:51:03,882 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:51:03,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2024-06-27 23:51:04,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:51:05,083 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:51:05,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2024-06-27 23:51:05,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12cde36ce/354d8d3a87d04e618ff06b3779831d88/FLAG232f7f696 [2024-06-27 23:51:05,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12cde36ce/354d8d3a87d04e618ff06b3779831d88 [2024-06-27 23:51:05,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:51:05,124 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:51:05,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:51:05,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:51:05,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:51:05,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:51:03" (1/2) ... [2024-06-27 23:51:05,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4f51bc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:51:05, skipping insertion in model container [2024-06-27 23:51:05,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:51:03" (1/2) ... [2024-06-27 23:51:05,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2422263b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:51:05, skipping insertion in model container [2024-06-27 23:51:05,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:51:05" (2/2) ... [2024-06-27 23:51:05,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4f51bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05, skipping insertion in model container [2024-06-27 23:51:05,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:51:05" (2/2) ... [2024-06-27 23:51:05,131 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:51:05,153 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:51:05,153 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:51:05,154 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:51:05,154 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:51:05,154 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:51:05,155 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:51:05,155 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-27 23:51:05,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:51:05,447 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:51:05,455 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:51:05,689 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:51:05,724 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:51:05,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05 WrapperNode [2024-06-27 23:51:05,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:51:05,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:51:05,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:51:05,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:51:05,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,830 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-06-27 23:51:05,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:51:05,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:51:05,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:51:05,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:51:05,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,894 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 23:51:05,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:51:05,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:51:05,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:51:05,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:51:05,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (1/1) ... [2024-06-27 23:51:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:51:05,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:51:05,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 23:51:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:51:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:51:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:51:06,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:51:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:51:06,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:51:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:51:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:51:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:51:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:51:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:51:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:51:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:51:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:51:06,006 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:51:05,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 23:51:06,128 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:51:06,129 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:51:06,694 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:51:06,695 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:51:06,903 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:51:06,903 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:51:06,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:51:06 BoogieIcfgContainer [2024-06-27 23:51:06,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:51:06,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:51:06,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:51:06,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:51:06,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:51:03" (1/4) ... [2024-06-27 23:51:06,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a382da and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:51:06, skipping insertion in model container [2024-06-27 23:51:06,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:51:05" (2/4) ... [2024-06-27 23:51:06,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a382da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:51:06, skipping insertion in model container [2024-06-27 23:51:06,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:51:05" (3/4) ... [2024-06-27 23:51:06,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a382da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:51:06, skipping insertion in model container [2024-06-27 23:51:06,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:51:06" (4/4) ... [2024-06-27 23:51:06,914 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2024-06-27 23:51:06,927 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:51:06,927 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:51:06,927 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:51:06,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:51:07,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:51:07,048 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 23:51:07,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:51:07,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:51:07,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:51:07,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-27 23:51:07,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:51:07,094 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=PETRI_NET, 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;@718ef738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:51:07,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:51:07,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:51:07,100 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:51:07,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:51:07,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:07,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:51:07,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:07,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 407834173, now seen corresponding path program 1 times [2024-06-27 23:51:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:07,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885063841] [2024-06-27 23:51:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:08,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:08,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885063841] [2024-06-27 23:51:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885063841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:51:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914738785] [2024-06-27 23:51:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:08,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:51:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:08,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:51:08,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:51:08,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:51:08,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-06-27 23:51:08,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:08,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:51:08,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:10,904 INFO L124 PetriNetUnfolderBase]: 10942/15157 cut-off events. [2024-06-27 23:51:10,904 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-06-27 23:51:10,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30334 conditions, 15157 events. 10942/15157 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 82789 event pairs, 8442 based on Foata normal form. 1/14828 useless extension candidates. Maximal degree in co-relation 30321. Up to 14798 conditions per place. [2024-06-27 23:51:11,001 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 44 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 23:51:11,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 233 flow [2024-06-27 23:51:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:51:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:51:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-06-27 23:51:11,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2024-06-27 23:51:11,013 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 98 transitions. [2024-06-27 23:51:11,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 233 flow [2024-06-27 23:51:11,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:51:11,021 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-27 23:51:11,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 23:51:11,025 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-27 23:51:11,025 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-27 23:51:11,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-06-27 23:51:11,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:11,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:11,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:51:11,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:11,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:11,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1086673948, now seen corresponding path program 1 times [2024-06-27 23:51:11,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017924755] [2024-06-27 23:51:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017924755] [2024-06-27 23:51:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017924755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:12,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:12,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:51:12,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482797147] [2024-06-27 23:51:12,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:12,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:51:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:51:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:51:12,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:51:12,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-06-27 23:51:12,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:12,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:51:12,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:14,408 INFO L124 PetriNetUnfolderBase]: 10932/15154 cut-off events. [2024-06-27 23:51:14,408 INFO L125 PetriNetUnfolderBase]: For 2814/2814 co-relation queries the response was YES. [2024-06-27 23:51:14,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34167 conditions, 15154 events. 10932/15154 cut-off events. For 2814/2814 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 82762 event pairs, 7512 based on Foata normal form. 4/15005 useless extension candidates. Maximal degree in co-relation 34155. Up to 14763 conditions per place. [2024-06-27 23:51:14,481 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 54 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-27 23:51:14,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 325 flow [2024-06-27 23:51:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:51:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:51:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-27 23:51:14,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5990566037735849 [2024-06-27 23:51:14,485 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 127 transitions. [2024-06-27 23:51:14,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 325 flow [2024-06-27 23:51:14,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:51:14,490 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-27 23:51:14,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-27 23:51:14,491 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-27 23:51:14,491 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-27 23:51:14,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-06-27 23:51:14,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:14,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:14,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:51:14,494 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:14,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 616670715, now seen corresponding path program 1 times [2024-06-27 23:51:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374396040] [2024-06-27 23:51:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374396040] [2024-06-27 23:51:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374396040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:51:16,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731329815] [2024-06-27 23:51:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:16,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:51:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:16,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:51:16,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:51:16,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:51:16,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-06-27 23:51:16,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:16,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:51:16,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:18,461 INFO L124 PetriNetUnfolderBase]: 13257/18301 cut-off events. [2024-06-27 23:51:18,461 INFO L125 PetriNetUnfolderBase]: For 9331/9331 co-relation queries the response was YES. [2024-06-27 23:51:18,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45520 conditions, 18301 events. 13257/18301 cut-off events. For 9331/9331 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 100570 event pairs, 7685 based on Foata normal form. 4/18122 useless extension candidates. Maximal degree in co-relation 45506. Up to 17812 conditions per place. [2024-06-27 23:51:18,565 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 75 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2024-06-27 23:51:18,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 512 flow [2024-06-27 23:51:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:51:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:51:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-27 23:51:18,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2024-06-27 23:51:18,570 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 6 states and 180 transitions. [2024-06-27 23:51:18,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 512 flow [2024-06-27 23:51:18,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 484 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 23:51:18,575 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 258 flow [2024-06-27 23:51:18,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-27 23:51:18,576 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 23:51:18,576 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 258 flow [2024-06-27 23:51:18,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-06-27 23:51:18,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:18,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:18,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:51:18,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:18,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 216202615, now seen corresponding path program 1 times [2024-06-27 23:51:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:18,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906836492] [2024-06-27 23:51:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:20,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906836492] [2024-06-27 23:51:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906836492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:20,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:20,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:51:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123590692] [2024-06-27 23:51:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:20,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:51:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:51:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:51:20,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:51:20,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-06-27 23:51:20,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:20,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:51:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:22,702 INFO L124 PetriNetUnfolderBase]: 13241/18275 cut-off events. [2024-06-27 23:51:22,703 INFO L125 PetriNetUnfolderBase]: For 18925/18925 co-relation queries the response was YES. [2024-06-27 23:51:22,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50590 conditions, 18275 events. 13241/18275 cut-off events. For 18925/18925 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 99878 event pairs, 6594 based on Foata normal form. 8/18100 useless extension candidates. Maximal degree in co-relation 50574. Up to 17746 conditions per place. [2024-06-27 23:51:22,799 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 82 selfloop transitions, 20 changer transitions 0/109 dead transitions. [2024-06-27 23:51:22,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 602 flow [2024-06-27 23:51:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:51:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:51:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 204 transitions. [2024-06-27 23:51:22,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5498652291105122 [2024-06-27 23:51:22,801 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 258 flow. Second operand 7 states and 204 transitions. [2024-06-27 23:51:22,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 602 flow [2024-06-27 23:51:22,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 563 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 23:51:22,807 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 291 flow [2024-06-27 23:51:22,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-06-27 23:51:22,809 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-06-27 23:51:22,809 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 291 flow [2024-06-27 23:51:22,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-06-27 23:51:22,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:22,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:22,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:51:22,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:22,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash 675725916, now seen corresponding path program 1 times [2024-06-27 23:51:22,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476501297] [2024-06-27 23:51:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:22,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:24,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476501297] [2024-06-27 23:51:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476501297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:24,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:51:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497059353] [2024-06-27 23:51:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:24,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:51:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:24,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:51:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:51:24,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:24,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-06-27 23:51:24,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:24,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:24,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:26,706 INFO L124 PetriNetUnfolderBase]: 13223/18251 cut-off events. [2024-06-27 23:51:26,706 INFO L125 PetriNetUnfolderBase]: For 29462/29462 co-relation queries the response was YES. [2024-06-27 23:51:26,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54082 conditions, 18251 events. 13223/18251 cut-off events. For 29462/29462 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 100195 event pairs, 7013 based on Foata normal form. 6/18074 useless extension candidates. Maximal degree in co-relation 54064. Up to 17797 conditions per place. [2024-06-27 23:51:26,795 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 66 selfloop transitions, 12 changer transitions 0/84 dead transitions. [2024-06-27 23:51:26,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 528 flow [2024-06-27 23:51:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:51:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:51:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-06-27 23:51:26,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47547169811320755 [2024-06-27 23:51:26,800 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 291 flow. Second operand 5 states and 126 transitions. [2024-06-27 23:51:26,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 528 flow [2024-06-27 23:51:26,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 472 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 23:51:26,808 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 320 flow [2024-06-27 23:51:26,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-06-27 23:51:26,811 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2024-06-27 23:51:26,811 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 320 flow [2024-06-27 23:51:26,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-06-27 23:51:26,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:26,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:26,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:51:26,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:26,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 826868091, now seen corresponding path program 1 times [2024-06-27 23:51:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748499473] [2024-06-27 23:51:26,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:26,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748499473] [2024-06-27 23:51:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748499473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:51:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839935377] [2024-06-27 23:51:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:28,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:51:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:51:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:51:28,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:28,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-06-27 23:51:28,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:28,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:28,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:30,651 INFO L124 PetriNetUnfolderBase]: 13299/18356 cut-off events. [2024-06-27 23:51:30,651 INFO L125 PetriNetUnfolderBase]: For 41540/41540 co-relation queries the response was YES. [2024-06-27 23:51:30,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58679 conditions, 18356 events. 13299/18356 cut-off events. For 41540/41540 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 100208 event pairs, 6860 based on Foata normal form. 3/18173 useless extension candidates. Maximal degree in co-relation 58658. Up to 17866 conditions per place. [2024-06-27 23:51:30,753 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 81 selfloop transitions, 23 changer transitions 0/110 dead transitions. [2024-06-27 23:51:30,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 110 transitions, 743 flow [2024-06-27 23:51:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:51:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:51:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-27 23:51:30,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48427672955974843 [2024-06-27 23:51:30,757 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 320 flow. Second operand 6 states and 154 transitions. [2024-06-27 23:51:30,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 110 transitions, 743 flow [2024-06-27 23:51:30,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 110 transitions, 689 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 23:51:30,763 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 480 flow [2024-06-27 23:51:30,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2024-06-27 23:51:30,766 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2024-06-27 23:51:30,766 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 480 flow [2024-06-27 23:51:30,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-06-27 23:51:30,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:30,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:30,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:51:30,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:30,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1519860381, now seen corresponding path program 2 times [2024-06-27 23:51:30,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128470752] [2024-06-27 23:51:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128470752] [2024-06-27 23:51:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128470752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:32,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:32,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:51:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604173829] [2024-06-27 23:51:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:51:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:51:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:51:32,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:32,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-06-27 23:51:32,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:32,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:32,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:35,023 INFO L124 PetriNetUnfolderBase]: 13290/18349 cut-off events. [2024-06-27 23:51:35,024 INFO L125 PetriNetUnfolderBase]: For 56290/56290 co-relation queries the response was YES. [2024-06-27 23:51:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63094 conditions, 18349 events. 13290/18349 cut-off events. For 56290/56290 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 100247 event pairs, 6853 based on Foata normal form. 3/18168 useless extension candidates. Maximal degree in co-relation 63068. Up to 17889 conditions per place. [2024-06-27 23:51:35,158 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 84 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2024-06-27 23:51:35,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 740 flow [2024-06-27 23:51:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:51:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:51:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-27 23:51:35,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46540880503144655 [2024-06-27 23:51:35,159 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 480 flow. Second operand 6 states and 148 transitions. [2024-06-27 23:51:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 740 flow [2024-06-27 23:51:35,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 699 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-06-27 23:51:35,328 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 482 flow [2024-06-27 23:51:35,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2024-06-27 23:51:35,329 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2024-06-27 23:51:35,329 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 482 flow [2024-06-27 23:51:35,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-06-27 23:51:35,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:35,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:35,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:51:35,329 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:35,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash 344406399, now seen corresponding path program 3 times [2024-06-27 23:51:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:35,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452428510] [2024-06-27 23:51:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:37,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452428510] [2024-06-27 23:51:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452428510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:51:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182597020] [2024-06-27 23:51:37,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:37,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:51:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:51:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:51:37,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:37,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-06-27 23:51:37,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:37,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:37,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:39,644 INFO L124 PetriNetUnfolderBase]: 13353/18445 cut-off events. [2024-06-27 23:51:39,645 INFO L125 PetriNetUnfolderBase]: For 65744/65744 co-relation queries the response was YES. [2024-06-27 23:51:39,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64957 conditions, 18445 events. 13353/18445 cut-off events. For 65744/65744 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 100656 event pairs, 6853 based on Foata normal form. 3/18263 useless extension candidates. Maximal degree in co-relation 64928. Up to 17888 conditions per place. [2024-06-27 23:51:39,755 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 84 selfloop transitions, 48 changer transitions 0/138 dead transitions. [2024-06-27 23:51:39,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 138 transitions, 994 flow [2024-06-27 23:51:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:51:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:51:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-06-27 23:51:39,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188679245283019 [2024-06-27 23:51:39,756 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 482 flow. Second operand 6 states and 165 transitions. [2024-06-27 23:51:39,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 138 transitions, 994 flow [2024-06-27 23:51:39,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 138 transitions, 946 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 23:51:39,784 INFO L231 Difference]: Finished difference. Result has 82 places, 107 transitions, 763 flow [2024-06-27 23:51:39,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=763, PETRI_PLACES=82, PETRI_TRANSITIONS=107} [2024-06-27 23:51:39,784 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2024-06-27 23:51:39,785 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 107 transitions, 763 flow [2024-06-27 23:51:39,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-06-27 23:51:39,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:39,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:39,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:51:39,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:39,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -828041673, now seen corresponding path program 1 times [2024-06-27 23:51:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:39,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159445202] [2024-06-27 23:51:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:41,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159445202] [2024-06-27 23:51:41,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159445202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:51:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753145156] [2024-06-27 23:51:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:41,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:51:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:51:41,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:51:41,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:41,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 107 transitions, 763 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:41,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:41,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:41,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:44,042 INFO L124 PetriNetUnfolderBase]: 13398/18510 cut-off events. [2024-06-27 23:51:44,043 INFO L125 PetriNetUnfolderBase]: For 85267/85267 co-relation queries the response was YES. [2024-06-27 23:51:44,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70048 conditions, 18510 events. 13398/18510 cut-off events. For 85267/85267 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 101115 event pairs, 6745 based on Foata normal form. 3/18329 useless extension candidates. Maximal degree in co-relation 70018. Up to 18005 conditions per place. [2024-06-27 23:51:44,197 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 118 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2024-06-27 23:51:44,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 148 transitions, 1217 flow [2024-06-27 23:51:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:51:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:51:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 23:51:44,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2024-06-27 23:51:44,201 INFO L175 Difference]: Start difference. First operand has 82 places, 107 transitions, 763 flow. Second operand 7 states and 173 transitions. [2024-06-27 23:51:44,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 148 transitions, 1217 flow [2024-06-27 23:51:44,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1144 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 23:51:44,244 INFO L231 Difference]: Finished difference. Result has 88 places, 115 transitions, 831 flow [2024-06-27 23:51:44,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=831, PETRI_PLACES=88, PETRI_TRANSITIONS=115} [2024-06-27 23:51:44,245 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2024-06-27 23:51:44,245 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 115 transitions, 831 flow [2024-06-27 23:51:44,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:44,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:44,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:44,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:51:44,246 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:44,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash -136891693, now seen corresponding path program 2 times [2024-06-27 23:51:44,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087940236] [2024-06-27 23:51:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087940236] [2024-06-27 23:51:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087940236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:45,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:51:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671014583] [2024-06-27 23:51:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:51:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:51:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:51:46,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:46,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 115 transitions, 831 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:46,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:46,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:46,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:48,557 INFO L124 PetriNetUnfolderBase]: 13451/18580 cut-off events. [2024-06-27 23:51:48,558 INFO L125 PetriNetUnfolderBase]: For 105568/105568 co-relation queries the response was YES. [2024-06-27 23:51:48,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74718 conditions, 18580 events. 13451/18580 cut-off events. For 105568/105568 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 101367 event pairs, 6694 based on Foata normal form. 3/18396 useless extension candidates. Maximal degree in co-relation 74685. Up to 17960 conditions per place. [2024-06-27 23:51:48,664 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 102 selfloop transitions, 51 changer transitions 0/159 dead transitions. [2024-06-27 23:51:48,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 159 transitions, 1407 flow [2024-06-27 23:51:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:51:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:51:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-27 23:51:48,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48247978436657685 [2024-06-27 23:51:48,668 INFO L175 Difference]: Start difference. First operand has 88 places, 115 transitions, 831 flow. Second operand 7 states and 179 transitions. [2024-06-27 23:51:48,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 159 transitions, 1407 flow [2024-06-27 23:51:48,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 159 transitions, 1327 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 23:51:48,705 INFO L231 Difference]: Finished difference. Result has 91 places, 123 transitions, 974 flow [2024-06-27 23:51:48,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=974, PETRI_PLACES=91, PETRI_TRANSITIONS=123} [2024-06-27 23:51:48,707 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 35 predicate places. [2024-06-27 23:51:48,715 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 123 transitions, 974 flow [2024-06-27 23:51:48,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:48,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:48,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:48,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:51:48,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:48,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash -66024127, now seen corresponding path program 3 times [2024-06-27 23:51:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137047568] [2024-06-27 23:51:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:50,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137047568] [2024-06-27 23:51:50,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137047568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:50,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:50,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:51:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955829130] [2024-06-27 23:51:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:50,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:51:50,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:51:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:51:50,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:50,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 123 transitions, 974 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:50,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:50,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:50,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:52,778 INFO L124 PetriNetUnfolderBase]: 13442/18571 cut-off events. [2024-06-27 23:51:52,778 INFO L125 PetriNetUnfolderBase]: For 131016/131016 co-relation queries the response was YES. [2024-06-27 23:51:52,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79036 conditions, 18571 events. 13442/18571 cut-off events. For 131016/131016 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 101272 event pairs, 6691 based on Foata normal form. 3/18389 useless extension candidates. Maximal degree in co-relation 79002. Up to 18069 conditions per place. [2024-06-27 23:51:52,919 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 124 selfloop transitions, 24 changer transitions 0/154 dead transitions. [2024-06-27 23:51:52,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 154 transitions, 1372 flow [2024-06-27 23:51:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:51:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:51:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 23:51:52,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609164420485175 [2024-06-27 23:51:52,921 INFO L175 Difference]: Start difference. First operand has 91 places, 123 transitions, 974 flow. Second operand 7 states and 171 transitions. [2024-06-27 23:51:52,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 154 transitions, 1372 flow [2024-06-27 23:51:52,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 1268 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-27 23:51:52,991 INFO L231 Difference]: Finished difference. Result has 95 places, 123 transitions, 930 flow [2024-06-27 23:51:52,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=930, PETRI_PLACES=95, PETRI_TRANSITIONS=123} [2024-06-27 23:51:52,991 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2024-06-27 23:51:52,991 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 123 transitions, 930 flow [2024-06-27 23:51:52,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:52,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:52,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:52,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:51:52,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:52,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:52,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1303068751, now seen corresponding path program 4 times [2024-06-27 23:51:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891911631] [2024-06-27 23:51:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:51:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:51:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:51:54,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891911631] [2024-06-27 23:51:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891911631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:51:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:51:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:51:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739767211] [2024-06-27 23:51:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:51:54,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:51:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:51:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:51:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:51:54,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:51:54,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 123 transitions, 930 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:54,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:51:54,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:51:54,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:51:57,706 INFO L124 PetriNetUnfolderBase]: 13597/18812 cut-off events. [2024-06-27 23:51:57,706 INFO L125 PetriNetUnfolderBase]: For 147228/147234 co-relation queries the response was YES. [2024-06-27 23:51:57,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81607 conditions, 18812 events. 13597/18812 cut-off events. For 147228/147234 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 102820 event pairs, 6732 based on Foata normal form. 7/18636 useless extension candidates. Maximal degree in co-relation 81571. Up to 18172 conditions per place. [2024-06-27 23:51:57,857 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 142 selfloop transitions, 65 changer transitions 0/213 dead transitions. [2024-06-27 23:51:57,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 213 transitions, 1927 flow [2024-06-27 23:51:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:51:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:51:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-06-27 23:51:57,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469811320754717 [2024-06-27 23:51:57,860 INFO L175 Difference]: Start difference. First operand has 95 places, 123 transitions, 930 flow. Second operand 10 states and 249 transitions. [2024-06-27 23:51:57,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 213 transitions, 1927 flow [2024-06-27 23:51:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 213 transitions, 1847 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 23:51:57,980 INFO L231 Difference]: Finished difference. Result has 101 places, 156 transitions, 1338 flow [2024-06-27 23:51:57,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1338, PETRI_PLACES=101, PETRI_TRANSITIONS=156} [2024-06-27 23:51:57,982 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 45 predicate places. [2024-06-27 23:51:57,982 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 156 transitions, 1338 flow [2024-06-27 23:51:57,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:51:57,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:51:57,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:51:57,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:51:57,983 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:51:57,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:51:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2064374799, now seen corresponding path program 5 times [2024-06-27 23:51:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:51:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044490059] [2024-06-27 23:51:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:51:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:51:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:00,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:00,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044490059] [2024-06-27 23:52:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044490059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:00,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:00,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:52:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777897309] [2024-06-27 23:52:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:00,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:52:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:00,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:52:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:52:00,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:52:00,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 156 transitions, 1338 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:52:00,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:00,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:52:00,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:52:03,328 INFO L124 PetriNetUnfolderBase]: 13683/18945 cut-off events. [2024-06-27 23:52:03,328 INFO L125 PetriNetUnfolderBase]: For 180096/180108 co-relation queries the response was YES. [2024-06-27 23:52:03,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87331 conditions, 18945 events. 13683/18945 cut-off events. For 180096/180108 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 103904 event pairs, 6732 based on Foata normal form. 15/18777 useless extension candidates. Maximal degree in co-relation 87292. Up to 18296 conditions per place. [2024-06-27 23:52:03,459 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 145 selfloop transitions, 77 changer transitions 0/228 dead transitions. [2024-06-27 23:52:03,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 228 transitions, 2252 flow [2024-06-27 23:52:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:52:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:52:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 23:52:03,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2024-06-27 23:52:03,461 INFO L175 Difference]: Start difference. First operand has 101 places, 156 transitions, 1338 flow. Second operand 8 states and 200 transitions. [2024-06-27 23:52:03,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 228 transitions, 2252 flow [2024-06-27 23:52:03,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 228 transitions, 2040 flow, removed 78 selfloop flow, removed 4 redundant places. [2024-06-27 23:52:03,572 INFO L231 Difference]: Finished difference. Result has 106 places, 189 transitions, 1692 flow [2024-06-27 23:52:03,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1692, PETRI_PLACES=106, PETRI_TRANSITIONS=189} [2024-06-27 23:52:03,573 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2024-06-27 23:52:03,573 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 189 transitions, 1692 flow [2024-06-27 23:52:03,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:52:03,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:52:03,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:52:03,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:52:03,573 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:52:03,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:52:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2085944289, now seen corresponding path program 6 times [2024-06-27 23:52:03,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:52:03,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912718803] [2024-06-27 23:52:03,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:52:03,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:52:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912718803] [2024-06-27 23:52:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912718803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:05,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:52:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531327074] [2024-06-27 23:52:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:52:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:52:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:52:05,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:52:05,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 189 transitions, 1692 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:52:05,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:05,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:52:05,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:52:08,696 INFO L124 PetriNetUnfolderBase]: 13728/19008 cut-off events. [2024-06-27 23:52:08,696 INFO L125 PetriNetUnfolderBase]: For 195645/195645 co-relation queries the response was YES. [2024-06-27 23:52:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89184 conditions, 19008 events. 13728/19008 cut-off events. For 195645/195645 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 104067 event pairs, 6690 based on Foata normal form. 3/18826 useless extension candidates. Maximal degree in co-relation 89142. Up to 18151 conditions per place. [2024-06-27 23:52:08,876 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 99 selfloop transitions, 142 changer transitions 0/247 dead transitions. [2024-06-27 23:52:08,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 247 transitions, 2476 flow [2024-06-27 23:52:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:52:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:52:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-06-27 23:52:08,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47877358490566035 [2024-06-27 23:52:08,878 INFO L175 Difference]: Start difference. First operand has 106 places, 189 transitions, 1692 flow. Second operand 8 states and 203 transitions. [2024-06-27 23:52:08,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 247 transitions, 2476 flow [2024-06-27 23:52:09,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 247 transitions, 2404 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 23:52:09,038 INFO L231 Difference]: Finished difference. Result has 112 places, 209 transitions, 2127 flow [2024-06-27 23:52:09,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2127, PETRI_PLACES=112, PETRI_TRANSITIONS=209} [2024-06-27 23:52:09,039 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 56 predicate places. [2024-06-27 23:52:09,039 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 209 transitions, 2127 flow [2024-06-27 23:52:09,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-27 23:52:09,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:52:09,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:52:09,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:52:09,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:52:09,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:52:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash -128720919, now seen corresponding path program 1 times [2024-06-27 23:52:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:52:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974468978] [2024-06-27 23:52:09,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:52:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:52:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:11,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974468978] [2024-06-27 23:52:11,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974468978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:11,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:11,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:52:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079946639] [2024-06-27 23:52:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:11,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:52:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:11,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:52:11,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:52:11,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:52:11,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 209 transitions, 2127 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-06-27 23:52:11,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:11,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:52:11,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:52:15,102 INFO L124 PetriNetUnfolderBase]: 16916/23042 cut-off events. [2024-06-27 23:52:15,102 INFO L125 PetriNetUnfolderBase]: For 277289/277289 co-relation queries the response was YES. [2024-06-27 23:52:15,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112503 conditions, 23042 events. 16916/23042 cut-off events. For 277289/277289 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 123361 event pairs, 8291 based on Foata normal form. 6/22934 useless extension candidates. Maximal degree in co-relation 112459. Up to 22653 conditions per place. [2024-06-27 23:52:15,302 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 219 selfloop transitions, 24 changer transitions 0/248 dead transitions. [2024-06-27 23:52:15,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 248 transitions, 2849 flow [2024-06-27 23:52:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:52:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:52:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-27 23:52:15,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.419811320754717 [2024-06-27 23:52:15,304 INFO L175 Difference]: Start difference. First operand has 112 places, 209 transitions, 2127 flow. Second operand 8 states and 178 transitions. [2024-06-27 23:52:15,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 248 transitions, 2849 flow [2024-06-27 23:52:15,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 248 transitions, 2594 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-27 23:52:15,475 INFO L231 Difference]: Finished difference. Result has 117 places, 218 transitions, 2059 flow [2024-06-27 23:52:15,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2059, PETRI_PLACES=117, PETRI_TRANSITIONS=218} [2024-06-27 23:52:15,476 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 61 predicate places. [2024-06-27 23:52:15,477 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 218 transitions, 2059 flow [2024-06-27 23:52:15,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-06-27 23:52:15,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:52:15,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:52:15,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:52:15,477 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:52:15,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:52:15,478 INFO L85 PathProgramCache]: Analyzing trace with hash -827292957, now seen corresponding path program 1 times [2024-06-27 23:52:15,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:52:15,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671575530] [2024-06-27 23:52:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:52:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:52:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671575530] [2024-06-27 23:52:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671575530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:52:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747694451] [2024-06-27 23:52:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:52:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:52:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:52:17,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:52:17,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 218 transitions, 2059 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-06-27 23:52:17,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:17,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:52:17,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:52:21,273 INFO L124 PetriNetUnfolderBase]: 16180/22465 cut-off events. [2024-06-27 23:52:21,274 INFO L125 PetriNetUnfolderBase]: For 303839/303982 co-relation queries the response was YES. [2024-06-27 23:52:21,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112817 conditions, 22465 events. 16180/22465 cut-off events. For 303839/303982 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 123752 event pairs, 8339 based on Foata normal form. 77/22294 useless extension candidates. Maximal degree in co-relation 112771. Up to 21629 conditions per place. [2024-06-27 23:52:21,452 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 207 selfloop transitions, 12 changer transitions 0/235 dead transitions. [2024-06-27 23:52:21,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 235 transitions, 2607 flow [2024-06-27 23:52:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:52:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:52:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-06-27 23:52:21,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45660377358490567 [2024-06-27 23:52:21,453 INFO L175 Difference]: Start difference. First operand has 117 places, 218 transitions, 2059 flow. Second operand 5 states and 121 transitions. [2024-06-27 23:52:21,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 235 transitions, 2607 flow [2024-06-27 23:52:21,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 235 transitions, 2505 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-27 23:52:21,661 INFO L231 Difference]: Finished difference. Result has 117 places, 222 transitions, 2044 flow [2024-06-27 23:52:21,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2044, PETRI_PLACES=117, PETRI_TRANSITIONS=222} [2024-06-27 23:52:21,661 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 61 predicate places. [2024-06-27 23:52:21,661 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 222 transitions, 2044 flow [2024-06-27 23:52:21,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-06-27 23:52:21,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:52:21,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:52:21,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:52:21,662 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:52:21,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:52:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2025239444, now seen corresponding path program 1 times [2024-06-27 23:52:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:52:21,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205292263] [2024-06-27 23:52:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:52:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:52:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:24,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205292263] [2024-06-27 23:52:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205292263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:52:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788433296] [2024-06-27 23:52:24,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:24,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:52:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:24,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:52:24,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:52:24,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:52:24,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 222 transitions, 2044 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 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-06-27 23:52:24,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:24,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:52:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:52:28,933 INFO L124 PetriNetUnfolderBase]: 16658/22957 cut-off events. [2024-06-27 23:52:28,933 INFO L125 PetriNetUnfolderBase]: For 361093/361101 co-relation queries the response was YES. [2024-06-27 23:52:29,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124667 conditions, 22957 events. 16658/22957 cut-off events. For 361093/361101 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 127197 event pairs, 7579 based on Foata normal form. 12/22746 useless extension candidates. Maximal degree in co-relation 124620. Up to 22093 conditions per place. [2024-06-27 23:52:29,126 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 220 selfloop transitions, 66 changer transitions 0/293 dead transitions. [2024-06-27 23:52:29,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 293 transitions, 3292 flow [2024-06-27 23:52:29,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:52:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:52:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-06-27 23:52:29,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45660377358490567 [2024-06-27 23:52:29,128 INFO L175 Difference]: Start difference. First operand has 117 places, 222 transitions, 2044 flow. Second operand 10 states and 242 transitions. [2024-06-27 23:52:29,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 293 transitions, 3292 flow [2024-06-27 23:52:29,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 293 transitions, 3235 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-27 23:52:29,379 INFO L231 Difference]: Finished difference. Result has 126 places, 238 transitions, 2405 flow [2024-06-27 23:52:29,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2405, PETRI_PLACES=126, PETRI_TRANSITIONS=238} [2024-06-27 23:52:29,379 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2024-06-27 23:52:29,380 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 238 transitions, 2405 flow [2024-06-27 23:52:29,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 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-06-27 23:52:29,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:52:29,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:52:29,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:52:29,380 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:52:29,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:52:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash 47607036, now seen corresponding path program 2 times [2024-06-27 23:52:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:52:29,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611448031] [2024-06-27 23:52:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:52:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:52:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:31,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611448031] [2024-06-27 23:52:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611448031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:52:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051465726] [2024-06-27 23:52:31,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:31,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:52:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:31,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:52:31,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:52:31,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:52:31,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 238 transitions, 2405 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-06-27 23:52:31,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:31,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:52:31,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:52:36,684 INFO L124 PetriNetUnfolderBase]: 16664/22967 cut-off events. [2024-06-27 23:52:36,684 INFO L125 PetriNetUnfolderBase]: For 412303/412311 co-relation queries the response was YES. [2024-06-27 23:52:36,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131013 conditions, 22967 events. 16664/22967 cut-off events. For 412303/412311 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 127259 event pairs, 7608 based on Foata normal form. 14/22759 useless extension candidates. Maximal degree in co-relation 130963. Up to 22235 conditions per place. [2024-06-27 23:52:36,879 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 214 selfloop transitions, 60 changer transitions 0/281 dead transitions. [2024-06-27 23:52:36,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 281 transitions, 3223 flow [2024-06-27 23:52:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:52:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:52:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 23:52:36,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46462264150943394 [2024-06-27 23:52:36,900 INFO L175 Difference]: Start difference. First operand has 126 places, 238 transitions, 2405 flow. Second operand 8 states and 197 transitions. [2024-06-27 23:52:36,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 281 transitions, 3223 flow [2024-06-27 23:52:37,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 281 transitions, 3152 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 23:52:37,136 INFO L231 Difference]: Finished difference. Result has 129 places, 242 transitions, 2552 flow [2024-06-27 23:52:37,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2552, PETRI_PLACES=129, PETRI_TRANSITIONS=242} [2024-06-27 23:52:37,142 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 73 predicate places. [2024-06-27 23:52:37,142 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 242 transitions, 2552 flow [2024-06-27 23:52:37,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-06-27 23:52:37,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:52:37,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:52:37,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:52:37,142 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:52:37,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:52:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1619464336, now seen corresponding path program 1 times [2024-06-27 23:52:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:52:37,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457202596] [2024-06-27 23:52:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:52:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:52:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457202596] [2024-06-27 23:52:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457202596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:52:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935025147] [2024-06-27 23:52:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:39,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:52:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:52:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:52:39,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:52:39,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 242 transitions, 2552 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-06-27 23:52:39,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:39,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:52:39,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:52:43,894 INFO L124 PetriNetUnfolderBase]: 17179/23525 cut-off events. [2024-06-27 23:52:43,897 INFO L125 PetriNetUnfolderBase]: For 429294/429303 co-relation queries the response was YES. [2024-06-27 23:52:44,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132420 conditions, 23525 events. 17179/23525 cut-off events. For 429294/429303 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 126141 event pairs, 7880 based on Foata normal form. 11/23362 useless extension candidates. Maximal degree in co-relation 132368. Up to 22856 conditions per place. [2024-06-27 23:52:44,105 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 239 selfloop transitions, 55 changer transitions 0/299 dead transitions. [2024-06-27 23:52:44,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 299 transitions, 3678 flow [2024-06-27 23:52:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:52:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:52:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-27 23:52:44,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4386792452830189 [2024-06-27 23:52:44,107 INFO L175 Difference]: Start difference. First operand has 129 places, 242 transitions, 2552 flow. Second operand 8 states and 186 transitions. [2024-06-27 23:52:44,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 299 transitions, 3678 flow [2024-06-27 23:52:44,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 299 transitions, 3538 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-27 23:52:44,519 INFO L231 Difference]: Finished difference. Result has 132 places, 260 transitions, 2792 flow [2024-06-27 23:52:44,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2412, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2792, PETRI_PLACES=132, PETRI_TRANSITIONS=260} [2024-06-27 23:52:44,519 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 76 predicate places. [2024-06-27 23:52:44,519 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 260 transitions, 2792 flow [2024-06-27 23:52:44,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-06-27 23:52:44,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:52:44,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:52:44,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:52:44,520 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:52:44,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:52:44,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2021430164, now seen corresponding path program 3 times [2024-06-27 23:52:44,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:52:44,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817618925] [2024-06-27 23:52:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:52:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:52:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:52:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:52:46,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:52:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817618925] [2024-06-27 23:52:46,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817618925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:52:46,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:52:46,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:52:46,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581960660] [2024-06-27 23:52:46,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:52:46,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:52:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:52:46,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:52:46,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:52:47,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:52:47,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 260 transitions, 2792 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 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-06-27 23:52:47,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:52:47,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:52:47,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand