./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix033_power.oepc_pso.oepc_rmo.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/mix033_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix033_power.oepc_pso.oepc_rmo.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:18:40,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:18:40,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:18:40,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:18:40,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:18:40,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:18:40,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:18:40,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:18:40,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:18:40,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:18:40,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:18:40,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:18:40,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:18:40,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:18:40,463 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:18:40,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:18:40,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:18:40,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:18:40,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:18:40,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:18:40,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:18:40,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:18:40,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:18:40,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:18:40,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:18:40,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:18:40,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:18:40,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:18:40,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:18:40,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:18:40,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:18:40,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:18:40,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:18:40,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:18:40,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:18:40,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:18:40,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:18:40,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:18:40,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:18:40,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:18:40,469 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:18:40,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:18:40,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:18:40,470 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 [2024-06-27 22:18:40,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:18:40,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:18:40,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:18:40,725 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:18:40,725 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:18:40,726 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/mix033_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 22:18:40,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:18:40,813 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:18:40,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:18:42,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:18:42,274 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:18:42,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:18:42,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8673bd6/ef8b31d303e84b4d983d6297a0afa14c/FLAG3a0461473 [2024-06-27 22:18:42,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8673bd6/ef8b31d303e84b4d983d6297a0afa14c [2024-06-27 22:18:42,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:18:42,315 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:18:42,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:18:42,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:18:42,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:18:42,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:18:40" (1/2) ... [2024-06-27 22:18:42,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11815e6b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:18:42, skipping insertion in model container [2024-06-27 22:18:42,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:18:40" (1/2) ... [2024-06-27 22:18:42,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c44babe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:18:42, skipping insertion in model container [2024-06-27 22:18:42,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:18:42" (2/2) ... [2024-06-27 22:18:42,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11815e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:42, skipping insertion in model container [2024-06-27 22:18:42,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:18:42" (2/2) ... [2024-06-27 22:18:42,326 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:18:42,351 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:18:42,353 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 22:18:42,353 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 22:18:42,354 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 22:18:42,354 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:18:42,355 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-27 22:18:42,394 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:18:42,519 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-27 22:18:42,700 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:18:42,716 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:18:42,752 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:18:42,926 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:18:43,005 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:18:43,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43 WrapperNode [2024-06-27 22:18:43,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:18:43,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:18:43,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:18:43,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:18:43,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,093 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2024-06-27 22:18:43,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:18:43,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:18:43,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:18:43,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:18:43,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,149 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 22:18:43,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:18:43,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:18:43,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:18:43,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:18:43,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (1/1) ... [2024-06-27 22:18:43,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:18:43,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:18:43,231 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 22:18:43,248 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 22:18:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:18:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:18:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:18:43,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:18:43,275 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:18:43,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:18:43,275 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:18:43,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:18:43,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:18:43,278 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 22:18:43,397 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:18:43,399 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:18:43,848 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:18:43,849 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:18:43,985 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:18:43,985 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:18:43,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:18:43 BoogieIcfgContainer [2024-06-27 22:18:43,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:18:43,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:18:43,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:18:43,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:18:43,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:18:40" (1/4) ... [2024-06-27 22:18:43,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7131dc50 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:18:43, skipping insertion in model container [2024-06-27 22:18:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:18:42" (2/4) ... [2024-06-27 22:18:43,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7131dc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:18:43, skipping insertion in model container [2024-06-27 22:18:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:43" (3/4) ... [2024-06-27 22:18:43,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7131dc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:18:43, skipping insertion in model container [2024-06-27 22:18:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:18:43" (4/4) ... [2024-06-27 22:18:43,991 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:18:44,004 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:18:44,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:18:44,004 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:18:44,058 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:18:44,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 112 flow [2024-06-27 22:18:44,118 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-06-27 22:18:44,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:18:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-06-27 22:18:44,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 50 transitions, 112 flow [2024-06-27 22:18:44,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 47 transitions, 103 flow [2024-06-27 22:18:44,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:18:44,145 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;@4382f959, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:18:44,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:18:44,149 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:18:44,149 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:18:44,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:18:44,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:44,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:18:44,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:44,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash 350216843, now seen corresponding path program 1 times [2024-06-27 22:18:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:44,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632288280] [2024-06-27 22:18:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:44,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632288280] [2024-06-27 22:18:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632288280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:45,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:18:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262207766] [2024-06-27 22:18:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:45,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:18:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:45,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:18:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:18:45,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:18:45,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 22:18:45,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:45,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:18:45,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:47,034 INFO L124 PetriNetUnfolderBase]: 5220/8443 cut-off events. [2024-06-27 22:18:47,035 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-06-27 22:18:47,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16001 conditions, 8443 events. 5220/8443 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 56988 event pairs, 4390 based on Foata normal form. 252/8009 useless extension candidates. Maximal degree in co-relation 15989. Up to 7445 conditions per place. [2024-06-27 22:18:47,081 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 43 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-06-27 22:18:47,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 229 flow [2024-06-27 22:18:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:18:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:18:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-27 22:18:47,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2024-06-27 22:18:47,093 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 103 flow. Second operand 3 states and 101 transitions. [2024-06-27 22:18:47,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 229 flow [2024-06-27 22:18:47,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:18:47,098 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 130 flow [2024-06-27 22:18:47,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-27 22:18:47,102 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2024-06-27 22:18:47,102 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 130 flow [2024-06-27 22:18:47,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 22:18:47,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:47,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:47,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:18:47,103 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:47,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1550951497, now seen corresponding path program 1 times [2024-06-27 22:18:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519945050] [2024-06-27 22:18:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:48,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 22:18:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519945050] [2024-06-27 22:18:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519945050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:18:48,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057105828] [2024-06-27 22:18:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:48,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:18:48,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:18:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:18:48,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:18:48,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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 22:18:48,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:48,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:18:48,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:49,234 INFO L124 PetriNetUnfolderBase]: 5222/8338 cut-off events. [2024-06-27 22:18:49,234 INFO L125 PetriNetUnfolderBase]: For 1097/1097 co-relation queries the response was YES. [2024-06-27 22:18:49,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17532 conditions, 8338 events. 5222/8338 cut-off events. For 1097/1097 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 55098 event pairs, 3613 based on Foata normal form. 3/7707 useless extension candidates. Maximal degree in co-relation 17520. Up to 7430 conditions per place. [2024-06-27 22:18:49,288 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 53 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-06-27 22:18:49,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 327 flow [2024-06-27 22:18:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:18:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:18:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-27 22:18:49,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.63 [2024-06-27 22:18:49,294 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 130 flow. Second operand 4 states and 126 transitions. [2024-06-27 22:18:49,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 327 flow [2024-06-27 22:18:49,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:18:49,298 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 195 flow [2024-06-27 22:18:49,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2024-06-27 22:18:49,299 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2024-06-27 22:18:49,299 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 195 flow [2024-06-27 22:18:49,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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 22:18:49,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:49,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:49,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:18:49,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:49,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash 834856694, now seen corresponding path program 1 times [2024-06-27 22:18:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137740245] [2024-06-27 22:18:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:50,503 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 22:18:50,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:50,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137740245] [2024-06-27 22:18:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137740245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:50,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:18:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371057264] [2024-06-27 22:18:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:18:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:18:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:18:50,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:18:50,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 22:18:50,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:50,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:18:50,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:51,546 INFO L124 PetriNetUnfolderBase]: 5246/8355 cut-off events. [2024-06-27 22:18:51,546 INFO L125 PetriNetUnfolderBase]: For 3329/3329 co-relation queries the response was YES. [2024-06-27 22:18:51,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19221 conditions, 8355 events. 5246/8355 cut-off events. For 3329/3329 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 54892 event pairs, 2977 based on Foata normal form. 5/7756 useless extension candidates. Maximal degree in co-relation 19206. Up to 7362 conditions per place. [2024-06-27 22:18:51,579 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 69 selfloop transitions, 18 changer transitions 2/102 dead transitions. [2024-06-27 22:18:51,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 519 flow [2024-06-27 22:18:51,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:18:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:18:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-06-27 22:18:51,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2024-06-27 22:18:51,582 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 195 flow. Second operand 5 states and 165 transitions. [2024-06-27 22:18:51,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 519 flow [2024-06-27 22:18:51,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 508 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 22:18:51,585 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 311 flow [2024-06-27 22:18:51,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2024-06-27 22:18:51,586 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-06-27 22:18:51,586 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 311 flow [2024-06-27 22:18:51,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 22:18:51,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:51,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:51,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:18:51,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:51,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash 110754312, now seen corresponding path program 1 times [2024-06-27 22:18:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996619188] [2024-06-27 22:18:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:52,989 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 22:18:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996619188] [2024-06-27 22:18:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996619188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:18:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765501162] [2024-06-27 22:18:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:52,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:18:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:18:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:18:53,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:18:53,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 22:18:53,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:53,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:18:53,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:54,030 INFO L124 PetriNetUnfolderBase]: 5266/8031 cut-off events. [2024-06-27 22:18:54,030 INFO L125 PetriNetUnfolderBase]: For 7933/7936 co-relation queries the response was YES. [2024-06-27 22:18:54,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21974 conditions, 8031 events. 5266/8031 cut-off events. For 7933/7936 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 50189 event pairs, 2220 based on Foata normal form. 7/7593 useless extension candidates. Maximal degree in co-relation 21955. Up to 7305 conditions per place. [2024-06-27 22:18:54,075 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 82 selfloop transitions, 33 changer transitions 3/131 dead transitions. [2024-06-27 22:18:54,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 131 transitions, 787 flow [2024-06-27 22:18:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:18:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:18:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-06-27 22:18:54,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2024-06-27 22:18:54,077 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 311 flow. Second operand 6 states and 198 transitions. [2024-06-27 22:18:54,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 131 transitions, 787 flow [2024-06-27 22:18:54,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 131 transitions, 779 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 22:18:54,084 INFO L231 Difference]: Finished difference. Result has 75 places, 83 transitions, 523 flow [2024-06-27 22:18:54,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=75, PETRI_TRANSITIONS=83} [2024-06-27 22:18:54,085 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2024-06-27 22:18:54,085 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 523 flow [2024-06-27 22:18:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 22:18:54,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:54,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:54,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:18:54,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:54,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash -861583019, now seen corresponding path program 1 times [2024-06-27 22:18:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:54,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410944909] [2024-06-27 22:18:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:55,670 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 22:18:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:55,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410944909] [2024-06-27 22:18:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410944909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:55,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:55,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:18:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470904731] [2024-06-27 22:18:55,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:55,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:18:55,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:18:55,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:18:55,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:18:55,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 523 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:55,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:55,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:18:55,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:56,995 INFO L124 PetriNetUnfolderBase]: 5298/8531 cut-off events. [2024-06-27 22:18:56,996 INFO L125 PetriNetUnfolderBase]: For 16416/16422 co-relation queries the response was YES. [2024-06-27 22:18:57,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26107 conditions, 8531 events. 5298/8531 cut-off events. For 16416/16422 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 56659 event pairs, 2584 based on Foata normal form. 14/7947 useless extension candidates. Maximal degree in co-relation 26082. Up to 7269 conditions per place. [2024-06-27 22:18:57,043 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 89 selfloop transitions, 36 changer transitions 4/142 dead transitions. [2024-06-27 22:18:57,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 142 transitions, 989 flow [2024-06-27 22:18:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:18:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:18:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-06-27 22:18:57,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-06-27 22:18:57,045 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 523 flow. Second operand 7 states and 224 transitions. [2024-06-27 22:18:57,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 142 transitions, 989 flow [2024-06-27 22:18:57,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 142 transitions, 955 flow, removed 17 selfloop flow, removed 0 redundant places. [2024-06-27 22:18:57,069 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 593 flow [2024-06-27 22:18:57,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=593, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2024-06-27 22:18:57,072 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2024-06-27 22:18:57,072 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 593 flow [2024-06-27 22:18:57,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:57,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:57,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:57,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:18:57,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:57,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash -898401476, now seen corresponding path program 1 times [2024-06-27 22:18:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:57,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933988635] [2024-06-27 22:18:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:59,148 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 22:18:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933988635] [2024-06-27 22:18:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933988635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:59,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:59,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:18:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444143908] [2024-06-27 22:18:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:59,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:18:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:18:59,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:18:59,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:18:59,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 22:18:59,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:59,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:18:59,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:00,590 INFO L124 PetriNetUnfolderBase]: 6139/9387 cut-off events. [2024-06-27 22:19:00,590 INFO L125 PetriNetUnfolderBase]: For 20425/20425 co-relation queries the response was YES. [2024-06-27 22:19:00,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29920 conditions, 9387 events. 6139/9387 cut-off events. For 20425/20425 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 58873 event pairs, 2821 based on Foata normal form. 6/8858 useless extension candidates. Maximal degree in co-relation 29891. Up to 8641 conditions per place. [2024-06-27 22:19:00,638 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 92 selfloop transitions, 24 changer transitions 0/127 dead transitions. [2024-06-27 22:19:00,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 127 transitions, 1044 flow [2024-06-27 22:19:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-06-27 22:19:00,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-06-27 22:19:00,639 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 593 flow. Second operand 7 states and 184 transitions. [2024-06-27 22:19:00,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 127 transitions, 1044 flow [2024-06-27 22:19:00,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 932 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 22:19:00,655 INFO L231 Difference]: Finished difference. Result has 86 places, 99 transitions, 727 flow [2024-06-27 22:19:00,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=727, PETRI_PLACES=86, PETRI_TRANSITIONS=99} [2024-06-27 22:19:00,656 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2024-06-27 22:19:00,656 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 99 transitions, 727 flow [2024-06-27 22:19:00,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 22:19:00,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:00,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:00,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:19:00,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:00,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2080618307, now seen corresponding path program 1 times [2024-06-27 22:19:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505359394] [2024-06-27 22:19:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:00,731 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 22:19:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505359394] [2024-06-27 22:19:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505359394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:00,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:19:00,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296872880] [2024-06-27 22:19:00,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:00,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:19:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:00,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:19:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:19:00,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-06-27 22:19:00,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 99 transitions, 727 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 22:19:00,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:00,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-06-27 22:19:00,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:01,102 INFO L124 PetriNetUnfolderBase]: 1715/3513 cut-off events. [2024-06-27 22:19:01,102 INFO L125 PetriNetUnfolderBase]: For 4792/4912 co-relation queries the response was YES. [2024-06-27 22:19:01,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9352 conditions, 3513 events. 1715/3513 cut-off events. For 4792/4912 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 27181 event pairs, 747 based on Foata normal form. 21/3305 useless extension candidates. Maximal degree in co-relation 9319. Up to 2123 conditions per place. [2024-06-27 22:19:01,128 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 45 selfloop transitions, 7 changer transitions 0/113 dead transitions. [2024-06-27 22:19:01,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 113 transitions, 863 flow [2024-06-27 22:19:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:19:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:19:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-27 22:19:01,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2024-06-27 22:19:01,130 INFO L175 Difference]: Start difference. First operand has 86 places, 99 transitions, 727 flow. Second operand 3 states and 119 transitions. [2024-06-27 22:19:01,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 113 transitions, 863 flow [2024-06-27 22:19:01,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 113 transitions, 828 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:01,141 INFO L231 Difference]: Finished difference. Result has 85 places, 98 transitions, 698 flow [2024-06-27 22:19:01,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=85, PETRI_TRANSITIONS=98} [2024-06-27 22:19:01,142 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2024-06-27 22:19:01,142 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 698 flow [2024-06-27 22:19:01,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 22:19:01,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:01,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:01,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:19:01,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:01,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2080618781, now seen corresponding path program 1 times [2024-06-27 22:19:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173171956] [2024-06-27 22:19:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:01,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:03,462 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 22:19:03,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173171956] [2024-06-27 22:19:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173171956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:03,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:03,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:19:03,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237972087] [2024-06-27 22:19:03,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:03,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:19:03,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:03,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:19:03,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:19:03,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:03,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 698 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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 22:19:03,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:03,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:03,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:05,057 INFO L124 PetriNetUnfolderBase]: 6255/9503 cut-off events. [2024-06-27 22:19:05,057 INFO L125 PetriNetUnfolderBase]: For 26075/26075 co-relation queries the response was YES. [2024-06-27 22:19:05,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30459 conditions, 9503 events. 6255/9503 cut-off events. For 26075/26075 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 57282 event pairs, 2568 based on Foata normal form. 6/9406 useless extension candidates. Maximal degree in co-relation 30425. Up to 8734 conditions per place. [2024-06-27 22:19:05,172 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 101 selfloop transitions, 32 changer transitions 1/144 dead transitions. [2024-06-27 22:19:05,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 144 transitions, 1154 flow [2024-06-27 22:19:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 22:19:05,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-27 22:19:05,175 INFO L175 Difference]: Start difference. First operand has 85 places, 98 transitions, 698 flow. Second operand 9 states and 216 transitions. [2024-06-27 22:19:05,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 144 transitions, 1154 flow [2024-06-27 22:19:05,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 144 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:05,204 INFO L231 Difference]: Finished difference. Result has 92 places, 106 transitions, 821 flow [2024-06-27 22:19:05,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=821, PETRI_PLACES=92, PETRI_TRANSITIONS=106} [2024-06-27 22:19:05,206 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 36 predicate places. [2024-06-27 22:19:05,206 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 106 transitions, 821 flow [2024-06-27 22:19:05,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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 22:19:05,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:05,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:05,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:19:05,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:05,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:05,207 INFO L85 PathProgramCache]: Analyzing trace with hash 822812734, now seen corresponding path program 1 times [2024-06-27 22:19:05,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:05,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007008143] [2024-06-27 22:19:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:06,963 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 22:19:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007008143] [2024-06-27 22:19:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007008143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:06,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:06,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:19:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831733660] [2024-06-27 22:19:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:06,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:19:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:19:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:19:07,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:07,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 106 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:19:07,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:07,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:07,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:08,470 INFO L124 PetriNetUnfolderBase]: 5281/8738 cut-off events. [2024-06-27 22:19:08,470 INFO L125 PetriNetUnfolderBase]: For 29632/29638 co-relation queries the response was YES. [2024-06-27 22:19:08,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29341 conditions, 8738 events. 5281/8738 cut-off events. For 29632/29638 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 58120 event pairs, 2104 based on Foata normal form. 8/8508 useless extension candidates. Maximal degree in co-relation 29305. Up to 7305 conditions per place. [2024-06-27 22:19:08,532 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 104 selfloop transitions, 51 changer transitions 0/168 dead transitions. [2024-06-27 22:19:08,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 168 transitions, 1583 flow [2024-06-27 22:19:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-27 22:19:08,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 22:19:08,538 INFO L175 Difference]: Start difference. First operand has 92 places, 106 transitions, 821 flow. Second operand 7 states and 185 transitions. [2024-06-27 22:19:08,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 168 transitions, 1583 flow [2024-06-27 22:19:08,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 168 transitions, 1516 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 22:19:08,566 INFO L231 Difference]: Finished difference. Result has 95 places, 138 transitions, 1292 flow [2024-06-27 22:19:08,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1292, PETRI_PLACES=95, PETRI_TRANSITIONS=138} [2024-06-27 22:19:08,567 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2024-06-27 22:19:08,567 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 138 transitions, 1292 flow [2024-06-27 22:19:08,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:19:08,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:08,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:08,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:19:08,571 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:08,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash -75334021, now seen corresponding path program 1 times [2024-06-27 22:19:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:08,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243195449] [2024-06-27 22:19:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:11,357 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 22:19:11,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:11,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243195449] [2024-06-27 22:19:11,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243195449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:11,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:11,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170609614] [2024-06-27 22:19:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:11,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:11,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:11,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:11,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:11,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 138 transitions, 1292 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 22:19:11,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:11,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:11,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:12,928 INFO L124 PetriNetUnfolderBase]: 5612/8629 cut-off events. [2024-06-27 22:19:12,928 INFO L125 PetriNetUnfolderBase]: For 33922/33922 co-relation queries the response was YES. [2024-06-27 22:19:12,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31308 conditions, 8629 events. 5612/8629 cut-off events. For 33922/33922 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 51594 event pairs, 1991 based on Foata normal form. 6/8541 useless extension candidates. Maximal degree in co-relation 31269. Up to 7684 conditions per place. [2024-06-27 22:19:12,993 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 127 selfloop transitions, 55 changer transitions 0/192 dead transitions. [2024-06-27 22:19:12,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 192 transitions, 1918 flow [2024-06-27 22:19:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:19:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:19:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 241 transitions. [2024-06-27 22:19:12,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.482 [2024-06-27 22:19:12,995 INFO L175 Difference]: Start difference. First operand has 95 places, 138 transitions, 1292 flow. Second operand 10 states and 241 transitions. [2024-06-27 22:19:12,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 192 transitions, 1918 flow [2024-06-27 22:19:13,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 192 transitions, 1893 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:13,033 INFO L231 Difference]: Finished difference. Result has 103 places, 147 transitions, 1465 flow [2024-06-27 22:19:13,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1465, PETRI_PLACES=103, PETRI_TRANSITIONS=147} [2024-06-27 22:19:13,034 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 47 predicate places. [2024-06-27 22:19:13,034 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 147 transitions, 1465 flow [2024-06-27 22:19:13,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 22:19:13,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:13,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:13,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:19:13,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:13,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash -262607213, now seen corresponding path program 1 times [2024-06-27 22:19:13,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:13,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724361278] [2024-06-27 22:19:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:15,013 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 22:19:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724361278] [2024-06-27 22:19:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724361278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:15,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242084789] [2024-06-27 22:19:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:15,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:15,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:15,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 147 transitions, 1465 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 22:19:15,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:15,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:15,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:16,916 INFO L124 PetriNetUnfolderBase]: 5698/9266 cut-off events. [2024-06-27 22:19:16,916 INFO L125 PetriNetUnfolderBase]: For 42114/42117 co-relation queries the response was YES. [2024-06-27 22:19:16,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34587 conditions, 9266 events. 5698/9266 cut-off events. For 42114/42117 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 60255 event pairs, 2092 based on Foata normal form. 6/9039 useless extension candidates. Maximal degree in co-relation 34546. Up to 7723 conditions per place. [2024-06-27 22:19:16,963 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 125 selfloop transitions, 81 changer transitions 0/216 dead transitions. [2024-06-27 22:19:16,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 216 transitions, 2348 flow [2024-06-27 22:19:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 22:19:16,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 22:19:16,965 INFO L175 Difference]: Start difference. First operand has 103 places, 147 transitions, 1465 flow. Second operand 8 states and 210 transitions. [2024-06-27 22:19:16,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 216 transitions, 2348 flow [2024-06-27 22:19:16,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 216 transitions, 2263 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 22:19:16,998 INFO L231 Difference]: Finished difference. Result has 107 places, 175 transitions, 1850 flow [2024-06-27 22:19:16,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1850, PETRI_PLACES=107, PETRI_TRANSITIONS=175} [2024-06-27 22:19:16,999 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 51 predicate places. [2024-06-27 22:19:16,999 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 175 transitions, 1850 flow [2024-06-27 22:19:16,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 22:19:16,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:16,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:17,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:19:17,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:17,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -777105615, now seen corresponding path program 1 times [2024-06-27 22:19:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312853403] [2024-06-27 22:19:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:18,849 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 22:19:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312853403] [2024-06-27 22:19:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312853403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:18,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:18,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:19:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470684108] [2024-06-27 22:19:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:18,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:19:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:19:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:19:18,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:18,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 175 transitions, 1850 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 22:19:18,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:18,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:18,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:20,393 INFO L124 PetriNetUnfolderBase]: 6301/9794 cut-off events. [2024-06-27 22:19:20,393 INFO L125 PetriNetUnfolderBase]: For 60412/60482 co-relation queries the response was YES. [2024-06-27 22:19:20,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40571 conditions, 9794 events. 6301/9794 cut-off events. For 60412/60482 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 60205 event pairs, 2260 based on Foata normal form. 6/9670 useless extension candidates. Maximal degree in co-relation 40526. Up to 8876 conditions per place. [2024-06-27 22:19:20,459 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 167 selfloop transitions, 23 changer transitions 0/208 dead transitions. [2024-06-27 22:19:20,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 208 transitions, 2439 flow [2024-06-27 22:19:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-06-27 22:19:20,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 22:19:20,461 INFO L175 Difference]: Start difference. First operand has 107 places, 175 transitions, 1850 flow. Second operand 7 states and 165 transitions. [2024-06-27 22:19:20,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 208 transitions, 2439 flow [2024-06-27 22:19:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 208 transitions, 2389 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:20,517 INFO L231 Difference]: Finished difference. Result has 114 places, 186 transitions, 2009 flow [2024-06-27 22:19:20,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2009, PETRI_PLACES=114, PETRI_TRANSITIONS=186} [2024-06-27 22:19:20,518 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2024-06-27 22:19:20,518 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 186 transitions, 2009 flow [2024-06-27 22:19:20,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 22:19:20,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:20,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:20,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:19:20,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:20,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1840410237, now seen corresponding path program 1 times [2024-06-27 22:19:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:20,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034997069] [2024-06-27 22:19:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:22,741 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 22:19:22,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034997069] [2024-06-27 22:19:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034997069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:22,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:22,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:22,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897780590] [2024-06-27 22:19:22,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:22,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:22,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:22,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:22,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:22,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 186 transitions, 2009 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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 22:19:22,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:22,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:22,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:24,217 INFO L124 PetriNetUnfolderBase]: 5546/8708 cut-off events. [2024-06-27 22:19:24,217 INFO L125 PetriNetUnfolderBase]: For 67469/67527 co-relation queries the response was YES. [2024-06-27 22:19:24,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38854 conditions, 8708 events. 5546/8708 cut-off events. For 67469/67527 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 53805 event pairs, 1845 based on Foata normal form. 6/8592 useless extension candidates. Maximal degree in co-relation 38804. Up to 7603 conditions per place. [2024-06-27 22:19:24,285 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 157 selfloop transitions, 56 changer transitions 0/232 dead transitions. [2024-06-27 22:19:24,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 232 transitions, 2713 flow [2024-06-27 22:19:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2024-06-27 22:19:24,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-06-27 22:19:24,289 INFO L175 Difference]: Start difference. First operand has 114 places, 186 transitions, 2009 flow. Second operand 7 states and 188 transitions. [2024-06-27 22:19:24,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 232 transitions, 2713 flow [2024-06-27 22:19:24,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 232 transitions, 2637 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:24,376 INFO L231 Difference]: Finished difference. Result has 120 places, 198 transitions, 2191 flow [2024-06-27 22:19:24,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2191, PETRI_PLACES=120, PETRI_TRANSITIONS=198} [2024-06-27 22:19:24,377 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 64 predicate places. [2024-06-27 22:19:24,377 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 198 transitions, 2191 flow [2024-06-27 22:19:24,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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 22:19:24,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:24,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:24,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:19:24,377 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:24,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash 321569017, now seen corresponding path program 2 times [2024-06-27 22:19:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258168246] [2024-06-27 22:19:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:26,186 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 22:19:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258168246] [2024-06-27 22:19:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258168246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038038471] [2024-06-27 22:19:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:26,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:26,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:26,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 198 transitions, 2191 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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 22:19:26,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:26,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:26,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:27,590 INFO L124 PetriNetUnfolderBase]: 5575/8764 cut-off events. [2024-06-27 22:19:27,590 INFO L125 PetriNetUnfolderBase]: For 77421/77479 co-relation queries the response was YES. [2024-06-27 22:19:27,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41111 conditions, 8764 events. 5575/8764 cut-off events. For 77421/77479 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 54274 event pairs, 1832 based on Foata normal form. 6/8645 useless extension candidates. Maximal degree in co-relation 41058. Up to 7683 conditions per place. [2024-06-27 22:19:27,760 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 158 selfloop transitions, 67 changer transitions 0/244 dead transitions. [2024-06-27 22:19:27,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 244 transitions, 2976 flow [2024-06-27 22:19:27,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-27 22:19:27,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 22:19:27,761 INFO L175 Difference]: Start difference. First operand has 120 places, 198 transitions, 2191 flow. Second operand 7 states and 185 transitions. [2024-06-27 22:19:27,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 244 transitions, 2976 flow [2024-06-27 22:19:27,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 244 transitions, 2883 flow, removed 39 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:27,834 INFO L231 Difference]: Finished difference. Result has 127 places, 212 transitions, 2536 flow [2024-06-27 22:19:27,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2536, PETRI_PLACES=127, PETRI_TRANSITIONS=212} [2024-06-27 22:19:27,835 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 71 predicate places. [2024-06-27 22:19:27,835 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 212 transitions, 2536 flow [2024-06-27 22:19:27,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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 22:19:27,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:27,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:27,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:19:27,836 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:27,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 325288242, now seen corresponding path program 1 times [2024-06-27 22:19:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166119352] [2024-06-27 22:19:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:29,354 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 22:19:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166119352] [2024-06-27 22:19:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166119352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:29,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482160399] [2024-06-27 22:19:29,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:29,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:29,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:29,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:29,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:29,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 212 transitions, 2536 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:29,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:29,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:29,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:30,986 INFO L124 PetriNetUnfolderBase]: 5919/9465 cut-off events. [2024-06-27 22:19:30,987 INFO L125 PetriNetUnfolderBase]: For 86518/86525 co-relation queries the response was YES. [2024-06-27 22:19:31,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44905 conditions, 9465 events. 5919/9465 cut-off events. For 86518/86525 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 60058 event pairs, 2018 based on Foata normal form. 9/9290 useless extension candidates. Maximal degree in co-relation 44848. Up to 8054 conditions per place. [2024-06-27 22:19:31,050 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 189 selfloop transitions, 78 changer transitions 0/277 dead transitions. [2024-06-27 22:19:31,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 277 transitions, 3617 flow [2024-06-27 22:19:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-06-27 22:19:31,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-06-27 22:19:31,051 INFO L175 Difference]: Start difference. First operand has 127 places, 212 transitions, 2536 flow. Second operand 7 states and 184 transitions. [2024-06-27 22:19:31,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 277 transitions, 3617 flow [2024-06-27 22:19:31,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 277 transitions, 3471 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 22:19:31,140 INFO L231 Difference]: Finished difference. Result has 132 places, 237 transitions, 2968 flow [2024-06-27 22:19:31,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2968, PETRI_PLACES=132, PETRI_TRANSITIONS=237} [2024-06-27 22:19:31,141 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 76 predicate places. [2024-06-27 22:19:31,141 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 237 transitions, 2968 flow [2024-06-27 22:19:31,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:31,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:31,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:31,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:19:31,142 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:31,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash 325293822, now seen corresponding path program 2 times [2024-06-27 22:19:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716029245] [2024-06-27 22:19:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:32,658 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 22:19:32,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716029245] [2024-06-27 22:19:32,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716029245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:32,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:32,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145971431] [2024-06-27 22:19:32,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:32,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:32,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:32,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:32,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:32,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:32,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 237 transitions, 2968 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:32,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:32,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:32,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:34,369 INFO L124 PetriNetUnfolderBase]: 5993/9582 cut-off events. [2024-06-27 22:19:34,370 INFO L125 PetriNetUnfolderBase]: For 99803/99806 co-relation queries the response was YES. [2024-06-27 22:19:34,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47695 conditions, 9582 events. 5993/9582 cut-off events. For 99803/99806 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 60864 event pairs, 2023 based on Foata normal form. 5/9401 useless extension candidates. Maximal degree in co-relation 47635. Up to 8116 conditions per place. [2024-06-27 22:19:34,465 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 195 selfloop transitions, 90 changer transitions 0/295 dead transitions. [2024-06-27 22:19:34,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 295 transitions, 4039 flow [2024-06-27 22:19:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 22:19:34,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 22:19:34,467 INFO L175 Difference]: Start difference. First operand has 132 places, 237 transitions, 2968 flow. Second operand 7 states and 182 transitions. [2024-06-27 22:19:34,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 295 transitions, 4039 flow [2024-06-27 22:19:34,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 295 transitions, 3974 flow, removed 31 selfloop flow, removed 1 redundant places. [2024-06-27 22:19:34,601 INFO L231 Difference]: Finished difference. Result has 140 places, 255 transitions, 3440 flow [2024-06-27 22:19:34,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2917, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3440, PETRI_PLACES=140, PETRI_TRANSITIONS=255} [2024-06-27 22:19:34,601 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 84 predicate places. [2024-06-27 22:19:34,602 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 255 transitions, 3440 flow [2024-06-27 22:19:34,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:34,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:34,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:34,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:19:34,602 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:34,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash 618202916, now seen corresponding path program 3 times [2024-06-27 22:19:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:34,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066887515] [2024-06-27 22:19:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:35,917 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 22:19:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:35,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066887515] [2024-06-27 22:19:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066887515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:35,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:35,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115333882] [2024-06-27 22:19:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:35,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:35,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:35,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:36,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:36,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 255 transitions, 3440 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:36,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:36,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:36,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:37,651 INFO L124 PetriNetUnfolderBase]: 5985/9565 cut-off events. [2024-06-27 22:19:37,651 INFO L125 PetriNetUnfolderBase]: For 106220/106226 co-relation queries the response was YES. [2024-06-27 22:19:37,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48683 conditions, 9565 events. 5985/9565 cut-off events. For 106220/106226 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 60746 event pairs, 2028 based on Foata normal form. 7/9387 useless extension candidates. Maximal degree in co-relation 48618. Up to 8431 conditions per place. [2024-06-27 22:19:37,737 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 247 selfloop transitions, 32 changer transitions 0/289 dead transitions. [2024-06-27 22:19:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 289 transitions, 4150 flow [2024-06-27 22:19:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 22:19:37,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942857142857143 [2024-06-27 22:19:37,739 INFO L175 Difference]: Start difference. First operand has 140 places, 255 transitions, 3440 flow. Second operand 7 states and 173 transitions. [2024-06-27 22:19:37,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 289 transitions, 4150 flow [2024-06-27 22:19:37,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 289 transitions, 3995 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:37,862 INFO L231 Difference]: Finished difference. Result has 144 places, 255 transitions, 3364 flow [2024-06-27 22:19:37,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3285, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3364, PETRI_PLACES=144, PETRI_TRANSITIONS=255} [2024-06-27 22:19:37,863 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 88 predicate places. [2024-06-27 22:19:37,863 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 255 transitions, 3364 flow [2024-06-27 22:19:37,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:37,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:37,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:37,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:19:37,864 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:37,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash -541262135, now seen corresponding path program 3 times [2024-06-27 22:19:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:37,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225263680] [2024-06-27 22:19:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:39,740 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 22:19:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225263680] [2024-06-27 22:19:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225263680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:39,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706469121] [2024-06-27 22:19:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:39,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:39,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:39,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:39,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:19:39,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 255 transitions, 3364 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:19:39,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:39,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:19:39,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:41,194 INFO L124 PetriNetUnfolderBase]: 5191/8837 cut-off events. [2024-06-27 22:19:41,195 INFO L125 PetriNetUnfolderBase]: For 103760/103841 co-relation queries the response was YES. [2024-06-27 22:19:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43707 conditions, 8837 events. 5191/8837 cut-off events. For 103760/103841 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 60456 event pairs, 1806 based on Foata normal form. 19/8541 useless extension candidates. Maximal degree in co-relation 43641. Up to 6887 conditions per place. [2024-06-27 22:19:41,284 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 176 selfloop transitions, 87 changer transitions 0/296 dead transitions. [2024-06-27 22:19:41,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 296 transitions, 4170 flow [2024-06-27 22:19:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2024-06-27 22:19:41,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514285714285714 [2024-06-27 22:19:41,286 INFO L175 Difference]: Start difference. First operand has 144 places, 255 transitions, 3364 flow. Second operand 7 states and 193 transitions. [2024-06-27 22:19:41,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 296 transitions, 4170 flow [2024-06-27 22:19:41,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 296 transitions, 4031 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 22:19:41,403 INFO L231 Difference]: Finished difference. Result has 145 places, 261 transitions, 3497 flow [2024-06-27 22:19:41,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3225, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3497, PETRI_PLACES=145, PETRI_TRANSITIONS=261} [2024-06-27 22:19:41,403 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 89 predicate places. [2024-06-27 22:19:41,403 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 261 transitions, 3497 flow [2024-06-27 22:19:41,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:19:41,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:41,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:41,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:19:41,404 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:41,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash -540624155, now seen corresponding path program 4 times [2024-06-27 22:19:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:41,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549290177] [2024-06-27 22:19:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:43,340 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 22:19:43,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:43,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549290177] [2024-06-27 22:19:43,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549290177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:43,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:43,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406174737] [2024-06-27 22:19:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:43,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:43,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:43,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:19:43,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 261 transitions, 3497 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:19:43,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:43,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:19:43,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:44,895 INFO L124 PetriNetUnfolderBase]: 5185/8548 cut-off events. [2024-06-27 22:19:44,895 INFO L125 PetriNetUnfolderBase]: For 113677/113757 co-relation queries the response was YES. [2024-06-27 22:19:44,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44637 conditions, 8548 events. 5185/8548 cut-off events. For 113677/113757 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 56574 event pairs, 2087 based on Foata normal form. 34/8360 useless extension candidates. Maximal degree in co-relation 44573. Up to 7031 conditions per place. [2024-06-27 22:19:44,981 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 186 selfloop transitions, 78 changer transitions 0/297 dead transitions. [2024-06-27 22:19:44,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 297 transitions, 4222 flow [2024-06-27 22:19:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 22:19:44,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342857142857143 [2024-06-27 22:19:44,982 INFO L175 Difference]: Start difference. First operand has 145 places, 261 transitions, 3497 flow. Second operand 7 states and 187 transitions. [2024-06-27 22:19:44,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 297 transitions, 4222 flow [2024-06-27 22:19:45,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 297 transitions, 4121 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:45,110 INFO L231 Difference]: Finished difference. Result has 150 places, 267 transitions, 3696 flow [2024-06-27 22:19:45,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3696, PETRI_PLACES=150, PETRI_TRANSITIONS=267} [2024-06-27 22:19:45,110 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 94 predicate places. [2024-06-27 22:19:45,110 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 267 transitions, 3696 flow [2024-06-27 22:19:45,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:19:45,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:45,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:45,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:19:45,111 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:45,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash 449597142, now seen corresponding path program 4 times [2024-06-27 22:19:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186908031] [2024-06-27 22:19:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:46,961 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 22:19:46,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186908031] [2024-06-27 22:19:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186908031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070578439] [2024-06-27 22:19:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:46,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:47,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:47,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 267 transitions, 3696 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:47,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:47,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:47,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:48,853 INFO L124 PetriNetUnfolderBase]: 6115/9747 cut-off events. [2024-06-27 22:19:48,853 INFO L125 PetriNetUnfolderBase]: For 123979/123989 co-relation queries the response was YES. [2024-06-27 22:19:48,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52078 conditions, 9747 events. 6115/9747 cut-off events. For 123979/123989 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 61653 event pairs, 1966 based on Foata normal form. 10/9570 useless extension candidates. Maximal degree in co-relation 52011. Up to 8177 conditions per place. [2024-06-27 22:19:48,956 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 196 selfloop transitions, 128 changer transitions 0/334 dead transitions. [2024-06-27 22:19:48,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 334 transitions, 5054 flow [2024-06-27 22:19:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-27 22:19:48,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225 [2024-06-27 22:19:48,958 INFO L175 Difference]: Start difference. First operand has 150 places, 267 transitions, 3696 flow. Second operand 8 states and 209 transitions. [2024-06-27 22:19:48,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 334 transitions, 5054 flow [2024-06-27 22:19:49,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 334 transitions, 4934 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:19:49,241 INFO L231 Difference]: Finished difference. Result has 156 places, 297 transitions, 4456 flow [2024-06-27 22:19:49,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3583, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4456, PETRI_PLACES=156, PETRI_TRANSITIONS=297} [2024-06-27 22:19:49,242 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 100 predicate places. [2024-06-27 22:19:49,242 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 297 transitions, 4456 flow [2024-06-27 22:19:49,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:49,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:49,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:49,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:19:49,246 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:49,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 449112829, now seen corresponding path program 1 times [2024-06-27 22:19:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726481090] [2024-06-27 22:19:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:51,161 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 22:19:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726481090] [2024-06-27 22:19:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726481090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:51,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:51,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637517871] [2024-06-27 22:19:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:51,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:51,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:51,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:51,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 297 transitions, 4456 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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 22:19:51,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:51,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:51,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:53,288 INFO L124 PetriNetUnfolderBase]: 6201/9888 cut-off events. [2024-06-27 22:19:53,289 INFO L125 PetriNetUnfolderBase]: For 133866/133879 co-relation queries the response was YES. [2024-06-27 22:19:53,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53615 conditions, 9888 events. 6201/9888 cut-off events. For 133866/133879 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 62632 event pairs, 1988 based on Foata normal form. 12/9711 useless extension candidates. Maximal degree in co-relation 53545. Up to 8062 conditions per place. [2024-06-27 22:19:53,395 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 214 selfloop transitions, 146 changer transitions 0/370 dead transitions. [2024-06-27 22:19:53,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 370 transitions, 5753 flow [2024-06-27 22:19:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-06-27 22:19:53,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2024-06-27 22:19:53,397 INFO L175 Difference]: Start difference. First operand has 156 places, 297 transitions, 4456 flow. Second operand 9 states and 237 transitions. [2024-06-27 22:19:53,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 370 transitions, 5753 flow [2024-06-27 22:19:53,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 370 transitions, 5583 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 22:19:53,593 INFO L231 Difference]: Finished difference. Result has 163 places, 325 transitions, 4927 flow [2024-06-27 22:19:53,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4286, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4927, PETRI_PLACES=163, PETRI_TRANSITIONS=325} [2024-06-27 22:19:53,593 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 107 predicate places. [2024-06-27 22:19:53,593 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 325 transitions, 4927 flow [2024-06-27 22:19:53,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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 22:19:53,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:53,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:53,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:19:53,594 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:53,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:53,594 INFO L85 PathProgramCache]: Analyzing trace with hash 449791512, now seen corresponding path program 5 times [2024-06-27 22:19:53,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761647991] [2024-06-27 22:19:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:55,548 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 22:19:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761647991] [2024-06-27 22:19:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761647991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:55,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961868727] [2024-06-27 22:19:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:55,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:19:55,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 325 transitions, 4927 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:55,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:55,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:19:55,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:57,708 INFO L124 PetriNetUnfolderBase]: 6252/9956 cut-off events. [2024-06-27 22:19:57,708 INFO L125 PetriNetUnfolderBase]: For 153683/153691 co-relation queries the response was YES. [2024-06-27 22:19:57,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57123 conditions, 9956 events. 6252/9956 cut-off events. For 153683/153691 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 63073 event pairs, 1968 based on Foata normal form. 8/9776 useless extension candidates. Maximal degree in co-relation 57050. Up to 8344 conditions per place. [2024-06-27 22:19:57,794 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 226 selfloop transitions, 136 changer transitions 0/372 dead transitions. [2024-06-27 22:19:57,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 372 transitions, 5996 flow [2024-06-27 22:19:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 22:19:57,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-06-27 22:19:57,803 INFO L175 Difference]: Start difference. First operand has 163 places, 325 transitions, 4927 flow. Second operand 8 states and 205 transitions. [2024-06-27 22:19:57,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 372 transitions, 5996 flow [2024-06-27 22:19:58,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 372 transitions, 5874 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:58,016 INFO L231 Difference]: Finished difference. Result has 169 places, 338 transitions, 5341 flow [2024-06-27 22:19:58,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4821, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5341, PETRI_PLACES=169, PETRI_TRANSITIONS=338} [2024-06-27 22:19:58,017 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 113 predicate places. [2024-06-27 22:19:58,017 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 338 transitions, 5341 flow [2024-06-27 22:19:58,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 22:19:58,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:58,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:58,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:19:58,018 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:58,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:58,018 INFO L85 PathProgramCache]: Analyzing trace with hash 618509754, now seen corresponding path program 1 times [2024-06-27 22:19:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:58,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240312144] [2024-06-27 22:19:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:58,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:00,259 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 22:20:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:00,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240312144] [2024-06-27 22:20:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240312144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:00,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055839633] [2024-06-27 22:20:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:00,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:20:00,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-27 22:20:00,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 338 transitions, 5341 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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 22:20:00,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:00,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-27 22:20:00,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:02,474 INFO L124 PetriNetUnfolderBase]: 7199/11352 cut-off events. [2024-06-27 22:20:02,479 INFO L125 PetriNetUnfolderBase]: For 179966/179966 co-relation queries the response was YES. [2024-06-27 22:20:02,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63678 conditions, 11352 events. 7199/11352 cut-off events. For 179966/179966 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 71651 event pairs, 2406 based on Foata normal form. 2/11139 useless extension candidates. Maximal degree in co-relation 63601. Up to 10091 conditions per place. [2024-06-27 22:20:02,596 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 347 selfloop transitions, 34 changer transitions 0/390 dead transitions. [2024-06-27 22:20:02,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 390 transitions, 6415 flow [2024-06-27 22:20:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-06-27 22:20:02,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 22:20:02,598 INFO L175 Difference]: Start difference. First operand has 169 places, 338 transitions, 5341 flow. Second operand 9 states and 205 transitions. [2024-06-27 22:20:02,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 390 transitions, 6415 flow [2024-06-27 22:20:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 390 transitions, 6239 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:02,984 INFO L231 Difference]: Finished difference. Result has 176 places, 351 transitions, 5438 flow [2024-06-27 22:20:02,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5165, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5438, PETRI_PLACES=176, PETRI_TRANSITIONS=351} [2024-06-27 22:20:02,985 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 120 predicate places. [2024-06-27 22:20:02,985 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 351 transitions, 5438 flow [2024-06-27 22:20:02,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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 22:20:02,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:02,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:02,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:20:02,986 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:02,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1679530898, now seen corresponding path program 1 times [2024-06-27 22:20:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574316611] [2024-06-27 22:20:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:05,296 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 22:20:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574316611] [2024-06-27 22:20:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574316611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:05,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:05,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:20:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395210330] [2024-06-27 22:20:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:05,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:20:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:05,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:20:05,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:20:05,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-27 22:20:05,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 351 transitions, 5438 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 22:20:05,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:05,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-27 22:20:05,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:07,616 INFO L124 PetriNetUnfolderBase]: 7730/12218 cut-off events. [2024-06-27 22:20:07,617 INFO L125 PetriNetUnfolderBase]: For 213203/213244 co-relation queries the response was YES. [2024-06-27 22:20:07,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69747 conditions, 12218 events. 7730/12218 cut-off events. For 213203/213244 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 78285 event pairs, 2592 based on Foata normal form. 7/11941 useless extension candidates. Maximal degree in co-relation 69667. Up to 10780 conditions per place. [2024-06-27 22:20:07,770 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 319 selfloop transitions, 32 changer transitions 0/387 dead transitions. [2024-06-27 22:20:07,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 387 transitions, 6380 flow [2024-06-27 22:20:07,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 197 transitions. [2024-06-27 22:20:07,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-27 22:20:07,772 INFO L175 Difference]: Start difference. First operand has 176 places, 351 transitions, 5438 flow. Second operand 9 states and 197 transitions. [2024-06-27 22:20:07,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 387 transitions, 6380 flow [2024-06-27 22:20:08,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 387 transitions, 6214 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-27 22:20:08,113 INFO L231 Difference]: Finished difference. Result has 179 places, 359 transitions, 5471 flow [2024-06-27 22:20:08,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5276, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5471, PETRI_PLACES=179, PETRI_TRANSITIONS=359} [2024-06-27 22:20:08,113 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 123 predicate places. [2024-06-27 22:20:08,113 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 359 transitions, 5471 flow [2024-06-27 22:20:08,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 22:20:08,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:08,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:08,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:20:08,114 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:08,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:08,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1218083734, now seen corresponding path program 1 times [2024-06-27 22:20:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:08,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735579545] [2024-06-27 22:20:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:10,199 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 22:20:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735579545] [2024-06-27 22:20:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735579545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418607332] [2024-06-27 22:20:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:10,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:10,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:10,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:10,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:10,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 359 transitions, 5471 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:10,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:10,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:10,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:12,554 INFO L124 PetriNetUnfolderBase]: 7391/12024 cut-off events. [2024-06-27 22:20:12,554 INFO L125 PetriNetUnfolderBase]: For 219053/219101 co-relation queries the response was YES. [2024-06-27 22:20:12,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69504 conditions, 12024 events. 7391/12024 cut-off events. For 219053/219101 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80480 event pairs, 2253 based on Foata normal form. 8/11685 useless extension candidates. Maximal degree in co-relation 69425. Up to 9927 conditions per place. [2024-06-27 22:20:12,682 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 321 selfloop transitions, 84 changer transitions 0/418 dead transitions. [2024-06-27 22:20:12,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 418 transitions, 6725 flow [2024-06-27 22:20:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:20:12,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 22:20:12,684 INFO L175 Difference]: Start difference. First operand has 179 places, 359 transitions, 5471 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:20:12,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 418 transitions, 6725 flow [2024-06-27 22:20:12,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 418 transitions, 6644 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:12,989 INFO L231 Difference]: Finished difference. Result has 186 places, 372 transitions, 5773 flow [2024-06-27 22:20:12,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5390, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5773, PETRI_PLACES=186, PETRI_TRANSITIONS=372} [2024-06-27 22:20:12,990 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 130 predicate places. [2024-06-27 22:20:12,990 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 372 transitions, 5773 flow [2024-06-27 22:20:12,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:12,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:12,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:12,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:20:12,991 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:12,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1375910110, now seen corresponding path program 2 times [2024-06-27 22:20:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621017030] [2024-06-27 22:20:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:12,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:15,066 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 22:20:15,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:15,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621017030] [2024-06-27 22:20:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621017030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888203847] [2024-06-27 22:20:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:15,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:15,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:15,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:15,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 372 transitions, 5773 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:15,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:15,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:15,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:17,410 INFO L124 PetriNetUnfolderBase]: 7428/12088 cut-off events. [2024-06-27 22:20:17,410 INFO L125 PetriNetUnfolderBase]: For 234969/235017 co-relation queries the response was YES. [2024-06-27 22:20:17,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71511 conditions, 12088 events. 7428/12088 cut-off events. For 234969/235017 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 81046 event pairs, 2285 based on Foata normal form. 8/11745 useless extension candidates. Maximal degree in co-relation 71427. Up to 10118 conditions per place. [2024-06-27 22:20:17,551 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 321 selfloop transitions, 81 changer transitions 0/415 dead transitions. [2024-06-27 22:20:17,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 415 transitions, 6800 flow [2024-06-27 22:20:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 22:20:17,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-06-27 22:20:17,552 INFO L175 Difference]: Start difference. First operand has 186 places, 372 transitions, 5773 flow. Second operand 8 states and 204 transitions. [2024-06-27 22:20:17,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 415 transitions, 6800 flow [2024-06-27 22:20:18,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 415 transitions, 6684 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:18,069 INFO L231 Difference]: Finished difference. Result has 192 places, 375 transitions, 5913 flow [2024-06-27 22:20:18,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5669, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5913, PETRI_PLACES=192, PETRI_TRANSITIONS=375} [2024-06-27 22:20:18,070 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 136 predicate places. [2024-06-27 22:20:18,070 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 375 transitions, 5913 flow [2024-06-27 22:20:18,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:18,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:18,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:18,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:20:18,070 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:18,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1375910234, now seen corresponding path program 1 times [2024-06-27 22:20:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419236636] [2024-06-27 22:20:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:20,229 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 22:20:20,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:20,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419236636] [2024-06-27 22:20:20,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419236636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:20,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819038126] [2024-06-27 22:20:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:20,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:20,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:20,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:20,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:20,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 375 transitions, 5913 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:20,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:20,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:20,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:22,564 INFO L124 PetriNetUnfolderBase]: 7491/12190 cut-off events. [2024-06-27 22:20:22,565 INFO L125 PetriNetUnfolderBase]: For 245504/245549 co-relation queries the response was YES. [2024-06-27 22:20:22,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72789 conditions, 12190 events. 7491/12190 cut-off events. For 245504/245549 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 81836 event pairs, 2266 based on Foata normal form. 4/11838 useless extension candidates. Maximal degree in co-relation 72702. Up to 9875 conditions per place. [2024-06-27 22:20:22,708 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 279 selfloop transitions, 135 changer transitions 0/427 dead transitions. [2024-06-27 22:20:22,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 427 transitions, 7205 flow [2024-06-27 22:20:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-27 22:20:22,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225 [2024-06-27 22:20:22,710 INFO L175 Difference]: Start difference. First operand has 192 places, 375 transitions, 5913 flow. Second operand 8 states and 209 transitions. [2024-06-27 22:20:22,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 427 transitions, 7205 flow [2024-06-27 22:20:23,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 427 transitions, 7039 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:23,105 INFO L231 Difference]: Finished difference. Result has 196 places, 384 transitions, 6287 flow [2024-06-27 22:20:23,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5747, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6287, PETRI_PLACES=196, PETRI_TRANSITIONS=384} [2024-06-27 22:20:23,105 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 140 predicate places. [2024-06-27 22:20:23,105 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 384 transitions, 6287 flow [2024-06-27 22:20:23,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:23,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:23,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:23,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:20:23,106 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:23,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1489533914, now seen corresponding path program 2 times [2024-06-27 22:20:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:23,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417734549] [2024-06-27 22:20:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:25,187 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 22:20:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417734549] [2024-06-27 22:20:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417734549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:25,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:25,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936746909] [2024-06-27 22:20:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:25,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:25,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:25,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:25,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:25,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 384 transitions, 6287 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:25,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:25,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:25,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:27,533 INFO L124 PetriNetUnfolderBase]: 7570/12311 cut-off events. [2024-06-27 22:20:27,533 INFO L125 PetriNetUnfolderBase]: For 266862/266907 co-relation queries the response was YES. [2024-06-27 22:20:27,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76173 conditions, 12311 events. 7570/12311 cut-off events. For 266862/266907 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 82572 event pairs, 2244 based on Foata normal form. 4/11956 useless extension candidates. Maximal degree in co-relation 76084. Up to 10159 conditions per place. [2024-06-27 22:20:27,674 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 285 selfloop transitions, 146 changer transitions 0/444 dead transitions. [2024-06-27 22:20:27,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 444 transitions, 7735 flow [2024-06-27 22:20:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-27 22:20:27,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-06-27 22:20:27,677 INFO L175 Difference]: Start difference. First operand has 196 places, 384 transitions, 6287 flow. Second operand 8 states and 206 transitions. [2024-06-27 22:20:27,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 444 transitions, 7735 flow [2024-06-27 22:20:28,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 444 transitions, 7633 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:28,128 INFO L231 Difference]: Finished difference. Result has 201 places, 403 transitions, 6895 flow [2024-06-27 22:20:28,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=6203, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6895, PETRI_PLACES=201, PETRI_TRANSITIONS=403} [2024-06-27 22:20:28,129 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 145 predicate places. [2024-06-27 22:20:28,129 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 403 transitions, 6895 flow [2024-06-27 22:20:28,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:28,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:28,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:28,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:20:28,130 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:28,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1489529140, now seen corresponding path program 3 times [2024-06-27 22:20:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207744947] [2024-06-27 22:20:28,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:30,334 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 22:20:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207744947] [2024-06-27 22:20:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207744947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249184059] [2024-06-27 22:20:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:30,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:30,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:30,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 403 transitions, 6895 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:30,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:30,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:30,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:32,718 INFO L124 PetriNetUnfolderBase]: 7562/12297 cut-off events. [2024-06-27 22:20:32,719 INFO L125 PetriNetUnfolderBase]: For 280968/281016 co-relation queries the response was YES. [2024-06-27 22:20:32,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77114 conditions, 12297 events. 7562/12297 cut-off events. For 280968/281016 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 82477 event pairs, 2235 based on Foata normal form. 8/11947 useless extension candidates. Maximal degree in co-relation 77023. Up to 10381 conditions per place. [2024-06-27 22:20:32,878 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 353 selfloop transitions, 78 changer transitions 0/444 dead transitions. [2024-06-27 22:20:32,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 444 transitions, 7948 flow [2024-06-27 22:20:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-06-27 22:20:32,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075 [2024-06-27 22:20:32,879 INFO L175 Difference]: Start difference. First operand has 201 places, 403 transitions, 6895 flow. Second operand 8 states and 203 transitions. [2024-06-27 22:20:32,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 444 transitions, 7948 flow [2024-06-27 22:20:33,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 444 transitions, 7626 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:33,497 INFO L231 Difference]: Finished difference. Result has 204 places, 403 transitions, 6738 flow [2024-06-27 22:20:33,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=6573, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6738, PETRI_PLACES=204, PETRI_TRANSITIONS=403} [2024-06-27 22:20:33,498 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 148 predicate places. [2024-06-27 22:20:33,498 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 403 transitions, 6738 flow [2024-06-27 22:20:33,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:33,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:33,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:33,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:20:33,498 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:33,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1378706744, now seen corresponding path program 3 times [2024-06-27 22:20:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:33,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18584449] [2024-06-27 22:20:33,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:33,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:35,650 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 22:20:35,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18584449] [2024-06-27 22:20:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18584449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:35,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248722666] [2024-06-27 22:20:35,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:35,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:35,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:35,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:35,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:35,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 403 transitions, 6738 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:35,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:35,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:35,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:38,142 INFO L124 PetriNetUnfolderBase]: 7585/12328 cut-off events. [2024-06-27 22:20:38,143 INFO L125 PetriNetUnfolderBase]: For 288646/288691 co-relation queries the response was YES. [2024-06-27 22:20:38,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77358 conditions, 12328 events. 7585/12328 cut-off events. For 288646/288691 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 82703 event pairs, 2250 based on Foata normal form. 4/11972 useless extension candidates. Maximal degree in co-relation 77266. Up to 10132 conditions per place. [2024-06-27 22:20:38,297 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 283 selfloop transitions, 154 changer transitions 0/450 dead transitions. [2024-06-27 22:20:38,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 450 transitions, 7923 flow [2024-06-27 22:20:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-27 22:20:38,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175 [2024-06-27 22:20:38,315 INFO L175 Difference]: Start difference. First operand has 204 places, 403 transitions, 6738 flow. Second operand 8 states and 207 transitions. [2024-06-27 22:20:38,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 450 transitions, 7923 flow [2024-06-27 22:20:38,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 450 transitions, 7764 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:20:38,747 INFO L231 Difference]: Finished difference. Result has 206 places, 406 transitions, 6957 flow [2024-06-27 22:20:38,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=6579, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6957, PETRI_PLACES=206, PETRI_TRANSITIONS=406} [2024-06-27 22:20:38,748 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 150 predicate places. [2024-06-27 22:20:38,748 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 406 transitions, 6957 flow [2024-06-27 22:20:38,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:38,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:38,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:38,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:20:38,748 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:38,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1493997914, now seen corresponding path program 4 times [2024-06-27 22:20:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278769316] [2024-06-27 22:20:38,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:41,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 22:20:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278769316] [2024-06-27 22:20:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278769316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:41,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:41,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232065828] [2024-06-27 22:20:41,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:41,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:41,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:41,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:41,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:41,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 406 transitions, 6957 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:41,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:41,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:41,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:43,455 INFO L124 PetriNetUnfolderBase]: 7608/12369 cut-off events. [2024-06-27 22:20:43,455 INFO L125 PetriNetUnfolderBase]: For 300029/300074 co-relation queries the response was YES. [2024-06-27 22:20:43,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78349 conditions, 12369 events. 7608/12369 cut-off events. For 300029/300074 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 83067 event pairs, 2250 based on Foata normal form. 4/12014 useless extension candidates. Maximal degree in co-relation 78256. Up to 10093 conditions per place. [2024-06-27 22:20:43,841 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 283 selfloop transitions, 163 changer transitions 0/459 dead transitions. [2024-06-27 22:20:43,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 459 transitions, 8334 flow [2024-06-27 22:20:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:20:43,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-27 22:20:43,842 INFO L175 Difference]: Start difference. First operand has 206 places, 406 transitions, 6957 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:20:43,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 459 transitions, 8334 flow [2024-06-27 22:20:44,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 459 transitions, 8002 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 22:20:44,227 INFO L231 Difference]: Finished difference. Result has 209 places, 412 transitions, 7168 flow [2024-06-27 22:20:44,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=6629, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7168, PETRI_PLACES=209, PETRI_TRANSITIONS=412} [2024-06-27 22:20:44,227 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 153 predicate places. [2024-06-27 22:20:44,227 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 412 transitions, 7168 flow [2024-06-27 22:20:44,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:44,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:44,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:44,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:20:44,228 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:44,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1494175544, now seen corresponding path program 5 times [2024-06-27 22:20:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505895215] [2024-06-27 22:20:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:46,163 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 22:20:46,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:46,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505895215] [2024-06-27 22:20:46,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505895215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:46,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:46,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:46,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502881975] [2024-06-27 22:20:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:46,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:46,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:46,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:46,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:46,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 412 transitions, 7168 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:46,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:46,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:46,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:48,649 INFO L124 PetriNetUnfolderBase]: 7646/12429 cut-off events. [2024-06-27 22:20:48,649 INFO L125 PetriNetUnfolderBase]: For 315869/315914 co-relation queries the response was YES. [2024-06-27 22:20:48,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80006 conditions, 12429 events. 7646/12429 cut-off events. For 315869/315914 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 83429 event pairs, 2242 based on Foata normal form. 4/12073 useless extension candidates. Maximal degree in co-relation 79911. Up to 10259 conditions per place. [2024-06-27 22:20:48,825 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 295 selfloop transitions, 163 changer transitions 0/471 dead transitions. [2024-06-27 22:20:48,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 471 transitions, 8668 flow [2024-06-27 22:20:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 22:20:48,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-06-27 22:20:48,827 INFO L175 Difference]: Start difference. First operand has 209 places, 412 transitions, 7168 flow. Second operand 8 states and 205 transitions. [2024-06-27 22:20:48,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 471 transitions, 8668 flow [2024-06-27 22:20:49,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 471 transitions, 8405 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:49,360 INFO L231 Difference]: Finished difference. Result has 214 places, 431 transitions, 7706 flow [2024-06-27 22:20:49,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=6938, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7706, PETRI_PLACES=214, PETRI_TRANSITIONS=431} [2024-06-27 22:20:49,361 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 158 predicate places. [2024-06-27 22:20:49,361 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 431 transitions, 7706 flow [2024-06-27 22:20:49,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:49,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:49,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:49,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:20:49,362 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:49,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1336236638, now seen corresponding path program 6 times [2024-06-27 22:20:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44524413] [2024-06-27 22:20:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:51,247 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 22:20:51,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44524413] [2024-06-27 22:20:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44524413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:51,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:51,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230787364] [2024-06-27 22:20:51,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:51,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:51,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:51,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:51,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:51,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:51,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 431 transitions, 7706 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:51,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:51,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:51,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:53,805 INFO L124 PetriNetUnfolderBase]: 7669/12466 cut-off events. [2024-06-27 22:20:53,805 INFO L125 PetriNetUnfolderBase]: For 326785/326830 co-relation queries the response was YES. [2024-06-27 22:20:53,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80435 conditions, 12466 events. 7669/12466 cut-off events. For 326785/326830 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 83721 event pairs, 2245 based on Foata normal form. 4/12110 useless extension candidates. Maximal degree in co-relation 80338. Up to 10291 conditions per place. [2024-06-27 22:20:54,010 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 292 selfloop transitions, 172 changer transitions 0/477 dead transitions. [2024-06-27 22:20:54,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 477 transitions, 8932 flow [2024-06-27 22:20:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-06-27 22:20:54,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:20:54,012 INFO L175 Difference]: Start difference. First operand has 214 places, 431 transitions, 7706 flow. Second operand 9 states and 220 transitions. [2024-06-27 22:20:54,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 477 transitions, 8932 flow [2024-06-27 22:20:54,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 477 transitions, 8691 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:54,632 INFO L231 Difference]: Finished difference. Result has 219 places, 434 transitions, 7893 flow [2024-06-27 22:20:54,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7465, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7893, PETRI_PLACES=219, PETRI_TRANSITIONS=434} [2024-06-27 22:20:54,633 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 163 predicate places. [2024-06-27 22:20:54,633 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 434 transitions, 7893 flow [2024-06-27 22:20:54,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:54,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:54,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:54,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:20:54,634 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:54,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1336236824, now seen corresponding path program 1 times [2024-06-27 22:20:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:54,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741971371] [2024-06-27 22:20:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:56,227 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 22:20:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741971371] [2024-06-27 22:20:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741971371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:56,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:56,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243734649] [2024-06-27 22:20:56,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:56,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:56,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:56,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:56,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:20:56,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 434 transitions, 7893 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:56,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:56,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:20:56,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:58,795 INFO L124 PetriNetUnfolderBase]: 7864/12861 cut-off events. [2024-06-27 22:20:58,796 INFO L125 PetriNetUnfolderBase]: For 352341/352387 co-relation queries the response was YES. [2024-06-27 22:20:58,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83213 conditions, 12861 events. 7864/12861 cut-off events. For 352341/352387 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 87623 event pairs, 2184 based on Foata normal form. 5/12458 useless extension candidates. Maximal degree in co-relation 83115. Up to 10150 conditions per place. [2024-06-27 22:20:58,947 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 352 selfloop transitions, 145 changer transitions 0/510 dead transitions. [2024-06-27 22:20:58,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 510 transitions, 9768 flow [2024-06-27 22:20:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 22:20:58,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-27 22:20:58,949 INFO L175 Difference]: Start difference. First operand has 219 places, 434 transitions, 7893 flow. Second operand 8 states and 216 transitions. [2024-06-27 22:20:58,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 510 transitions, 9768 flow [2024-06-27 22:20:59,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 510 transitions, 9402 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-27 22:20:59,514 INFO L231 Difference]: Finished difference. Result has 222 places, 448 transitions, 8145 flow [2024-06-27 22:20:59,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7527, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8145, PETRI_PLACES=222, PETRI_TRANSITIONS=448} [2024-06-27 22:20:59,515 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 166 predicate places. [2024-06-27 22:20:59,515 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 448 transitions, 8145 flow [2024-06-27 22:20:59,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:20:59,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:59,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:59,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:20:59,516 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:59,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1336416314, now seen corresponding path program 2 times [2024-06-27 22:20:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915439178] [2024-06-27 22:20:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:01,134 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 22:21:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:01,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915439178] [2024-06-27 22:21:01,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915439178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:01,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:01,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163099347] [2024-06-27 22:21:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:01,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:01,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:01,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:01,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:01,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 448 transitions, 8145 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:01,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:01,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:01,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:03,828 INFO L124 PetriNetUnfolderBase]: 8101/13249 cut-off events. [2024-06-27 22:21:03,828 INFO L125 PetriNetUnfolderBase]: For 384652/384698 co-relation queries the response was YES. [2024-06-27 22:21:03,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88088 conditions, 13249 events. 8101/13249 cut-off events. For 384652/384698 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 90608 event pairs, 2181 based on Foata normal form. 5/12834 useless extension candidates. Maximal degree in co-relation 87988. Up to 10309 conditions per place. [2024-06-27 22:21:04,010 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 362 selfloop transitions, 158 changer transitions 0/533 dead transitions. [2024-06-27 22:21:04,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 533 transitions, 10184 flow [2024-06-27 22:21:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-06-27 22:21:04,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535 [2024-06-27 22:21:04,016 INFO L175 Difference]: Start difference. First operand has 222 places, 448 transitions, 8145 flow. Second operand 8 states and 214 transitions. [2024-06-27 22:21:04,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 533 transitions, 10184 flow [2024-06-27 22:21:04,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 533 transitions, 10104 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-27 22:21:04,706 INFO L231 Difference]: Finished difference. Result has 229 places, 468 transitions, 8781 flow [2024-06-27 22:21:04,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8071, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8781, PETRI_PLACES=229, PETRI_TRANSITIONS=468} [2024-06-27 22:21:04,707 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 173 predicate places. [2024-06-27 22:21:04,707 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 468 transitions, 8781 flow [2024-06-27 22:21:04,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:04,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:04,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:04,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:21:04,708 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:04,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1336409804, now seen corresponding path program 3 times [2024-06-27 22:21:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062513536] [2024-06-27 22:21:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:06,481 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 22:21:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:06,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062513536] [2024-06-27 22:21:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062513536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369905090] [2024-06-27 22:21:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:06,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:06,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:06,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:06,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 468 transitions, 8781 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:06,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:06,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:06,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:09,197 INFO L124 PetriNetUnfolderBase]: 8088/13231 cut-off events. [2024-06-27 22:21:09,197 INFO L125 PetriNetUnfolderBase]: For 398760/398826 co-relation queries the response was YES. [2024-06-27 22:21:09,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89229 conditions, 13231 events. 8088/13231 cut-off events. For 398760/398826 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 90499 event pairs, 2178 based on Foata normal form. 25/12837 useless extension candidates. Maximal degree in co-relation 89125. Up to 10299 conditions per place. [2024-06-27 22:21:09,403 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 378 selfloop transitions, 153 changer transitions 0/544 dead transitions. [2024-06-27 22:21:09,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 544 transitions, 10624 flow [2024-06-27 22:21:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 22:21:09,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-27 22:21:09,404 INFO L175 Difference]: Start difference. First operand has 229 places, 468 transitions, 8781 flow. Second operand 8 states and 216 transitions. [2024-06-27 22:21:09,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 544 transitions, 10624 flow [2024-06-27 22:21:10,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 544 transitions, 10330 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:10,351 INFO L231 Difference]: Finished difference. Result has 233 places, 468 transitions, 8809 flow [2024-06-27 22:21:10,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8487, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8809, PETRI_PLACES=233, PETRI_TRANSITIONS=468} [2024-06-27 22:21:10,351 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 177 predicate places. [2024-06-27 22:21:10,352 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 468 transitions, 8809 flow [2024-06-27 22:21:10,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:10,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:10,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:21:10,352 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:10,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 874420424, now seen corresponding path program 4 times [2024-06-27 22:21:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288430079] [2024-06-27 22:21:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:11,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 22:21:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288430079] [2024-06-27 22:21:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288430079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133982604] [2024-06-27 22:21:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:11,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:11,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:11,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 468 transitions, 8809 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:11,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:11,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:11,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:14,877 INFO L124 PetriNetUnfolderBase]: 8252/13391 cut-off events. [2024-06-27 22:21:14,877 INFO L125 PetriNetUnfolderBase]: For 416162/416208 co-relation queries the response was YES. [2024-06-27 22:21:14,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90924 conditions, 13391 events. 8252/13391 cut-off events. For 416162/416208 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 90670 event pairs, 2179 based on Foata normal form. 7/13017 useless extension candidates. Maximal degree in co-relation 90819. Up to 11344 conditions per place. [2024-06-27 22:21:15,049 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 452 selfloop transitions, 75 changer transitions 0/540 dead transitions. [2024-06-27 22:21:15,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 540 transitions, 10692 flow [2024-06-27 22:21:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-27 22:21:15,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2024-06-27 22:21:15,051 INFO L175 Difference]: Start difference. First operand has 233 places, 468 transitions, 8809 flow. Second operand 8 states and 202 transitions. [2024-06-27 22:21:15,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 540 transitions, 10692 flow [2024-06-27 22:21:15,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 540 transitions, 10417 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 22:21:15,906 INFO L231 Difference]: Finished difference. Result has 237 places, 499 transitions, 9084 flow [2024-06-27 22:21:15,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8554, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9084, PETRI_PLACES=237, PETRI_TRANSITIONS=499} [2024-06-27 22:21:15,907 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 181 predicate places. [2024-06-27 22:21:15,907 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 499 transitions, 9084 flow [2024-06-27 22:21:15,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:15,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:15,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:15,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:21:15,907 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:15,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1984422866, now seen corresponding path program 7 times [2024-06-27 22:21:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837608849] [2024-06-27 22:21:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:17,740 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 22:21:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837608849] [2024-06-27 22:21:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837608849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:17,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520500098] [2024-06-27 22:21:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:17,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:17,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:17,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:17,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 499 transitions, 9084 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:17,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:17,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:17,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:20,598 INFO L124 PetriNetUnfolderBase]: 8247/13385 cut-off events. [2024-06-27 22:21:20,598 INFO L125 PetriNetUnfolderBase]: For 424494/424540 co-relation queries the response was YES. [2024-06-27 22:21:20,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90744 conditions, 13385 events. 8247/13385 cut-off events. For 424494/424540 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 90575 event pairs, 2166 based on Foata normal form. 6/13010 useless extension candidates. Maximal degree in co-relation 90637. Up to 11483 conditions per place. [2024-06-27 22:21:20,780 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 477 selfloop transitions, 49 changer transitions 0/539 dead transitions. [2024-06-27 22:21:20,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 539 transitions, 10338 flow [2024-06-27 22:21:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 22:21:20,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975 [2024-06-27 22:21:20,782 INFO L175 Difference]: Start difference. First operand has 237 places, 499 transitions, 9084 flow. Second operand 8 states and 199 transitions. [2024-06-27 22:21:20,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 539 transitions, 10338 flow [2024-06-27 22:21:21,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 539 transitions, 10166 flow, removed 51 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:21,666 INFO L231 Difference]: Finished difference. Result has 241 places, 499 transitions, 9021 flow [2024-06-27 22:21:21,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8912, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9021, PETRI_PLACES=241, PETRI_TRANSITIONS=499} [2024-06-27 22:21:21,667 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 185 predicate places. [2024-06-27 22:21:21,667 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 499 transitions, 9021 flow [2024-06-27 22:21:21,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:21,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:21,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:21,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:21:21,668 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:21,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1984423052, now seen corresponding path program 5 times [2024-06-27 22:21:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813719208] [2024-06-27 22:21:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:23,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 22:21:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813719208] [2024-06-27 22:21:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813719208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023739642] [2024-06-27 22:21:23,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:23,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:23,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:23,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:23,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 499 transitions, 9021 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:23,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:23,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:23,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:26,031 INFO L124 PetriNetUnfolderBase]: 8235/13363 cut-off events. [2024-06-27 22:21:26,031 INFO L125 PetriNetUnfolderBase]: For 434531/434577 co-relation queries the response was YES. [2024-06-27 22:21:26,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90590 conditions, 13363 events. 8235/13363 cut-off events. For 434531/434577 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 90430 event pairs, 2166 based on Foata normal form. 7/12988 useless extension candidates. Maximal degree in co-relation 90482. Up to 11325 conditions per place. [2024-06-27 22:21:26,253 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 451 selfloop transitions, 76 changer transitions 0/540 dead transitions. [2024-06-27 22:21:26,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 540 transitions, 10445 flow [2024-06-27 22:21:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 22:21:26,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975 [2024-06-27 22:21:26,255 INFO L175 Difference]: Start difference. First operand has 241 places, 499 transitions, 9021 flow. Second operand 8 states and 199 transitions. [2024-06-27 22:21:26,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 540 transitions, 10445 flow [2024-06-27 22:21:27,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 540 transitions, 10181 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 22:21:27,234 INFO L231 Difference]: Finished difference. Result has 243 places, 499 transitions, 8924 flow [2024-06-27 22:21:27,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8757, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8924, PETRI_PLACES=243, PETRI_TRANSITIONS=499} [2024-06-27 22:21:27,235 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 187 predicate places. [2024-06-27 22:21:27,235 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 499 transitions, 8924 flow [2024-06-27 22:21:27,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:27,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:27,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:21:27,236 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:27,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1993597502, now seen corresponding path program 6 times [2024-06-27 22:21:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793705772] [2024-06-27 22:21:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:28,591 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 22:21:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793705772] [2024-06-27 22:21:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793705772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:28,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:28,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533620163] [2024-06-27 22:21:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:28,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:28,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 499 transitions, 8924 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:28,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:28,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:28,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:31,572 INFO L124 PetriNetUnfolderBase]: 8289/13461 cut-off events. [2024-06-27 22:21:31,572 INFO L125 PetriNetUnfolderBase]: For 449719/449765 co-relation queries the response was YES. [2024-06-27 22:21:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91411 conditions, 13461 events. 8289/13461 cut-off events. For 449719/449765 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 91318 event pairs, 2199 based on Foata normal form. 12/13086 useless extension candidates. Maximal degree in co-relation 91303. Up to 11452 conditions per place. [2024-06-27 22:21:31,760 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 502 selfloop transitions, 34 changer transitions 0/549 dead transitions. [2024-06-27 22:21:31,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 549 transitions, 10508 flow [2024-06-27 22:21:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 22:21:31,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:21:31,762 INFO L175 Difference]: Start difference. First operand has 243 places, 499 transitions, 8924 flow. Second operand 8 states and 200 transitions. [2024-06-27 22:21:31,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 549 transitions, 10508 flow [2024-06-27 22:21:32,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 549 transitions, 10406 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:32,467 INFO L231 Difference]: Finished difference. Result has 248 places, 505 transitions, 9051 flow [2024-06-27 22:21:32,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8822, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9051, PETRI_PLACES=248, PETRI_TRANSITIONS=505} [2024-06-27 22:21:32,468 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 192 predicate places. [2024-06-27 22:21:32,468 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 505 transitions, 9051 flow [2024-06-27 22:21:32,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:32,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:32,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:32,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:21:32,469 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:32,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash -183815186, now seen corresponding path program 4 times [2024-06-27 22:21:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:32,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252887062] [2024-06-27 22:21:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:34,548 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 22:21:34,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:34,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252887062] [2024-06-27 22:21:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252887062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:34,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:34,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053235648] [2024-06-27 22:21:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:34,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:34,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:34,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 505 transitions, 9051 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:34,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:34,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:34,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:37,286 INFO L124 PetriNetUnfolderBase]: 8161/13145 cut-off events. [2024-06-27 22:21:37,286 INFO L125 PetriNetUnfolderBase]: For 467741/467830 co-relation queries the response was YES. [2024-06-27 22:21:37,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89510 conditions, 13145 events. 8161/13145 cut-off events. For 467741/467830 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 87831 event pairs, 2140 based on Foata normal form. 18/12734 useless extension candidates. Maximal degree in co-relation 89400. Up to 10643 conditions per place. [2024-06-27 22:21:37,519 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 421 selfloop transitions, 116 changer transitions 0/553 dead transitions. [2024-06-27 22:21:37,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 553 transitions, 10569 flow [2024-06-27 22:21:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:21:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:21:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-06-27 22:21:37,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2024-06-27 22:21:37,520 INFO L175 Difference]: Start difference. First operand has 248 places, 505 transitions, 9051 flow. Second operand 7 states and 192 transitions. [2024-06-27 22:21:37,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 553 transitions, 10569 flow [2024-06-27 22:21:38,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 553 transitions, 10454 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 22:21:38,468 INFO L231 Difference]: Finished difference. Result has 250 places, 509 transitions, 9278 flow [2024-06-27 22:21:38,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8936, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9278, PETRI_PLACES=250, PETRI_TRANSITIONS=509} [2024-06-27 22:21:38,468 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 194 predicate places. [2024-06-27 22:21:38,469 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 509 transitions, 9278 flow [2024-06-27 22:21:38,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:38,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:38,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:38,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:21:38,469 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:38,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1031332118, now seen corresponding path program 8 times [2024-06-27 22:21:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266510040] [2024-06-27 22:21:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:40,673 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 22:21:40,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266510040] [2024-06-27 22:21:40,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266510040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:40,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:40,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:40,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925193367] [2024-06-27 22:21:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:40,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:40,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:40,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:40,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:40,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 509 transitions, 9278 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:21:40,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:40,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:40,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:43,186 INFO L124 PetriNetUnfolderBase]: 7661/12638 cut-off events. [2024-06-27 22:21:43,186 INFO L125 PetriNetUnfolderBase]: For 470364/470432 co-relation queries the response was YES. [2024-06-27 22:21:43,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87459 conditions, 12638 events. 7661/12638 cut-off events. For 470364/470432 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 87512 event pairs, 1949 based on Foata normal form. 9/12219 useless extension candidates. Maximal degree in co-relation 87350. Up to 9688 conditions per place. [2024-06-27 22:21:43,366 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 336 selfloop transitions, 207 changer transitions 0/561 dead transitions. [2024-06-27 22:21:43,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 561 transitions, 10916 flow [2024-06-27 22:21:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-06-27 22:21:43,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535 [2024-06-27 22:21:43,367 INFO L175 Difference]: Start difference. First operand has 250 places, 509 transitions, 9278 flow. Second operand 8 states and 214 transitions. [2024-06-27 22:21:43,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 561 transitions, 10916 flow [2024-06-27 22:21:44,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 561 transitions, 10740 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:44,326 INFO L231 Difference]: Finished difference. Result has 255 places, 518 transitions, 9865 flow [2024-06-27 22:21:44,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9106, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9865, PETRI_PLACES=255, PETRI_TRANSITIONS=518} [2024-06-27 22:21:44,330 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 199 predicate places. [2024-06-27 22:21:44,330 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 518 transitions, 9865 flow [2024-06-27 22:21:44,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:21:44,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:44,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:44,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:21:44,330 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:44,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -183754736, now seen corresponding path program 5 times [2024-06-27 22:21:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553362352] [2024-06-27 22:21:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:46,334 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 22:21:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553362352] [2024-06-27 22:21:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553362352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:46,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254620123] [2024-06-27 22:21:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:46,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:46,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:21:46,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 518 transitions, 9865 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:46,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:46,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:21:46,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:49,213 INFO L124 PetriNetUnfolderBase]: 8219/13235 cut-off events. [2024-06-27 22:21:49,213 INFO L125 PetriNetUnfolderBase]: For 498259/498348 co-relation queries the response was YES. [2024-06-27 22:21:49,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93667 conditions, 13235 events. 8219/13235 cut-off events. For 498259/498348 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 88535 event pairs, 2557 based on Foata normal form. 18/12817 useless extension candidates. Maximal degree in co-relation 93555. Up to 10989 conditions per place. [2024-06-27 22:21:49,393 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 438 selfloop transitions, 107 changer transitions 0/561 dead transitions. [2024-06-27 22:21:49,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 561 transitions, 11177 flow [2024-06-27 22:21:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:21:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:21:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2024-06-27 22:21:49,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-27 22:21:49,395 INFO L175 Difference]: Start difference. First operand has 255 places, 518 transitions, 9865 flow. Second operand 7 states and 189 transitions. [2024-06-27 22:21:49,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 561 transitions, 11177 flow [2024-06-27 22:21:50,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 561 transitions, 11092 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:50,084 INFO L231 Difference]: Finished difference. Result has 258 places, 520 transitions, 10045 flow [2024-06-27 22:21:50,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9780, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10045, PETRI_PLACES=258, PETRI_TRANSITIONS=520} [2024-06-27 22:21:50,085 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 202 predicate places. [2024-06-27 22:21:50,085 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 520 transitions, 10045 flow [2024-06-27 22:21:50,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:21:50,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:50,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:50,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:21:50,085 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:50,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash 420526838, now seen corresponding path program 9 times [2024-06-27 22:21:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418085905] [2024-06-27 22:21:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:52,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418085905] [2024-06-27 22:21:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418085905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640156577] [2024-06-27 22:21:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:52,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:52,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:52,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:52,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:52,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 520 transitions, 10045 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:21:52,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:52,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:55,018 INFO L124 PetriNetUnfolderBase]: 7733/12760 cut-off events. [2024-06-27 22:21:55,018 INFO L125 PetriNetUnfolderBase]: For 490810/490883 co-relation queries the response was YES. [2024-06-27 22:21:55,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91425 conditions, 12760 events. 7733/12760 cut-off events. For 490810/490883 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 88538 event pairs, 2230 based on Foata normal form. 13/12329 useless extension candidates. Maximal degree in co-relation 91313. Up to 10163 conditions per place. [2024-06-27 22:21:55,233 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 349 selfloop transitions, 200 changer transitions 0/567 dead transitions. [2024-06-27 22:21:55,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 567 transitions, 11499 flow [2024-06-27 22:21:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-27 22:21:55,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225 [2024-06-27 22:21:55,235 INFO L175 Difference]: Start difference. First operand has 258 places, 520 transitions, 10045 flow. Second operand 8 states and 209 transitions. [2024-06-27 22:21:55,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 567 transitions, 11499 flow [2024-06-27 22:21:56,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 567 transitions, 11272 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:21:56,124 INFO L231 Difference]: Finished difference. Result has 261 places, 530 transitions, 10481 flow [2024-06-27 22:21:56,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9818, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10481, PETRI_PLACES=261, PETRI_TRANSITIONS=530} [2024-06-27 22:21:56,125 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 205 predicate places. [2024-06-27 22:21:56,125 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 530 transitions, 10481 flow [2024-06-27 22:21:56,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:21:56,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:56,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:56,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:21:56,126 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:56,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -180958102, now seen corresponding path program 10 times [2024-06-27 22:21:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699743170] [2024-06-27 22:21:56,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:58,014 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 22:21:58,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699743170] [2024-06-27 22:21:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699743170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:58,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:58,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:58,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905566917] [2024-06-27 22:21:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:58,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:58,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:58,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 530 transitions, 10481 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:21:58,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:58,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:58,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:00,806 INFO L124 PetriNetUnfolderBase]: 7749/12771 cut-off events. [2024-06-27 22:22:00,807 INFO L125 PetriNetUnfolderBase]: For 494973/495046 co-relation queries the response was YES. [2024-06-27 22:22:00,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92297 conditions, 12771 events. 7749/12771 cut-off events. For 494973/495046 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 88571 event pairs, 1923 based on Foata normal form. 13/12346 useless extension candidates. Maximal degree in co-relation 92183. Up to 10096 conditions per place. [2024-06-27 22:22:01,019 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 343 selfloop transitions, 211 changer transitions 0/572 dead transitions. [2024-06-27 22:22:01,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 572 transitions, 11836 flow [2024-06-27 22:22:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:22:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:22:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 22:22:01,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 22:22:01,024 INFO L175 Difference]: Start difference. First operand has 261 places, 530 transitions, 10481 flow. Second operand 8 states and 210 transitions. [2024-06-27 22:22:01,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 572 transitions, 11836 flow [2024-06-27 22:22:02,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 572 transitions, 11419 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 22:22:02,179 INFO L231 Difference]: Finished difference. Result has 263 places, 533 transitions, 10568 flow [2024-06-27 22:22:02,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=10064, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10568, PETRI_PLACES=263, PETRI_TRANSITIONS=533} [2024-06-27 22:22:02,179 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 207 predicate places. [2024-06-27 22:22:02,180 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 533 transitions, 10568 flow [2024-06-27 22:22:02,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:22:02,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:02,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:02,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:22:02,180 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:02,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash -180958226, now seen corresponding path program 6 times [2024-06-27 22:22:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:02,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218078038] [2024-06-27 22:22:02,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:04,329 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 22:22:04,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218078038] [2024-06-27 22:22:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218078038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:04,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40015550] [2024-06-27 22:22:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:04,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:04,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:22:04,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 533 transitions, 10568 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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 22:22:04,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:04,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:22:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:07,262 INFO L124 PetriNetUnfolderBase]: 7430/12438 cut-off events. [2024-06-27 22:22:07,263 INFO L125 PetriNetUnfolderBase]: For 488137/488270 co-relation queries the response was YES. [2024-06-27 22:22:07,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89561 conditions, 12438 events. 7430/12438 cut-off events. For 488137/488270 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 87846 event pairs, 2142 based on Foata normal form. 45/12027 useless extension candidates. Maximal degree in co-relation 89447. Up to 9841 conditions per place. [2024-06-27 22:22:07,444 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 396 selfloop transitions, 107 changer transitions 0/572 dead transitions. [2024-06-27 22:22:07,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 572 transitions, 11748 flow [2024-06-27 22:22:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:22:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:22:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-06-27 22:22:07,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325 [2024-06-27 22:22:07,445 INFO L175 Difference]: Start difference. First operand has 263 places, 533 transitions, 10568 flow. Second operand 8 states and 213 transitions. [2024-06-27 22:22:07,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 572 transitions, 11748 flow [2024-06-27 22:22:08,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 572 transitions, 11290 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:08,400 INFO L231 Difference]: Finished difference. Result has 264 places, 533 transitions, 10336 flow [2024-06-27 22:22:08,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=10110, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10336, PETRI_PLACES=264, PETRI_TRANSITIONS=533} [2024-06-27 22:22:08,401 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 208 predicate places. [2024-06-27 22:22:08,401 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 533 transitions, 10336 flow [2024-06-27 22:22:08,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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 22:22:08,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:08,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:08,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:22:08,402 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:08,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1052606518, now seen corresponding path program 11 times [2024-06-27 22:22:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:08,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952050463] [2024-06-27 22:22:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:10,379 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 22:22:10,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:10,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952050463] [2024-06-27 22:22:10,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952050463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:10,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:10,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757015212] [2024-06-27 22:22:10,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:10,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:10,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:10,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:10,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:10,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:10,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 533 transitions, 10336 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:22:10,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:10,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:10,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:13,148 INFO L124 PetriNetUnfolderBase]: 7745/12771 cut-off events. [2024-06-27 22:22:13,148 INFO L125 PetriNetUnfolderBase]: For 486223/486295 co-relation queries the response was YES. [2024-06-27 22:22:13,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91988 conditions, 12771 events. 7745/12771 cut-off events. For 486223/486295 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 88419 event pairs, 2219 based on Foata normal form. 11/12350 useless extension candidates. Maximal degree in co-relation 91874. Up to 9980 conditions per place. [2024-06-27 22:22:13,339 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 336 selfloop transitions, 230 changer transitions 0/584 dead transitions. [2024-06-27 22:22:13,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 584 transitions, 11932 flow [2024-06-27 22:22:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:22:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:22:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:22:13,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475 [2024-06-27 22:22:13,340 INFO L175 Difference]: Start difference. First operand has 264 places, 533 transitions, 10336 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:22:13,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 584 transitions, 11932 flow [2024-06-27 22:22:14,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 584 transitions, 11681 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-27 22:22:14,320 INFO L231 Difference]: Finished difference. Result has 264 places, 536 transitions, 10630 flow [2024-06-27 22:22:14,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=10089, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10630, PETRI_PLACES=264, PETRI_TRANSITIONS=536} [2024-06-27 22:22:14,321 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 208 predicate places. [2024-06-27 22:22:14,321 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 536 transitions, 10630 flow [2024-06-27 22:22:14,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:22:14,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:14,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:14,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:22:14,322 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:14,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1037590924, now seen corresponding path program 7 times [2024-06-27 22:22:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911527584] [2024-06-27 22:22:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:16,651 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 22:22:16,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911527584] [2024-06-27 22:22:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911527584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:16,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:16,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097673559] [2024-06-27 22:22:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:16,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:16,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:16,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:16,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:22:16,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 536 transitions, 10630 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:22:16,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:16,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:22:16,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:20,126 INFO L124 PetriNetUnfolderBase]: 8595/13918 cut-off events. [2024-06-27 22:22:20,127 INFO L125 PetriNetUnfolderBase]: For 505163/505212 co-relation queries the response was YES. [2024-06-27 22:22:20,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100458 conditions, 13918 events. 8595/13918 cut-off events. For 505163/505212 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 94611 event pairs, 2037 based on Foata normal form. 6/13523 useless extension candidates. Maximal degree in co-relation 100344. Up to 11037 conditions per place. [2024-06-27 22:22:20,342 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 357 selfloop transitions, 238 changer transitions 0/608 dead transitions. [2024-06-27 22:22:20,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 608 transitions, 12687 flow [2024-06-27 22:22:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-06-27 22:22:20,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2024-06-27 22:22:20,344 INFO L175 Difference]: Start difference. First operand has 264 places, 536 transitions, 10630 flow. Second operand 9 states and 237 transitions. [2024-06-27 22:22:20,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 608 transitions, 12687 flow [2024-06-27 22:22:21,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 608 transitions, 12262 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 22:22:21,485 INFO L231 Difference]: Finished difference. Result has 268 places, 561 transitions, 11083 flow [2024-06-27 22:22:21,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=10214, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11083, PETRI_PLACES=268, PETRI_TRANSITIONS=561} [2024-06-27 22:22:21,486 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 212 predicate places. [2024-06-27 22:22:21,486 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 561 transitions, 11083 flow [2024-06-27 22:22:21,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:22:21,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:21,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:21,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:22:21,487 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:21,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1037417944, now seen corresponding path program 8 times [2024-06-27 22:22:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109037432] [2024-06-27 22:22:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:23,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109037432] [2024-06-27 22:22:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109037432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:23,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:23,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:23,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978186917] [2024-06-27 22:22:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:23,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:23,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:23,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:22:23,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 561 transitions, 11083 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:22:23,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:23,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:22:23,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:27,539 INFO L124 PetriNetUnfolderBase]: 8708/14081 cut-off events. [2024-06-27 22:22:27,540 INFO L125 PetriNetUnfolderBase]: For 508350/508417 co-relation queries the response was YES. [2024-06-27 22:22:27,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101769 conditions, 14081 events. 8708/14081 cut-off events. For 508350/508417 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 95568 event pairs, 2077 based on Foata normal form. 10/13689 useless extension candidates. Maximal degree in co-relation 101654. Up to 11152 conditions per place. [2024-06-27 22:22:27,757 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 347 selfloop transitions, 269 changer transitions 0/629 dead transitions. [2024-06-27 22:22:27,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 629 transitions, 13012 flow [2024-06-27 22:22:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-06-27 22:22:27,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244444444444445 [2024-06-27 22:22:27,759 INFO L175 Difference]: Start difference. First operand has 268 places, 561 transitions, 11083 flow. Second operand 9 states and 236 transitions. [2024-06-27 22:22:27,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 629 transitions, 13012 flow [2024-06-27 22:22:28,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 629 transitions, 12585 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-27 22:22:28,804 INFO L231 Difference]: Finished difference. Result has 274 places, 586 transitions, 11694 flow [2024-06-27 22:22:28,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=10684, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11694, PETRI_PLACES=274, PETRI_TRANSITIONS=586} [2024-06-27 22:22:28,805 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 218 predicate places. [2024-06-27 22:22:28,805 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 586 transitions, 11694 flow [2024-06-27 22:22:28,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:22:28,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:28,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:28,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:22:28,805 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:28,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1037590738, now seen corresponding path program 12 times [2024-06-27 22:22:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626596903] [2024-06-27 22:22:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:31,038 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 22:22:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626596903] [2024-06-27 22:22:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626596903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:31,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:31,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758547501] [2024-06-27 22:22:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:31,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:31,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:31,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:31,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 586 transitions, 11694 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:22:31,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:31,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:31,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:34,197 INFO L124 PetriNetUnfolderBase]: 8008/13171 cut-off events. [2024-06-27 22:22:34,197 INFO L125 PetriNetUnfolderBase]: For 513552/513600 co-relation queries the response was YES. [2024-06-27 22:22:34,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96296 conditions, 13171 events. 8008/13171 cut-off events. For 513552/513600 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 91337 event pairs, 1916 based on Foata normal form. 8/12733 useless extension candidates. Maximal degree in co-relation 96179. Up to 10516 conditions per place. [2024-06-27 22:22:34,368 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 412 selfloop transitions, 199 changer transitions 0/629 dead transitions. [2024-06-27 22:22:34,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 629 transitions, 13216 flow [2024-06-27 22:22:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:22:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:22:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:22:34,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 22:22:34,369 INFO L175 Difference]: Start difference. First operand has 274 places, 586 transitions, 11694 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:22:34,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 629 transitions, 13216 flow [2024-06-27 22:22:35,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 629 transitions, 12873 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 22:22:35,537 INFO L231 Difference]: Finished difference. Result has 278 places, 592 transitions, 11909 flow [2024-06-27 22:22:35,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11353, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11909, PETRI_PLACES=278, PETRI_TRANSITIONS=592} [2024-06-27 22:22:35,538 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 222 predicate places. [2024-06-27 22:22:35,538 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 592 transitions, 11909 flow [2024-06-27 22:22:35,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:22:35,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:35,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:35,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:22:35,539 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:35,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1037417758, now seen corresponding path program 13 times [2024-06-27 22:22:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115868024] [2024-06-27 22:22:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:37,839 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 22:22:37,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:37,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115868024] [2024-06-27 22:22:37,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115868024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:37,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:37,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139183811] [2024-06-27 22:22:37,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:37,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:37,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:37,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:37,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:37,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 592 transitions, 11909 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:22:37,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:37,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:37,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:41,064 INFO L124 PetriNetUnfolderBase]: 7997/13166 cut-off events. [2024-06-27 22:22:41,065 INFO L125 PetriNetUnfolderBase]: For 532465/532512 co-relation queries the response was YES. [2024-06-27 22:22:41,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96422 conditions, 13166 events. 7997/13166 cut-off events. For 532465/532512 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 91337 event pairs, 2256 based on Foata normal form. 8/12734 useless extension candidates. Maximal degree in co-relation 96304. Up to 10512 conditions per place. [2024-06-27 22:22:41,465 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 403 selfloop transitions, 216 changer transitions 0/637 dead transitions. [2024-06-27 22:22:41,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 637 transitions, 13444 flow [2024-06-27 22:22:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:22:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:22:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:22:41,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-27 22:22:41,467 INFO L175 Difference]: Start difference. First operand has 278 places, 592 transitions, 11909 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:22:41,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 637 transitions, 13444 flow [2024-06-27 22:22:42,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 637 transitions, 13072 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:42,564 INFO L231 Difference]: Finished difference. Result has 281 places, 595 transitions, 12067 flow [2024-06-27 22:22:42,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11559, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12067, PETRI_PLACES=281, PETRI_TRANSITIONS=595} [2024-06-27 22:22:42,565 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 225 predicate places. [2024-06-27 22:22:42,565 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 595 transitions, 12067 flow [2024-06-27 22:22:42,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 22:22:42,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:42,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:42,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:22:42,566 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:42,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:42,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1037597434, now seen corresponding path program 9 times [2024-06-27 22:22:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17784338] [2024-06-27 22:22:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:44,955 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 22:22:44,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17784338] [2024-06-27 22:22:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17784338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:44,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:44,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557132319] [2024-06-27 22:22:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:44,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:44,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:45,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:22:45,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 595 transitions, 12067 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:22:45,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:45,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:22:45,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:48,896 INFO L124 PetriNetUnfolderBase]: 8715/14100 cut-off events. [2024-06-27 22:22:48,897 INFO L125 PetriNetUnfolderBase]: For 544077/544126 co-relation queries the response was YES. [2024-06-27 22:22:49,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102923 conditions, 14100 events. 8715/14100 cut-off events. For 544077/544126 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 95779 event pairs, 2061 based on Foata normal form. 7/13703 useless extension candidates. Maximal degree in co-relation 102805. Up to 11169 conditions per place. [2024-06-27 22:22:49,098 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 359 selfloop transitions, 263 changer transitions 0/635 dead transitions. [2024-06-27 22:22:49,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 635 transitions, 13486 flow [2024-06-27 22:22:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2024-06-27 22:22:49,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2024-06-27 22:22:49,100 INFO L175 Difference]: Start difference. First operand has 281 places, 595 transitions, 12067 flow. Second operand 9 states and 232 transitions. [2024-06-27 22:22:49,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 635 transitions, 13486 flow [2024-06-27 22:22:50,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 635 transitions, 12848 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 22:22:50,089 INFO L231 Difference]: Finished difference. Result has 282 places, 595 transitions, 11973 flow [2024-06-27 22:22:50,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11432, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11973, PETRI_PLACES=282, PETRI_TRANSITIONS=595} [2024-06-27 22:22:50,090 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 226 predicate places. [2024-06-27 22:22:50,090 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 595 transitions, 11973 flow [2024-06-27 22:22:50,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 22:22:50,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:50,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:50,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:22:50,091 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:50,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1698113399, now seen corresponding path program 1 times [2024-06-27 22:22:50,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:50,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998901746] [2024-06-27 22:22:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:50,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:52,002 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 22:22:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998901746] [2024-06-27 22:22:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998901746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:52,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:52,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:22:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281024493] [2024-06-27 22:22:52,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:52,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:22:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:22:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:22:52,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:22:52,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 595 transitions, 11973 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:52,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:52,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:22:52,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:55,907 INFO L124 PetriNetUnfolderBase]: 8866/14260 cut-off events. [2024-06-27 22:22:55,907 INFO L125 PetriNetUnfolderBase]: For 545460/545517 co-relation queries the response was YES. [2024-06-27 22:22:56,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104146 conditions, 14260 events. 8866/14260 cut-off events. For 545460/545517 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 95484 event pairs, 2306 based on Foata normal form. 26/13956 useless extension candidates. Maximal degree in co-relation 104028. Up to 12194 conditions per place. [2024-06-27 22:22:56,116 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 529 selfloop transitions, 42 changer transitions 0/637 dead transitions. [2024-06-27 22:22:56,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 637 transitions, 13428 flow [2024-06-27 22:22:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:22:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:22:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-27 22:22:56,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2024-06-27 22:22:56,118 INFO L175 Difference]: Start difference. First operand has 282 places, 595 transitions, 11973 flow. Second operand 7 states and 172 transitions. [2024-06-27 22:22:56,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 637 transitions, 13428 flow [2024-06-27 22:22:57,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 637 transitions, 12898 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:57,222 INFO L231 Difference]: Finished difference. Result has 284 places, 613 transitions, 11813 flow [2024-06-27 22:22:57,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11451, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11813, PETRI_PLACES=284, PETRI_TRANSITIONS=613} [2024-06-27 22:22:57,223 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 228 predicate places. [2024-06-27 22:22:57,223 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 613 transitions, 11813 flow [2024-06-27 22:22:57,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:57,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:57,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:57,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:22:57,229 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:57,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1297243872, now seen corresponding path program 1 times [2024-06-27 22:22:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:57,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467338616] [2024-06-27 22:22:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:59,649 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 22:22:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467338616] [2024-06-27 22:22:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467338616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:59,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:59,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:22:59,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682278268] [2024-06-27 22:22:59,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:59,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:22:59,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:59,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:22:59,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:22:59,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 22:22:59,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 613 transitions, 11813 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:59,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:59,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 22:22:59,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:03,788 INFO L124 PetriNetUnfolderBase]: 8953/14357 cut-off events. [2024-06-27 22:23:03,788 INFO L125 PetriNetUnfolderBase]: For 576228/576302 co-relation queries the response was YES. [2024-06-27 22:23:03,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105685 conditions, 14357 events. 8953/14357 cut-off events. For 576228/576302 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 95816 event pairs, 2359 based on Foata normal form. 38/14062 useless extension candidates. Maximal degree in co-relation 105564. Up to 12041 conditions per place. [2024-06-27 22:23:03,985 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 518 selfloop transitions, 94 changer transitions 0/678 dead transitions. [2024-06-27 22:23:03,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 678 transitions, 13981 flow [2024-06-27 22:23:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:23:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:23:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-06-27 22:23:03,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2024-06-27 22:23:03,987 INFO L175 Difference]: Start difference. First operand has 284 places, 613 transitions, 11813 flow. Second operand 9 states and 226 transitions. [2024-06-27 22:23:03,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 678 transitions, 13981 flow [2024-06-27 22:23:05,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 678 transitions, 13880 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:05,181 INFO L231 Difference]: Finished difference. Result has 293 places, 644 transitions, 12698 flow [2024-06-27 22:23:05,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11712, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12698, PETRI_PLACES=293, PETRI_TRANSITIONS=644} [2024-06-27 22:23:05,185 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 237 predicate places. [2024-06-27 22:23:05,185 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 644 transitions, 12698 flow [2024-06-27 22:23:05,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:05,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:05,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:05,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:23:05,185 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:05,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1898174645, now seen corresponding path program 1 times [2024-06-27 22:23:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469885786] [2024-06-27 22:23:05,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:05,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat