./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.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/mix014_tso.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/mix014_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix014_tso.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:20:59,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:20:59,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:20:59,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:20:59,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:20:59,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:20:59,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:20:59,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:20:59,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:20:59,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:20:59,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:20:59,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:20:59,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:20:59,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:20:59,664 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:20:59,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:20:59,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:20:59,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:20:59,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:20:59,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:20:59,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:20:59,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:20:59,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:20:59,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:20:59,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:20:59,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:20:59,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:20:59,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:20:59,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:20:59,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:20:59,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:20:59,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:20:59,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:20:59,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:20:59,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:20:59,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:20:59,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:20:59,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:20:59,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:20:59,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:20:59,671 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:20:59,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:20:59,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:20:59,671 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:20:59,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:20:59,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:20:59,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:20:59,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:20:59,923 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:20:59,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2024-06-27 23:21:00,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:21:01,178 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:21:01,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2024-06-27 23:21:01,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96961e85/ff1140ba946b402ca40331da38ce5e1f/FLAGa8c643ae1 [2024-06-27 23:21:01,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96961e85/ff1140ba946b402ca40331da38ce5e1f [2024-06-27 23:21:01,217 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:21:01,218 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:21:01,218 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/mix014_tso.oepc.yml/witness.yml [2024-06-27 23:21:01,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:21:01,292 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:21:01,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:21:01,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:21:01,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:21:01,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:21:01" (1/2) ... [2024-06-27 23:21:01,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c9a9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:21:01, skipping insertion in model container [2024-06-27 23:21:01,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:21:01" (1/2) ... [2024-06-27 23:21:01,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7dfa6c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:21:01, skipping insertion in model container [2024-06-27 23:21:01,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:21:01" (2/2) ... [2024-06-27 23:21:01,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c9a9a4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:01, skipping insertion in model container [2024-06-27 23:21:01,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:21:01" (2/2) ... [2024-06-27 23:21:01,303 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:21:01,334 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:21:01,335 INFO L97 edCorrectnessWitness]: Location invariant before [L925-L925] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )y) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:21:01,335 INFO L97 edCorrectnessWitness]: Location invariant before [L927-L927] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )y) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:21:01,336 INFO L97 edCorrectnessWitness]: Location invariant before [L929-L929] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )y) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:21:01,336 INFO L97 edCorrectnessWitness]: Location invariant before [L930-L930] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )y) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:21:01,336 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:21:01,337 INFO L106 edCorrectnessWitness]: ghost_update [L923-L923] multithreaded = 1; [2024-06-27 23:21:01,376 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:21:01,747 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:21:01,756 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:21:01,983 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:21:02,024 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:21:02,025 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02 WrapperNode [2024-06-27 23:21:02,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:21:02,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:21:02,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:21:02,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:21:02,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,100 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 265 [2024-06-27 23:21:02,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:21:02,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:21:02,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:21:02,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:21:02,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,162 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:21:02,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:21:02,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:21:02,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:21:02,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:21:02,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (1/1) ... [2024-06-27 23:21:02,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:21:02,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:21:02,266 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:21:02,268 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:21:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:21:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:21:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:21:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:21:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:21:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:21:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:21:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:21:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:21:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:21:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:21:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:21:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:21:02,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:21:02,341 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:21:02,454 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:21:02,456 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:21:03,094 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:21:03,095 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:21:03,337 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:21:03,337 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:21:03,338 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:21:03 BoogieIcfgContainer [2024-06-27 23:21:03,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:21:03,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:21:03,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:21:03,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:21:03,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:21:01" (1/4) ... [2024-06-27 23:21:03,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7335e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:21:03, skipping insertion in model container [2024-06-27 23:21:03,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:21:01" (2/4) ... [2024-06-27 23:21:03,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7335e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:21:03, skipping insertion in model container [2024-06-27 23:21:03,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:21:02" (3/4) ... [2024-06-27 23:21:03,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7335e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:21:03, skipping insertion in model container [2024-06-27 23:21:03,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:21:03" (4/4) ... [2024-06-27 23:21:03,347 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2024-06-27 23:21:03,361 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:21:03,362 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:21:03,362 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:21:03,425 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:21:03,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:21:03,489 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 23:21:03,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:21:03,492 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 5. Compared 93 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:21:03,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:21:03,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-27 23:21:03,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:21:03,513 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;@a7080d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:21:03,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:21:03,518 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:21:03,518 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:21:03,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:21:03,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:03,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:21:03,520 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:21:03,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 594913301, now seen corresponding path program 1 times [2024-06-27 23:21:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459565471] [2024-06-27 23:21:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:03,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:05,844 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:21:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:05,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459565471] [2024-06-27 23:21:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459565471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:05,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:21:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587412794] [2024-06-27 23:21:05,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:05,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:21:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:21:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:21:05,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:21:05,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:21:05,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:05,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:21:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:09,048 INFO L124 PetriNetUnfolderBase]: 11702/16708 cut-off events. [2024-06-27 23:21:09,048 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-06-27 23:21:09,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33113 conditions, 16708 events. 11702/16708 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 96509 event pairs, 9106 based on Foata normal form. 1/16159 useless extension candidates. Maximal degree in co-relation 33100. Up to 15870 conditions per place. [2024-06-27 23:21:09,147 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 44 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 23:21:09,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 233 flow [2024-06-27 23:21:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:21:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:21:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-06-27 23:21:09,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5974842767295597 [2024-06-27 23:21:09,158 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 95 transitions. [2024-06-27 23:21:09,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 233 flow [2024-06-27 23:21:09,162 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:21:09,167 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-27 23:21:09,168 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:21:09,172 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-27 23:21:09,172 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-27 23:21:09,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:21:09,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:09,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:09,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:21:09,173 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:21:09,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 481953016, now seen corresponding path program 1 times [2024-06-27 23:21:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938442087] [2024-06-27 23:21:09,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:11,070 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:21:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938442087] [2024-06-27 23:21:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938442087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:21:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637576098] [2024-06-27 23:21:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:11,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:21:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:21:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:21:11,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:21:11,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:21:11,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:11,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:21:11,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:14,382 INFO L124 PetriNetUnfolderBase]: 13681/18977 cut-off events. [2024-06-27 23:21:14,382 INFO L125 PetriNetUnfolderBase]: For 3323/3323 co-relation queries the response was YES. [2024-06-27 23:21:14,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42546 conditions, 18977 events. 13681/18977 cut-off events. For 3323/3323 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 105559 event pairs, 9847 based on Foata normal form. 4/18896 useless extension candidates. Maximal degree in co-relation 42534. Up to 18454 conditions per place. [2024-06-27 23:21:14,454 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-27 23:21:14,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 327 flow [2024-06-27 23:21:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:21:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:21:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-06-27 23:21:14,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2024-06-27 23:21:14,458 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 120 transitions. [2024-06-27 23:21:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 327 flow [2024-06-27 23:21:14,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:21:14,462 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-27 23:21:14,462 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:21:14,463 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-27 23:21:14,463 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-27 23:21:14,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:21:14,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:14,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:14,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:21:14,466 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:21:14,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2055643426, now seen corresponding path program 1 times [2024-06-27 23:21:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371347023] [2024-06-27 23:21:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:16,330 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:21:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371347023] [2024-06-27 23:21:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371347023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:16,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:16,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:21:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692049281] [2024-06-27 23:21:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:16,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:21:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:16,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:21:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:21:16,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:21:16,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:21:16,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:16,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:21:16,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:19,223 INFO L124 PetriNetUnfolderBase]: 13661/18945 cut-off events. [2024-06-27 23:21:19,223 INFO L125 PetriNetUnfolderBase]: For 9431/9431 co-relation queries the response was YES. [2024-06-27 23:21:19,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46993 conditions, 18945 events. 13661/18945 cut-off events. For 9431/9431 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 105295 event pairs, 8023 based on Foata normal form. 8/18872 useless extension candidates. Maximal degree in co-relation 46979. Up to 18384 conditions per place. [2024-06-27 23:21:19,308 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 66 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2024-06-27 23:21:19,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 439 flow [2024-06-27 23:21:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:21:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:21:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-06-27 23:21:19,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584905660377358 [2024-06-27 23:21:19,310 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 148 transitions. [2024-06-27 23:21:19,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 439 flow [2024-06-27 23:21:19,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 420 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:21:19,313 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 229 flow [2024-06-27 23:21:19,313 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-06-27 23:21:19,314 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2024-06-27 23:21:19,314 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 229 flow [2024-06-27 23:21:19,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:21:19,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:19,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:19,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:21:19,315 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:21:19,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash -207996699, now seen corresponding path program 1 times [2024-06-27 23:21:19,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:19,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111690510] [2024-06-27 23:21:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:22,598 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:21:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111690510] [2024-06-27 23:21:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111690510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:21:22,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788104275] [2024-06-27 23:21:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:22,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:21:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:21:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:21:22,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:21:22,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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:21:22,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:22,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:21:22,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:25,926 INFO L124 PetriNetUnfolderBase]: 13645/18917 cut-off events. [2024-06-27 23:21:25,926 INFO L125 PetriNetUnfolderBase]: For 18206/18206 co-relation queries the response was YES. [2024-06-27 23:21:25,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51403 conditions, 18917 events. 13645/18917 cut-off events. For 18206/18206 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 105189 event pairs, 6990 based on Foata normal form. 8/18848 useless extension candidates. Maximal degree in co-relation 51388. Up to 18318 conditions per place. [2024-06-27 23:21:26,034 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 73 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-27 23:21:26,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 523 flow [2024-06-27 23:21:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:21:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:21:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-06-27 23:21:26,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377358490566038 [2024-06-27 23:21:26,038 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 229 flow. Second operand 6 states and 171 transitions. [2024-06-27 23:21:26,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 523 flow [2024-06-27 23:21:26,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 490 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 23:21:26,047 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 260 flow [2024-06-27 23:21:26,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-06-27 23:21:26,049 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 23:21:26,049 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 260 flow [2024-06-27 23:21:26,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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:21:26,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:26,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:26,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:21:26,051 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:21:26,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1242635156, now seen corresponding path program 1 times [2024-06-27 23:21:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:26,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321753064] [2024-06-27 23:21:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:28,534 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:21:28,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:28,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321753064] [2024-06-27 23:21:28,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321753064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:28,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:28,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:21:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903261124] [2024-06-27 23:21:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:28,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:21:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:28,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:21:28,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:21:28,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:21:28,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 260 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:21:28,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:28,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:21:28,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:31,395 INFO L124 PetriNetUnfolderBase]: 11647/16318 cut-off events. [2024-06-27 23:21:31,395 INFO L125 PetriNetUnfolderBase]: For 26208/26208 co-relation queries the response was YES. [2024-06-27 23:21:31,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47746 conditions, 16318 events. 11647/16318 cut-off events. For 26208/26208 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 92047 event pairs, 8596 based on Foata normal form. 3/15963 useless extension candidates. Maximal degree in co-relation 47729. Up to 15777 conditions per place. [2024-06-27 23:21:31,458 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 60 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2024-06-27 23:21:31,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 482 flow [2024-06-27 23:21:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:21:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:21:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-27 23:21:31,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276729559748428 [2024-06-27 23:21:31,460 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 260 flow. Second operand 6 states and 136 transitions. [2024-06-27 23:21:31,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 482 flow [2024-06-27 23:21:31,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 434 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 23:21:31,464 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 296 flow [2024-06-27 23:21:31,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-27 23:21:31,465 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-06-27 23:21:31,465 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 296 flow [2024-06-27 23:21:31,466 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:21:31,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:31,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:31,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:21:31,466 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:21:31,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:31,466 INFO L85 PathProgramCache]: Analyzing trace with hash 173235772, now seen corresponding path program 1 times [2024-06-27 23:21:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:31,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866348669] [2024-06-27 23:21:31,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:31,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:35,041 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:21:35,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866348669] [2024-06-27 23:21:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866348669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:21:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015387680] [2024-06-27 23:21:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:35,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:21:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:21:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:21:35,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:21:35,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 296 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:21:35,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:35,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:21:35,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:37,909 INFO L124 PetriNetUnfolderBase]: 11620/16269 cut-off events. [2024-06-27 23:21:37,909 INFO L125 PetriNetUnfolderBase]: For 37428/37428 co-relation queries the response was YES. [2024-06-27 23:21:37,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51328 conditions, 16269 events. 11620/16269 cut-off events. For 37428/37428 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 92084 event pairs, 8278 based on Foata normal form. 9/15983 useless extension candidates. Maximal degree in co-relation 51308. Up to 15696 conditions per place. [2024-06-27 23:21:38,008 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 69 selfloop transitions, 16 changer transitions 0/92 dead transitions. [2024-06-27 23:21:38,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 562 flow [2024-06-27 23:21:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:21:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:21:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-27 23:21:38,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46855345911949686 [2024-06-27 23:21:38,010 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 296 flow. Second operand 6 states and 149 transitions. [2024-06-27 23:21:38,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 562 flow [2024-06-27 23:21:38,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 527 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 23:21:38,016 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 344 flow [2024-06-27 23:21:38,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-06-27 23:21:38,017 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-06-27 23:21:38,017 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 344 flow [2024-06-27 23:21:38,017 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:21:38,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:38,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:38,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:21:38,018 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:21:38,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1752469579, now seen corresponding path program 1 times [2024-06-27 23:21:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488865660] [2024-06-27 23:21:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:38,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:40,232 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:21:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488865660] [2024-06-27 23:21:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488865660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:21:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482683423] [2024-06-27 23:21:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:40,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:21:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:21:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:21:40,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:21:40,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:21:40,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:40,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:21:40,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:43,587 INFO L124 PetriNetUnfolderBase]: 13654/18830 cut-off events. [2024-06-27 23:21:43,588 INFO L125 PetriNetUnfolderBase]: For 60000/60000 co-relation queries the response was YES. [2024-06-27 23:21:43,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63653 conditions, 18830 events. 13654/18830 cut-off events. For 60000/60000 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 104482 event pairs, 9429 based on Foata normal form. 3/18734 useless extension candidates. Maximal degree in co-relation 63632. Up to 18393 conditions per place. [2024-06-27 23:21:43,680 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 81 selfloop transitions, 22 changer transitions 0/109 dead transitions. [2024-06-27 23:21:43,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 109 transitions, 696 flow [2024-06-27 23:21:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:21:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:21:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 23:21:43,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4501347708894879 [2024-06-27 23:21:43,682 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 344 flow. Second operand 7 states and 167 transitions. [2024-06-27 23:21:43,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 109 transitions, 696 flow [2024-06-27 23:21:43,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 645 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 23:21:43,690 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 433 flow [2024-06-27 23:21:43,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=293, 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=7, PETRI_FLOW=433, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2024-06-27 23:21:43,691 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2024-06-27 23:21:43,691 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 433 flow [2024-06-27 23:21:43,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:21:43,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:43,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:43,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:21:43,692 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:21:43,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1075128435, now seen corresponding path program 2 times [2024-06-27 23:21:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224214654] [2024-06-27 23:21:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:46,265 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:21:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:46,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224214654] [2024-06-27 23:21:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224214654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:46,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:46,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:21:46,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826483500] [2024-06-27 23:21:46,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:46,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:21:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:21:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:21:46,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:21:46,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:21:46,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:46,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:21:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:49,717 INFO L124 PetriNetUnfolderBase]: 13712/18910 cut-off events. [2024-06-27 23:21:49,717 INFO L125 PetriNetUnfolderBase]: For 79544/79544 co-relation queries the response was YES. [2024-06-27 23:21:49,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68606 conditions, 18910 events. 13712/18910 cut-off events. For 79544/79544 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 104879 event pairs, 9430 based on Foata normal form. 3/18813 useless extension candidates. Maximal degree in co-relation 68583. Up to 18455 conditions per place. [2024-06-27 23:21:49,816 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 79 selfloop transitions, 29 changer transitions 0/114 dead transitions. [2024-06-27 23:21:49,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 849 flow [2024-06-27 23:21:49,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:21:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:21:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 23:21:49,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42048517520215634 [2024-06-27 23:21:49,817 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 433 flow. Second operand 7 states and 156 transitions. [2024-06-27 23:21:49,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 849 flow [2024-06-27 23:21:49,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 745 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-27 23:21:49,831 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 547 flow [2024-06-27 23:21:49,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=547, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2024-06-27 23:21:49,832 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2024-06-27 23:21:49,832 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 547 flow [2024-06-27 23:21:49,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:21:49,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:49,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:49,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:21:49,833 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:21:49,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash -171417525, now seen corresponding path program 3 times [2024-06-27 23:21:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316991798] [2024-06-27 23:21:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:52,631 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:21:52,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:52,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316991798] [2024-06-27 23:21:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316991798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:52,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:21:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765604456] [2024-06-27 23:21:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:52,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:21:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:21:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:21:52,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:21:52,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:21:52,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:52,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:21:52,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:21:55,941 INFO L124 PetriNetUnfolderBase]: 13703/18906 cut-off events. [2024-06-27 23:21:55,941 INFO L125 PetriNetUnfolderBase]: For 102149/102149 co-relation queries the response was YES. [2024-06-27 23:21:55,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72887 conditions, 18906 events. 13703/18906 cut-off events. For 102149/102149 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 104875 event pairs, 9436 based on Foata normal form. 3/18809 useless extension candidates. Maximal degree in co-relation 72863. Up to 18398 conditions per place. [2024-06-27 23:21:56,044 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 72 selfloop transitions, 40 changer transitions 0/118 dead transitions. [2024-06-27 23:21:56,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 118 transitions, 895 flow [2024-06-27 23:21:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:21:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:21:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 23:21:56,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42048517520215634 [2024-06-27 23:21:56,047 INFO L175 Difference]: Start difference. First operand has 76 places, 91 transitions, 547 flow. Second operand 7 states and 156 transitions. [2024-06-27 23:21:56,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 118 transitions, 895 flow [2024-06-27 23:21:56,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 118 transitions, 842 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 23:21:56,062 INFO L231 Difference]: Finished difference. Result has 81 places, 95 transitions, 645 flow [2024-06-27 23:21:56,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=645, PETRI_PLACES=81, PETRI_TRANSITIONS=95} [2024-06-27 23:21:56,063 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2024-06-27 23:21:56,063 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 95 transitions, 645 flow [2024-06-27 23:21:56,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:21:56,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:21:56,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:21:56,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:21:56,064 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:21:56,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:21:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1512439681, now seen corresponding path program 1 times [2024-06-27 23:21:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:21:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11909289] [2024-06-27 23:21:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:21:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:21:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:21:58,221 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:21:58,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:21:58,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11909289] [2024-06-27 23:21:58,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11909289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:21:58,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:21:58,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:21:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832309788] [2024-06-27 23:21:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:21:58,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:21:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:21:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:21:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:21:58,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:21:58,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 95 transitions, 645 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:21:58,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:21:58,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:21:58,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:01,563 INFO L124 PetriNetUnfolderBase]: 13748/19118 cut-off events. [2024-06-27 23:22:01,563 INFO L125 PetriNetUnfolderBase]: For 121507/121523 co-relation queries the response was YES. [2024-06-27 23:22:01,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77698 conditions, 19118 events. 13748/19118 cut-off events. For 121507/121523 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 106678 event pairs, 7532 based on Foata normal form. 19/19033 useless extension candidates. Maximal degree in co-relation 77672. Up to 18442 conditions per place. [2024-06-27 23:22:01,682 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 106 selfloop transitions, 39 changer transitions 0/151 dead transitions. [2024-06-27 23:22:01,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 151 transitions, 1159 flow [2024-06-27 23:22:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:22:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:22:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 23:22:01,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455188679245283 [2024-06-27 23:22:01,684 INFO L175 Difference]: Start difference. First operand has 81 places, 95 transitions, 645 flow. Second operand 8 states and 193 transitions. [2024-06-27 23:22:01,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 151 transitions, 1159 flow [2024-06-27 23:22:01,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 151 transitions, 1040 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-27 23:22:01,705 INFO L231 Difference]: Finished difference. Result has 85 places, 110 transitions, 734 flow [2024-06-27 23:22:01,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=734, PETRI_PLACES=85, PETRI_TRANSITIONS=110} [2024-06-27 23:22:01,706 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2024-06-27 23:22:01,706 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 110 transitions, 734 flow [2024-06-27 23:22:01,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:01,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:01,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:01,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:22:01,706 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:22:01,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1549679991, now seen corresponding path program 2 times [2024-06-27 23:22:01,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:01,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552843531] [2024-06-27 23:22:01,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:04,260 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:22:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552843531] [2024-06-27 23:22:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552843531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:22:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769135641] [2024-06-27 23:22:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:04,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:22:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:22:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:22:04,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:04,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 110 transitions, 734 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:04,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:04,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:04,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:08,005 INFO L124 PetriNetUnfolderBase]: 13852/19312 cut-off events. [2024-06-27 23:22:08,005 INFO L125 PetriNetUnfolderBase]: For 145500/145520 co-relation queries the response was YES. [2024-06-27 23:22:08,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83064 conditions, 19312 events. 13852/19312 cut-off events. For 145500/145520 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 108007 event pairs, 7228 based on Foata normal form. 23/19250 useless extension candidates. Maximal degree in co-relation 83036. Up to 18537 conditions per place. [2024-06-27 23:22:08,104 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 110 selfloop transitions, 57 changer transitions 0/173 dead transitions. [2024-06-27 23:22:08,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 173 transitions, 1433 flow [2024-06-27 23:22:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:22:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:22:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 23:22:08,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45754716981132076 [2024-06-27 23:22:08,106 INFO L175 Difference]: Start difference. First operand has 85 places, 110 transitions, 734 flow. Second operand 8 states and 194 transitions. [2024-06-27 23:22:08,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 173 transitions, 1433 flow [2024-06-27 23:22:08,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 173 transitions, 1325 flow, removed 50 selfloop flow, removed 2 redundant places. [2024-06-27 23:22:08,129 INFO L231 Difference]: Finished difference. Result has 93 places, 135 transitions, 1050 flow [2024-06-27 23:22:08,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1050, PETRI_PLACES=93, PETRI_TRANSITIONS=135} [2024-06-27 23:22:08,130 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2024-06-27 23:22:08,130 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 135 transitions, 1050 flow [2024-06-27 23:22:08,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:08,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:08,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:08,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:22:08,130 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:22:08,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1549560021, now seen corresponding path program 3 times [2024-06-27 23:22:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671212418] [2024-06-27 23:22:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:11,110 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:22:11,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:11,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671212418] [2024-06-27 23:22:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671212418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:22:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452163428] [2024-06-27 23:22:11,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:11,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:22:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:22:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:22:11,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:11,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 135 transitions, 1050 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:11,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:11,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:11,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:14,840 INFO L124 PetriNetUnfolderBase]: 13905/19334 cut-off events. [2024-06-27 23:22:14,840 INFO L125 PetriNetUnfolderBase]: For 178233/178241 co-relation queries the response was YES. [2024-06-27 23:22:14,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88446 conditions, 19334 events. 13905/19334 cut-off events. For 178233/178241 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 107919 event pairs, 7106 based on Foata normal form. 11/19265 useless extension candidates. Maximal degree in co-relation 88414. Up to 18499 conditions per place. [2024-06-27 23:22:14,938 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 108 selfloop transitions, 70 changer transitions 0/184 dead transitions. [2024-06-27 23:22:14,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 184 transitions, 1762 flow [2024-06-27 23:22:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:22:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:22:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-27 23:22:14,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669811320754717 [2024-06-27 23:22:14,939 INFO L175 Difference]: Start difference. First operand has 93 places, 135 transitions, 1050 flow. Second operand 8 states and 198 transitions. [2024-06-27 23:22:14,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 184 transitions, 1762 flow [2024-06-27 23:22:14,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 184 transitions, 1647 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-27 23:22:14,968 INFO L231 Difference]: Finished difference. Result has 99 places, 143 transitions, 1275 flow [2024-06-27 23:22:14,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1275, PETRI_PLACES=99, PETRI_TRANSITIONS=143} [2024-06-27 23:22:14,969 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2024-06-27 23:22:14,969 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 143 transitions, 1275 flow [2024-06-27 23:22:14,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:14,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:14,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:14,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:22:14,970 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:22:14,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1549559835, now seen corresponding path program 1 times [2024-06-27 23:22:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649697354] [2024-06-27 23:22:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:18,180 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:22:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:18,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649697354] [2024-06-27 23:22:18,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649697354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:18,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:18,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:22:18,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355402703] [2024-06-27 23:22:18,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:18,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:22:18,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:18,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:22:18,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:22:18,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:18,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 143 transitions, 1275 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:18,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:18,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:18,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:21,923 INFO L124 PetriNetUnfolderBase]: 13971/19233 cut-off events. [2024-06-27 23:22:21,923 INFO L125 PetriNetUnfolderBase]: For 230091/230099 co-relation queries the response was YES. [2024-06-27 23:22:21,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93885 conditions, 19233 events. 13971/19233 cut-off events. For 230091/230099 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 106303 event pairs, 8264 based on Foata normal form. 17/19189 useless extension candidates. Maximal degree in co-relation 93851. Up to 18758 conditions per place. [2024-06-27 23:22:22,065 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 146 selfloop transitions, 35 changer transitions 0/187 dead transitions. [2024-06-27 23:22:22,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 187 transitions, 1841 flow [2024-06-27 23:22:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:22:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:22:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 23:22:22,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45047169811320753 [2024-06-27 23:22:22,066 INFO L175 Difference]: Start difference. First operand has 99 places, 143 transitions, 1275 flow. Second operand 8 states and 191 transitions. [2024-06-27 23:22:22,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 187 transitions, 1841 flow [2024-06-27 23:22:22,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 187 transitions, 1724 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-27 23:22:22,134 INFO L231 Difference]: Finished difference. Result has 103 places, 147 transitions, 1314 flow [2024-06-27 23:22:22,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1314, PETRI_PLACES=103, PETRI_TRANSITIONS=147} [2024-06-27 23:22:22,135 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 47 predicate places. [2024-06-27 23:22:22,135 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 147 transitions, 1314 flow [2024-06-27 23:22:22,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:22,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:22,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:22,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:22:22,136 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:22:22,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:22,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1196225561, now seen corresponding path program 4 times [2024-06-27 23:22:22,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:22,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514200698] [2024-06-27 23:22:22,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:25,027 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:22:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:25,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514200698] [2024-06-27 23:22:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514200698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:22:25,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93854455] [2024-06-27 23:22:25,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:25,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:22:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:22:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:22:25,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:25,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 147 transitions, 1314 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:25,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:25,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:25,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:29,027 INFO L124 PetriNetUnfolderBase]: 14103/19615 cut-off events. [2024-06-27 23:22:29,027 INFO L125 PetriNetUnfolderBase]: For 246819/246831 co-relation queries the response was YES. [2024-06-27 23:22:29,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99568 conditions, 19615 events. 14103/19615 cut-off events. For 246819/246831 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 108968 event pairs, 6955 based on Foata normal form. 15/19545 useless extension candidates. Maximal degree in co-relation 99532. Up to 18827 conditions per place. [2024-06-27 23:22:29,167 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 131 selfloop transitions, 75 changer transitions 0/212 dead transitions. [2024-06-27 23:22:29,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 212 transitions, 2190 flow [2024-06-27 23:22:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:22:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:22:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-27 23:22:29,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4339622641509434 [2024-06-27 23:22:29,168 INFO L175 Difference]: Start difference. First operand has 103 places, 147 transitions, 1314 flow. Second operand 8 states and 184 transitions. [2024-06-27 23:22:29,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 212 transitions, 2190 flow [2024-06-27 23:22:29,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 212 transitions, 2068 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-27 23:22:29,215 INFO L231 Difference]: Finished difference. Result has 106 places, 181 transitions, 1777 flow [2024-06-27 23:22:29,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1777, PETRI_PLACES=106, PETRI_TRANSITIONS=181} [2024-06-27 23:22:29,216 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2024-06-27 23:22:29,216 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 181 transitions, 1777 flow [2024-06-27 23:22:29,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:29,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:29,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:29,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:22:29,217 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:22:29,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1773950841, now seen corresponding path program 2 times [2024-06-27 23:22:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853316776] [2024-06-27 23:22:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:32,877 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:22:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853316776] [2024-06-27 23:22:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853316776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:22:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700200959] [2024-06-27 23:22:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:32,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:22:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:32,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:22:32,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:22:33,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:33,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 181 transitions, 1777 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:33,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:33,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:33,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:36,969 INFO L124 PetriNetUnfolderBase]: 14223/19607 cut-off events. [2024-06-27 23:22:36,969 INFO L125 PetriNetUnfolderBase]: For 307866/307878 co-relation queries the response was YES. [2024-06-27 23:22:37,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104660 conditions, 19607 events. 14223/19607 cut-off events. For 307866/307878 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 108296 event pairs, 8248 based on Foata normal form. 21/19573 useless extension candidates. Maximal degree in co-relation 104622. Up to 19069 conditions per place. [2024-06-27 23:22:37,109 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 178 selfloop transitions, 37 changer transitions 0/221 dead transitions. [2024-06-27 23:22:37,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 221 transitions, 2413 flow [2024-06-27 23:22:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:22:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:22:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-27 23:22:37,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555256064690027 [2024-06-27 23:22:37,110 INFO L175 Difference]: Start difference. First operand has 106 places, 181 transitions, 1777 flow. Second operand 7 states and 169 transitions. [2024-06-27 23:22:37,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 221 transitions, 2413 flow [2024-06-27 23:22:37,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 221 transitions, 2302 flow, removed 25 selfloop flow, removed 2 redundant places. [2024-06-27 23:22:37,216 INFO L231 Difference]: Finished difference. Result has 111 places, 189 transitions, 1866 flow [2024-06-27 23:22:37,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1866, PETRI_PLACES=111, PETRI_TRANSITIONS=189} [2024-06-27 23:22:37,217 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 55 predicate places. [2024-06-27 23:22:37,217 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 189 transitions, 1866 flow [2024-06-27 23:22:37,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:37,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:37,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:37,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:22:37,217 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:22:37,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1093826479, now seen corresponding path program 5 times [2024-06-27 23:22:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242272501] [2024-06-27 23:22:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:40,973 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:22:40,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:40,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242272501] [2024-06-27 23:22:40,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242272501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:40,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:40,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:22:40,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529153056] [2024-06-27 23:22:40,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:40,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:22:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:22:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:22:41,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:41,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 189 transitions, 1866 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:41,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:41,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:41,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:45,228 INFO L124 PetriNetUnfolderBase]: 14319/19907 cut-off events. [2024-06-27 23:22:45,229 INFO L125 PetriNetUnfolderBase]: For 329139/329147 co-relation queries the response was YES. [2024-06-27 23:22:45,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110294 conditions, 19907 events. 14319/19907 cut-off events. For 329139/329147 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 110413 event pairs, 6978 based on Foata normal form. 11/19833 useless extension candidates. Maximal degree in co-relation 110254. Up to 18998 conditions per place. [2024-06-27 23:22:45,343 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 144 selfloop transitions, 89 changer transitions 0/239 dead transitions. [2024-06-27 23:22:45,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 239 transitions, 2822 flow [2024-06-27 23:22:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:22:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:22:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 23:22:45,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44575471698113206 [2024-06-27 23:22:45,348 INFO L175 Difference]: Start difference. First operand has 111 places, 189 transitions, 1866 flow. Second operand 8 states and 189 transitions. [2024-06-27 23:22:45,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 239 transitions, 2822 flow [2024-06-27 23:22:45,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 239 transitions, 2696 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-27 23:22:45,422 INFO L231 Difference]: Finished difference. Result has 115 places, 205 transitions, 2277 flow [2024-06-27 23:22:45,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2277, PETRI_PLACES=115, PETRI_TRANSITIONS=205} [2024-06-27 23:22:45,422 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 59 predicate places. [2024-06-27 23:22:45,422 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 205 transitions, 2277 flow [2024-06-27 23:22:45,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:22:45,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:45,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:45,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:22:45,423 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:22:45,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1024088549, now seen corresponding path program 3 times [2024-06-27 23:22:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367001550] [2024-06-27 23:22:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:49,951 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:22:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:49,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367001550] [2024-06-27 23:22:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367001550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:49,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:49,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:22:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842213690] [2024-06-27 23:22:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:49,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:22:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:22:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:22:50,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:50,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 205 transitions, 2277 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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:22:50,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:50,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:50,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:22:54,490 INFO L124 PetriNetUnfolderBase]: 14385/19787 cut-off events. [2024-06-27 23:22:54,491 INFO L125 PetriNetUnfolderBase]: For 406492/406512 co-relation queries the response was YES. [2024-06-27 23:22:54,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116032 conditions, 19787 events. 14385/19787 cut-off events. For 406492/406512 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 108808 event pairs, 7833 based on Foata normal form. 29/19749 useless extension candidates. Maximal degree in co-relation 115990. Up to 19032 conditions per place. [2024-06-27 23:22:54,622 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 181 selfloop transitions, 63 changer transitions 0/250 dead transitions. [2024-06-27 23:22:54,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 250 transitions, 3165 flow [2024-06-27 23:22:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:22:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:22:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-27 23:22:54,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4386792452830189 [2024-06-27 23:22:54,623 INFO L175 Difference]: Start difference. First operand has 115 places, 205 transitions, 2277 flow. Second operand 8 states and 186 transitions. [2024-06-27 23:22:54,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 250 transitions, 3165 flow [2024-06-27 23:22:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 250 transitions, 3030 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-06-27 23:22:54,739 INFO L231 Difference]: Finished difference. Result has 119 places, 213 transitions, 2467 flow [2024-06-27 23:22:54,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2467, PETRI_PLACES=119, PETRI_TRANSITIONS=213} [2024-06-27 23:22:54,740 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2024-06-27 23:22:54,740 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 213 transitions, 2467 flow [2024-06-27 23:22:54,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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:22:54,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:22:54,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:22:54,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:22:54,740 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:22:54,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:22:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1018973885, now seen corresponding path program 4 times [2024-06-27 23:22:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:22:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749567757] [2024-06-27 23:22:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:22:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:22:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:22:59,291 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:22:59,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:22:59,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749567757] [2024-06-27 23:22:59,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749567757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:22:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:22:59,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:22:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697557608] [2024-06-27 23:22:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:22:59,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:22:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:22:59,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:22:59,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:22:59,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:22:59,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 213 transitions, 2467 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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:22:59,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:22:59,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:22:59,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:23:03,837 INFO L124 PetriNetUnfolderBase]: 14358/19754 cut-off events. [2024-06-27 23:23:03,837 INFO L125 PetriNetUnfolderBase]: For 451531/451551 co-relation queries the response was YES. [2024-06-27 23:23:03,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120272 conditions, 19754 events. 14358/19754 cut-off events. For 451531/451551 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 108876 event pairs, 8255 based on Foata normal form. 29/19715 useless extension candidates. Maximal degree in co-relation 120228. Up to 19240 conditions per place. [2024-06-27 23:23:03,973 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 195 selfloop transitions, 44 changer transitions 0/245 dead transitions. [2024-06-27 23:23:03,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 245 transitions, 3059 flow [2024-06-27 23:23:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:23:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:23:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-06-27 23:23:03,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42452830188679247 [2024-06-27 23:23:03,976 INFO L175 Difference]: Start difference. First operand has 119 places, 213 transitions, 2467 flow. Second operand 8 states and 180 transitions. [2024-06-27 23:23:03,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 245 transitions, 3059 flow [2024-06-27 23:23:04,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 245 transitions, 2871 flow, removed 71 selfloop flow, removed 4 redundant places. [2024-06-27 23:23:04,234 INFO L231 Difference]: Finished difference. Result has 123 places, 213 transitions, 2378 flow [2024-06-27 23:23:04,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2279, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2378, PETRI_PLACES=123, PETRI_TRANSITIONS=213} [2024-06-27 23:23:04,234 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 67 predicate places. [2024-06-27 23:23:04,234 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 213 transitions, 2378 flow [2024-06-27 23:23:04,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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:23:04,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:23:04,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:23:04,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:23:04,235 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:23:04,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:23:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1018974071, now seen corresponding path program 6 times [2024-06-27 23:23:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:23:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367326314] [2024-06-27 23:23:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:23:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:23:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:23:08,119 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:23:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:23:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367326314] [2024-06-27 23:23:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367326314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:23:08,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:23:08,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:23:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095202971] [2024-06-27 23:23:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:23:08,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:23:08,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:23:08,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:23:08,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:23:08,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:23:08,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 213 transitions, 2378 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:23:08,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:23:08,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:23:08,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:23:12,503 INFO L124 PetriNetUnfolderBase]: 14349/19941 cut-off events. [2024-06-27 23:23:12,503 INFO L125 PetriNetUnfolderBase]: For 437356/437364 co-relation queries the response was YES. [2024-06-27 23:23:12,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121178 conditions, 19941 events. 14349/19941 cut-off events. For 437356/437364 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 110898 event pairs, 6981 based on Foata normal form. 11/19916 useless extension candidates. Maximal degree in co-relation 121132. Up to 18858 conditions per place. [2024-06-27 23:23:12,644 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 132 selfloop transitions, 119 changer transitions 0/257 dead transitions. [2024-06-27 23:23:12,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 257 transitions, 3422 flow [2024-06-27 23:23:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:23:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:23:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 23:23:12,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45047169811320753 [2024-06-27 23:23:12,647 INFO L175 Difference]: Start difference. First operand has 123 places, 213 transitions, 2378 flow. Second operand 8 states and 191 transitions. [2024-06-27 23:23:12,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 257 transitions, 3422 flow [2024-06-27 23:23:12,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 257 transitions, 3292 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 23:23:12,808 INFO L231 Difference]: Finished difference. Result has 125 places, 221 transitions, 2721 flow [2024-06-27 23:23:12,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2721, PETRI_PLACES=125, PETRI_TRANSITIONS=221} [2024-06-27 23:23:12,808 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 69 predicate places. [2024-06-27 23:23:12,808 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 221 transitions, 2721 flow [2024-06-27 23:23:12,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:23:12,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:23:12,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:23:12,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:23:12,817 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:23:12,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:23:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1977879596, now seen corresponding path program 1 times [2024-06-27 23:23:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:23:12,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010086044] [2024-06-27 23:23:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:23:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:23:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:23:15,285 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:23:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:23:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010086044] [2024-06-27 23:23:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010086044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:23:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:23:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:23:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376043373] [2024-06-27 23:23:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:23:15,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:23:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:23:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:23:15,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:23:15,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:23:15,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 221 transitions, 2721 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:23:15,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:23:15,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:23:15,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:23:18,814 INFO L124 PetriNetUnfolderBase]: 12353/17371 cut-off events. [2024-06-27 23:23:18,815 INFO L125 PetriNetUnfolderBase]: For 443211/443211 co-relation queries the response was YES. [2024-06-27 23:23:18,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111250 conditions, 17371 events. 12353/17371 cut-off events. For 443211/443211 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 98712 event pairs, 7354 based on Foata normal form. 2/17174 useless extension candidates. Maximal degree in co-relation 111202. Up to 16741 conditions per place. [2024-06-27 23:23:18,966 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 219 selfloop transitions, 12 changer transitions 0/238 dead transitions. [2024-06-27 23:23:18,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 238 transitions, 3287 flow [2024-06-27 23:23:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:23:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:23:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-27 23:23:18,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2024-06-27 23:23:18,967 INFO L175 Difference]: Start difference. First operand has 125 places, 221 transitions, 2721 flow. Second operand 5 states and 120 transitions. [2024-06-27 23:23:18,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 238 transitions, 3287 flow [2024-06-27 23:23:19,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 238 transitions, 2962 flow, removed 64 selfloop flow, removed 5 redundant places. [2024-06-27 23:23:19,283 INFO L231 Difference]: Finished difference. Result has 125 places, 225 transitions, 2495 flow [2024-06-27 23:23:19,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2400, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2495, PETRI_PLACES=125, PETRI_TRANSITIONS=225} [2024-06-27 23:23:19,283 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 69 predicate places. [2024-06-27 23:23:19,283 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 225 transitions, 2495 flow [2024-06-27 23:23:19,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:23:19,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:23:19,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:23:19,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:23:19,284 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:23:19,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:23:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1231588940, now seen corresponding path program 1 times [2024-06-27 23:23:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:23:19,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034982969] [2024-06-27 23:23:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:23:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:23:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:23:21,970 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:23:21,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:23:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034982969] [2024-06-27 23:23:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034982969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:23:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:23:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:23:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307950405] [2024-06-27 23:23:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:23:21,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:23:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:23:21,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:23:21,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:23:22,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:23:22,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 225 transitions, 2495 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:23:22,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:23:22,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:23:22,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:23:26,646 INFO L124 PetriNetUnfolderBase]: 14423/19928 cut-off events. [2024-06-27 23:23:26,646 INFO L125 PetriNetUnfolderBase]: For 509642/509654 co-relation queries the response was YES. [2024-06-27 23:23:26,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126699 conditions, 19928 events. 14423/19928 cut-off events. For 509642/509654 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 110071 event pairs, 8218 based on Foata normal form. 17/19844 useless extension candidates. Maximal degree in co-relation 126650. Up to 19199 conditions per place. [2024-06-27 23:23:26,795 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 185 selfloop transitions, 92 changer transitions 0/283 dead transitions. [2024-06-27 23:23:26,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 283 transitions, 3467 flow [2024-06-27 23:23:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:23:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:23:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-06-27 23:23:26,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45990566037735847 [2024-06-27 23:23:26,797 INFO L175 Difference]: Start difference. First operand has 125 places, 225 transitions, 2495 flow. Second operand 8 states and 195 transitions. [2024-06-27 23:23:26,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 283 transitions, 3467 flow [2024-06-27 23:23:27,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 283 transitions, 3402 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-27 23:23:27,144 INFO L231 Difference]: Finished difference. Result has 131 places, 243 transitions, 2980 flow [2024-06-27 23:23:27,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2430, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2980, PETRI_PLACES=131, PETRI_TRANSITIONS=243} [2024-06-27 23:23:27,144 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2024-06-27 23:23:27,145 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 243 transitions, 2980 flow [2024-06-27 23:23:27,145 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:23:27,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:23:27,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:23:27,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:23:27,145 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:23:27,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:23:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1566978129, now seen corresponding path program 1 times [2024-06-27 23:23:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:23:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811691946] [2024-06-27 23:23:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:23:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:23:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:23:30,586 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:23:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:23:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811691946] [2024-06-27 23:23:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811691946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:23:30,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:23:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:23:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311181235] [2024-06-27 23:23:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:23:30,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:23:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:23:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:23:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:23:30,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:23:30,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 243 transitions, 2980 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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:23:30,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:23:30,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:23:30,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:23:35,130 INFO L124 PetriNetUnfolderBase]: 14555/20434 cut-off events. [2024-06-27 23:23:35,130 INFO L125 PetriNetUnfolderBase]: For 518179/518199 co-relation queries the response was YES. [2024-06-27 23:23:35,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130781 conditions, 20434 events. 14555/20434 cut-off events. For 518179/518199 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 115047 event pairs, 7070 based on Foata normal form. 38/20439 useless extension candidates. Maximal degree in co-relation 130730. Up to 19307 conditions per place. [2024-06-27 23:23:35,330 INFO L140 encePairwiseOnDemand]: 36/53 looper letters, 196 selfloop transitions, 95 changer transitions 0/297 dead transitions. [2024-06-27 23:23:35,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 297 transitions, 3856 flow [2024-06-27 23:23:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:23:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:23:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-06-27 23:23:35,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570230607966457 [2024-06-27 23:23:35,332 INFO L175 Difference]: Start difference. First operand has 131 places, 243 transitions, 2980 flow. Second operand 9 states and 218 transitions. [2024-06-27 23:23:35,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 297 transitions, 3856 flow [2024-06-27 23:23:35,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 297 transitions, 3610 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-27 23:23:35,641 INFO L231 Difference]: Finished difference. Result has 134 places, 247 transitions, 3036 flow [2024-06-27 23:23:35,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2734, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3036, PETRI_PLACES=134, PETRI_TRANSITIONS=247} [2024-06-27 23:23:35,641 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2024-06-27 23:23:35,642 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 247 transitions, 3036 flow [2024-06-27 23:23:35,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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:23:35,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:23:35,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:23:35,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:23:35,642 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:23:35,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:23:35,643 INFO L85 PathProgramCache]: Analyzing trace with hash 377939754, now seen corresponding path program 2 times [2024-06-27 23:23:35,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:23:35,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795711826] [2024-06-27 23:23:35,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:23:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:23:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:23:39,105 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:23:39,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:23:39,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795711826] [2024-06-27 23:23:39,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795711826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:23:39,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:23:39,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:23:39,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574866467] [2024-06-27 23:23:39,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:23:39,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:23:39,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:23:39,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:23:39,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:23:39,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:23:39,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 247 transitions, 3036 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:23:39,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:23:39,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:23:39,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:23:44,265 INFO L124 PetriNetUnfolderBase]: 14651/20635 cut-off events. [2024-06-27 23:23:44,266 INFO L125 PetriNetUnfolderBase]: For 555871/555891 co-relation queries the response was YES. [2024-06-27 23:23:44,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136273 conditions, 20635 events. 14651/20635 cut-off events. For 555871/555891 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 116645 event pairs, 6804 based on Foata normal form. 25/20659 useless extension candidates. Maximal degree in co-relation 136222. Up to 19484 conditions per place. [2024-06-27 23:23:44,408 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 198 selfloop transitions, 105 changer transitions 0/309 dead transitions. [2024-06-27 23:23:44,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 309 transitions, 4194 flow [2024-06-27 23:23:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:23:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:23:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 23:23:44,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2024-06-27 23:23:44,410 INFO L175 Difference]: Start difference. First operand has 134 places, 247 transitions, 3036 flow. Second operand 8 states and 196 transitions. [2024-06-27 23:23:44,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 309 transitions, 4194 flow [2024-06-27 23:23:44,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 309 transitions, 3922 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-27 23:23:44,697 INFO L231 Difference]: Finished difference. Result has 135 places, 271 transitions, 3454 flow [2024-06-27 23:23:44,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2780, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3454, PETRI_PLACES=135, PETRI_TRANSITIONS=271} [2024-06-27 23:23:44,698 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 79 predicate places. [2024-06-27 23:23:44,698 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 271 transitions, 3454 flow [2024-06-27 23:23:44,698 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:23:44,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:23:44,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:23:44,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:23:44,698 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:23:44,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:23:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -795437371, now seen corresponding path program 2 times [2024-06-27 23:23:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:23:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370729129] [2024-06-27 23:23:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:23:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:23:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:23:48,683 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:23:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:23:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370729129] [2024-06-27 23:23:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370729129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:23:48,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:23:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:23:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059300380] [2024-06-27 23:23:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:23:48,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:23:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:23:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:23:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:23:48,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:23:48,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 271 transitions, 3454 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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:23:48,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:23:48,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:23:48,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:23:53,823 INFO L124 PetriNetUnfolderBase]: 14891/20962 cut-off events. [2024-06-27 23:23:53,823 INFO L125 PetriNetUnfolderBase]: For 594393/594413 co-relation queries the response was YES. [2024-06-27 23:23:53,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139227 conditions, 20962 events. 14891/20962 cut-off events. For 594393/594413 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 118237 event pairs, 6858 based on Foata normal form. 38/20999 useless extension candidates. Maximal degree in co-relation 139175. Up to 19680 conditions per place. [2024-06-27 23:23:53,964 INFO L140 encePairwiseOnDemand]: 36/53 looper letters, 216 selfloop transitions, 105 changer transitions 0/327 dead transitions. [2024-06-27 23:23:53,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 327 transitions, 4412 flow [2024-06-27 23:23:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:23:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:23:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-06-27 23:23:53,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591194968553459 [2024-06-27 23:23:53,966 INFO L175 Difference]: Start difference. First operand has 135 places, 271 transitions, 3454 flow. Second operand 9 states and 219 transitions. [2024-06-27 23:23:53,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 327 transitions, 4412 flow [2024-06-27 23:23:54,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 327 transitions, 4207 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 23:23:54,364 INFO L231 Difference]: Finished difference. Result has 140 places, 279 transitions, 3615 flow [2024-06-27 23:23:54,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3249, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3615, PETRI_PLACES=140, PETRI_TRANSITIONS=279} [2024-06-27 23:23:54,364 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 84 predicate places. [2024-06-27 23:23:54,364 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 279 transitions, 3615 flow [2024-06-27 23:23:54,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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:23:54,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:23:54,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:23:54,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:23:54,365 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:23:54,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:23:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash -791712721, now seen corresponding path program 3 times [2024-06-27 23:23:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:23:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940285320] [2024-06-27 23:23:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:23:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:23:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat