./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe030_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/safe030_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe030_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:45:12,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:45:12,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:45:12,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:45:12,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:45:12,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:45:12,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:45:12,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:45:12,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:45:12,378 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:45:12,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:45:12,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:45:12,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:45:12,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:45:12,380 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:45:12,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:45:12,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:45:12,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:45:12,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:45:12,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:45:12,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:45:12,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:45:12,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:45:12,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:45:12,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:45:12,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:45:12,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:45:12,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:45:12,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:45:12,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:45:12,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:45:12,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:45:12,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:45:12,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:45:12,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:45:12,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:45:12,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:45:12,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:45:12,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:45:12,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:45:12,387 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:45:12,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:45:12,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:45:12,388 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 22:45:12,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:45:12,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:45:12,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:45:12,632 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:45:12,633 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:45:12,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe030_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-03 22:45:12,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:45:12,765 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:45:12,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:45:13,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:45:14,007 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:45:14,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:45:14,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ad1ee99/56bbd75d63494b638b8a8575a282636c/FLAG58633a795 [2024-06-03 22:45:14,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ad1ee99/56bbd75d63494b638b8a8575a282636c [2024-06-03 22:45:14,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:45:14,029 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:45:14,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:45:14,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:45:14,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:45:14,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:45:12" (1/2) ... [2024-06-03 22:45:14,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@887ee78 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:45:14, skipping insertion in model container [2024-06-03 22:45:14,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:45:12" (1/2) ... [2024-06-03 22:45:14,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ede1f95 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:45:14, skipping insertion in model container [2024-06-03 22:45:14,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:45:14" (2/2) ... [2024-06-03 22:45:14,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@887ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14, skipping insertion in model container [2024-06-03 22:45:14,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:45:14" (2/2) ... [2024-06-03 22:45:14,039 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:45:14,107 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:45:14,108 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-03 22:45:14,109 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-03 22:45:14,110 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-03 22:45:14,110 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:45:14,111 INFO L106 edCorrectnessWitness]: ghost_update [L812-L812] multithreaded = 1; [2024-06-03 22:45:14,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:45:14,471 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:45:14,481 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:45:14,787 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:45:14,815 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:45:14,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14 WrapperNode [2024-06-03 22:45:14,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:45:14,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:45:14,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:45:14,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:45:14,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:14,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:14,932 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2024-06-03 22:45:14,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:45:14,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:45:14,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:45:14,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:45:14,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:14,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:14,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,023 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-03 22:45:15,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:45:15,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:45:15,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:45:15,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:45:15,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (1/1) ... [2024-06-03 22:45:15,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:45:15,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:45:15,116 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-03 22:45:15,134 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-03 22:45:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:45:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:45:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:45:15,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:45:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:45:15,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:45:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 22:45:15,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 22:45:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:45:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:45:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:45:15,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:45:15,149 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:45:15,293 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:45:15,295 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:45:16,315 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:45:16,317 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:45:16,548 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:45:16,549 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:45:16,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:45:16 BoogieIcfgContainer [2024-06-03 22:45:16,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:45:16,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:45:16,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:45:16,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:45:16,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:45:12" (1/4) ... [2024-06-03 22:45:16,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7f941 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:45:16, skipping insertion in model container [2024-06-03 22:45:16,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:45:14" (2/4) ... [2024-06-03 22:45:16,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7f941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:45:16, skipping insertion in model container [2024-06-03 22:45:16,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:45:14" (3/4) ... [2024-06-03 22:45:16,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7f941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:45:16, skipping insertion in model container [2024-06-03 22:45:16,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:45:16" (4/4) ... [2024-06-03 22:45:16,557 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:45:16,569 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:45:16,570 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 22:45:16,570 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:45:16,644 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:45:16,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:45:16,716 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 22:45:16,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:45:16,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:45:16,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:45:16,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 22:45:16,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:45:16,740 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;@16500371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:45:16,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 22:45:16,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:45:16,747 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:45:16,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:45:16,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:16,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:45:16,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:16,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1778898873, now seen corresponding path program 1 times [2024-06-03 22:45:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414422227] [2024-06-03 22:45:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:21,015 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-03 22:45:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414422227] [2024-06-03 22:45:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414422227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:21,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:21,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:45:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297409938] [2024-06-03 22:45:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:21,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:45:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:45:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:45:21,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-03 22:45:21,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03 22:45:21,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:21,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-03 22:45:21,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:21,565 INFO L124 PetriNetUnfolderBase]: 736/1235 cut-off events. [2024-06-03 22:45:21,566 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-03 22:45:21,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2422 conditions, 1235 events. 736/1235 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6398 event pairs, 471 based on Foata normal form. 1/1203 useless extension candidates. Maximal degree in co-relation 2407. Up to 1122 conditions per place. [2024-06-03 22:45:21,576 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-03 22:45:21,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 169 flow [2024-06-03 22:45:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:45:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:45:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-03 22:45:21,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-06-03 22:45:21,586 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 74 transitions. [2024-06-03 22:45:21,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 169 flow [2024-06-03 22:45:21,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 22:45:21,589 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-03 22:45:21,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-03 22:45:21,593 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-03 22:45:21,594 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-03 22:45:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03 22:45:21,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:21,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:21,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:45:21,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:21,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash -124806554, now seen corresponding path program 1 times [2024-06-03 22:45:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:21,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227741135] [2024-06-03 22:45:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:24,785 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-03 22:45:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227741135] [2024-06-03 22:45:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227741135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:45:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466001843] [2024-06-03 22:45:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:24,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:45:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:24,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:45:24,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:45:24,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-03 22:45:24,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03 22:45:24,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:24,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-03 22:45:24,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:25,296 INFO L124 PetriNetUnfolderBase]: 730/1226 cut-off events. [2024-06-03 22:45:25,296 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2024-06-03 22:45:25,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 1226 events. 730/1226 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6340 event pairs, 365 based on Foata normal form. 3/1218 useless extension candidates. Maximal degree in co-relation 2748. Up to 1098 conditions per place. [2024-06-03 22:45:25,305 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 38 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-03 22:45:25,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 236 flow [2024-06-03 22:45:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:45:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:45:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-06-03 22:45:25,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2024-06-03 22:45:25,308 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 96 transitions. [2024-06-03 22:45:25,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 236 flow [2024-06-03 22:45:25,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:45:25,312 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-03 22:45:25,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-03 22:45:25,313 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-03 22:45:25,313 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-03 22:45:25,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03 22:45:25,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:25,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:25,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:45:25,317 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:25,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash 425965014, now seen corresponding path program 1 times [2024-06-03 22:45:25,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786542268] [2024-06-03 22:45:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:28,295 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-03 22:45:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:28,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786542268] [2024-06-03 22:45:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786542268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:45:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029526108] [2024-06-03 22:45:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:28,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:45:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:45:28,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:45:28,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-03 22:45:28,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03 22:45:28,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:28,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-03 22:45:28,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:28,871 INFO L124 PetriNetUnfolderBase]: 742/1259 cut-off events. [2024-06-03 22:45:28,872 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-06-03 22:45:28,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3162 conditions, 1259 events. 742/1259 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6608 event pairs, 169 based on Foata normal form. 10/1262 useless extension candidates. Maximal degree in co-relation 3145. Up to 1008 conditions per place. [2024-06-03 22:45:28,878 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2024-06-03 22:45:28,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 368 flow [2024-06-03 22:45:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:45:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:45:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-06-03 22:45:28,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5951219512195122 [2024-06-03 22:45:28,880 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 122 transitions. [2024-06-03 22:45:28,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 368 flow [2024-06-03 22:45:28,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 354 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 22:45:28,882 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 215 flow [2024-06-03 22:45:28,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-06-03 22:45:28,883 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2024-06-03 22:45:28,883 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 215 flow [2024-06-03 22:45:28,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03 22:45:28,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:28,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:28,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:45:28,884 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:28,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 921517780, now seen corresponding path program 1 times [2024-06-03 22:45:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:28,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231035017] [2024-06-03 22:45:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:36,368 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-03 22:45:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231035017] [2024-06-03 22:45:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231035017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:45:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88820294] [2024-06-03 22:45:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:36,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:45:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:45:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:45:36,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:45:36,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03 22:45:36,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:36,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:45:36,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:37,230 INFO L124 PetriNetUnfolderBase]: 1368/2073 cut-off events. [2024-06-03 22:45:37,231 INFO L125 PetriNetUnfolderBase]: For 2528/2528 co-relation queries the response was YES. [2024-06-03 22:45:37,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6160 conditions, 2073 events. 1368/2073 cut-off events. For 2528/2528 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9619 event pairs, 657 based on Foata normal form. 2/2072 useless extension candidates. Maximal degree in co-relation 6140. Up to 2036 conditions per place. [2024-06-03 22:45:37,242 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-06-03 22:45:37,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 349 flow [2024-06-03 22:45:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:45:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:45:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-03 22:45:37,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-03 22:45:37,244 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 215 flow. Second operand 5 states and 86 transitions. [2024-06-03 22:45:37,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 349 flow [2024-06-03 22:45:37,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 339 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-03 22:45:37,247 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 229 flow [2024-06-03 22:45:37,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-03 22:45:37,248 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-03 22:45:37,248 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 229 flow [2024-06-03 22:45:37,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03 22:45:37,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:37,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:45:37,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:37,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1508817884, now seen corresponding path program 1 times [2024-06-03 22:45:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869075385] [2024-06-03 22:45:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:44,800 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-03 22:45:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869075385] [2024-06-03 22:45:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869075385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:44,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:45:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993888912] [2024-06-03 22:45:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:44,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:45:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:44,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:45:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:45:44,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:45:44,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-03 22:45:44,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:44,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:45:44,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:45,689 INFO L124 PetriNetUnfolderBase]: 1358/2059 cut-off events. [2024-06-03 22:45:45,690 INFO L125 PetriNetUnfolderBase]: For 3249/3249 co-relation queries the response was YES. [2024-06-03 22:45:45,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6281 conditions, 2059 events. 1358/2059 cut-off events. For 3249/3249 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9545 event pairs, 621 based on Foata normal form. 4/2060 useless extension candidates. Maximal degree in co-relation 6257. Up to 2004 conditions per place. [2024-06-03 22:45:45,703 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 50 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-06-03 22:45:45,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 407 flow [2024-06-03 22:45:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:45:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:45:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 22:45:45,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:45:45,707 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 229 flow. Second operand 6 states and 102 transitions. [2024-06-03 22:45:45,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 407 flow [2024-06-03 22:45:45,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 385 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:45:45,715 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 259 flow [2024-06-03 22:45:45,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-03 22:45:45,717 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-03 22:45:45,717 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 259 flow [2024-06-03 22:45:45,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-03 22:45:45,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:45,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:45,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:45:45,719 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:45,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash 465565585, now seen corresponding path program 1 times [2024-06-03 22:45:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:45,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528265662] [2024-06-03 22:45:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:53,222 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-03 22:45:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528265662] [2024-06-03 22:45:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528265662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:45:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87844515] [2024-06-03 22:45:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:53,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:45:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:45:53,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:45:53,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:45:53,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-03 22:45:53,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:53,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:45:53,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:54,118 INFO L124 PetriNetUnfolderBase]: 1364/2069 cut-off events. [2024-06-03 22:45:54,119 INFO L125 PetriNetUnfolderBase]: For 4521/4527 co-relation queries the response was YES. [2024-06-03 22:45:54,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 2069 events. 1364/2069 cut-off events. For 4521/4527 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9683 event pairs, 509 based on Foata normal form. 8/2073 useless extension candidates. Maximal degree in co-relation 6784. Up to 1956 conditions per place. [2024-06-03 22:45:54,131 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2024-06-03 22:45:54,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 535 flow [2024-06-03 22:45:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:45:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:45:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-03 22:45:54,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-03 22:45:54,133 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 259 flow. Second operand 6 states and 110 transitions. [2024-06-03 22:45:54,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 535 flow [2024-06-03 22:45:54,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 507 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 22:45:54,138 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 360 flow [2024-06-03 22:45:54,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-06-03 22:45:54,141 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-03 22:45:54,141 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 360 flow [2024-06-03 22:45:54,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-03 22:45:54,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:54,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:54,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:45:54,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:54,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash 815365555, now seen corresponding path program 2 times [2024-06-03 22:45:54,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:54,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852307971] [2024-06-03 22:45:54,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:54,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:01,421 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-03 22:46:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852307971] [2024-06-03 22:46:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852307971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:01,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:01,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:46:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926081176] [2024-06-03 22:46:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:46:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:46:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:46:01,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:46:01,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 360 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-03 22:46:01,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:01,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:46:01,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:02,291 INFO L124 PetriNetUnfolderBase]: 1352/2042 cut-off events. [2024-06-03 22:46:02,292 INFO L125 PetriNetUnfolderBase]: For 5807/5813 co-relation queries the response was YES. [2024-06-03 22:46:02,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7161 conditions, 2042 events. 1352/2042 cut-off events. For 5807/5813 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9478 event pairs, 523 based on Foata normal form. 3/2036 useless extension candidates. Maximal degree in co-relation 7135. Up to 1940 conditions per place. [2024-06-03 22:46:02,302 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 50 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2024-06-03 22:46:02,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 538 flow [2024-06-03 22:46:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:46:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:46:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-03 22:46:02,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-03 22:46:02,304 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 360 flow. Second operand 6 states and 106 transitions. [2024-06-03 22:46:02,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 538 flow [2024-06-03 22:46:02,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 522 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 22:46:02,307 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 392 flow [2024-06-03 22:46:02,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-03 22:46:02,308 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-03 22:46:02,308 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 392 flow [2024-06-03 22:46:02,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-03 22:46:02,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:02,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:02,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:46:02,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:46:02,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 862832357, now seen corresponding path program 1 times [2024-06-03 22:46:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939634188] [2024-06-03 22:46:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:09,733 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-03 22:46:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939634188] [2024-06-03 22:46:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939634188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:46:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967781754] [2024-06-03 22:46:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:09,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:46:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:46:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:46:09,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:46:09,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 392 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:09,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:09,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:46:09,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:10,726 INFO L124 PetriNetUnfolderBase]: 1526/2308 cut-off events. [2024-06-03 22:46:10,726 INFO L125 PetriNetUnfolderBase]: For 7988/7994 co-relation queries the response was YES. [2024-06-03 22:46:10,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8583 conditions, 2308 events. 1526/2308 cut-off events. For 7988/7994 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10815 event pairs, 513 based on Foata normal form. 12/2316 useless extension candidates. Maximal degree in co-relation 8555. Up to 2040 conditions per place. [2024-06-03 22:46:10,737 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 76 selfloop transitions, 40 changer transitions 0/120 dead transitions. [2024-06-03 22:46:10,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 120 transitions, 972 flow [2024-06-03 22:46:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:46:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:46:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-03 22:46:10,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:46:10,739 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 392 flow. Second operand 9 states and 162 transitions. [2024-06-03 22:46:10,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 120 transitions, 972 flow [2024-06-03 22:46:10,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 913 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 22:46:10,746 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 675 flow [2024-06-03 22:46:10,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=675, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2024-06-03 22:46:10,746 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-06-03 22:46:10,746 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 675 flow [2024-06-03 22:46:10,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:10,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:10,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:10,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:46:10,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:46:10,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1547632805, now seen corresponding path program 2 times [2024-06-03 22:46:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46867785] [2024-06-03 22:46:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:18,825 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-03 22:46:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46867785] [2024-06-03 22:46:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46867785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:46:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034497723] [2024-06-03 22:46:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:18,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:46:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:46:18,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:46:18,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:46:18,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 675 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:18,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:18,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:46:18,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:19,880 INFO L124 PetriNetUnfolderBase]: 1598/2426 cut-off events. [2024-06-03 22:46:19,880 INFO L125 PetriNetUnfolderBase]: For 11177/11185 co-relation queries the response was YES. [2024-06-03 22:46:19,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 2426 events. 1598/2426 cut-off events. For 11177/11185 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11542 event pairs, 431 based on Foata normal form. 16/2438 useless extension candidates. Maximal degree in co-relation 9882. Up to 1988 conditions per place. [2024-06-03 22:46:19,891 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 71 selfloop transitions, 54 changer transitions 0/129 dead transitions. [2024-06-03 22:46:19,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 129 transitions, 1149 flow [2024-06-03 22:46:19,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:46:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:46:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-03 22:46:19,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-03 22:46:19,894 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 675 flow. Second operand 9 states and 160 transitions. [2024-06-03 22:46:19,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 129 transitions, 1149 flow [2024-06-03 22:46:19,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 1117 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-03 22:46:19,903 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 857 flow [2024-06-03 22:46:19,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=857, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2024-06-03 22:46:19,904 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-03 22:46:19,904 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 857 flow [2024-06-03 22:46:19,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:19,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:19,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:19,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:46:19,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:46:19,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash -493232863, now seen corresponding path program 3 times [2024-06-03 22:46:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474547759] [2024-06-03 22:46:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:28,075 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-03 22:46:28,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:28,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474547759] [2024-06-03 22:46:28,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474547759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:28,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:28,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:46:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711660111] [2024-06-03 22:46:28,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:28,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:46:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:46:28,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:46:28,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:46:28,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 857 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:28,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:28,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:46:28,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:29,018 INFO L124 PetriNetUnfolderBase]: 1620/2453 cut-off events. [2024-06-03 22:46:29,018 INFO L125 PetriNetUnfolderBase]: For 14392/14400 co-relation queries the response was YES. [2024-06-03 22:46:29,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10970 conditions, 2453 events. 1620/2453 cut-off events. For 14392/14400 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11658 event pairs, 442 based on Foata normal form. 5/2444 useless extension candidates. Maximal degree in co-relation 10935. Up to 1997 conditions per place. [2024-06-03 22:46:29,031 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 66 selfloop transitions, 62 changer transitions 0/132 dead transitions. [2024-06-03 22:46:29,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 132 transitions, 1359 flow [2024-06-03 22:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:46:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:46:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 22:46:29,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-03 22:46:29,034 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 857 flow. Second operand 8 states and 145 transitions. [2024-06-03 22:46:29,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 132 transitions, 1359 flow [2024-06-03 22:46:29,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 132 transitions, 1256 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-03 22:46:29,049 INFO L231 Difference]: Finished difference. Result has 82 places, 101 transitions, 980 flow [2024-06-03 22:46:29,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=980, PETRI_PLACES=82, PETRI_TRANSITIONS=101} [2024-06-03 22:46:29,049 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-03 22:46:29,050 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 101 transitions, 980 flow [2024-06-03 22:46:29,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:29,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:29,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:29,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:46:29,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:46:29,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 895909709, now seen corresponding path program 4 times [2024-06-03 22:46:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591748868] [2024-06-03 22:46:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:36,939 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-03 22:46:36,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:36,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591748868] [2024-06-03 22:46:36,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591748868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:36,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:36,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:46:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268037832] [2024-06-03 22:46:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:36,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:46:36,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:46:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:46:37,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:46:37,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 101 transitions, 980 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:37,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:37,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:46:37,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:38,000 INFO L124 PetriNetUnfolderBase]: 1604/2426 cut-off events. [2024-06-03 22:46:38,000 INFO L125 PetriNetUnfolderBase]: For 13660/13668 co-relation queries the response was YES. [2024-06-03 22:46:38,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10769 conditions, 2426 events. 1604/2426 cut-off events. For 13660/13668 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11453 event pairs, 439 based on Foata normal form. 7/2419 useless extension candidates. Maximal degree in co-relation 10732. Up to 1990 conditions per place. [2024-06-03 22:46:38,014 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 72 selfloop transitions, 63 changer transitions 0/139 dead transitions. [2024-06-03 22:46:38,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 1400 flow [2024-06-03 22:46:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:46:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:46:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-03 22:46:38,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-03 22:46:38,017 INFO L175 Difference]: Start difference. First operand has 82 places, 101 transitions, 980 flow. Second operand 10 states and 174 transitions. [2024-06-03 22:46:38,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 1400 flow [2024-06-03 22:46:38,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 139 transitions, 1327 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-03 22:46:38,031 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 1044 flow [2024-06-03 22:46:38,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1044, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2024-06-03 22:46:38,031 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-03 22:46:38,032 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 1044 flow [2024-06-03 22:46:38,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:38,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:38,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:38,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:46:38,032 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:46:38,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -853397125, now seen corresponding path program 1 times [2024-06-03 22:46:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:38,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032888096] [2024-06-03 22:46:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:45,804 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-03 22:46:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032888096] [2024-06-03 22:46:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032888096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:46:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782610088] [2024-06-03 22:46:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:45,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:46:45,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:46:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:46:45,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:46:45,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 1044 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 22:46:45,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:45,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:46:45,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:46,884 INFO L124 PetriNetUnfolderBase]: 1596/2426 cut-off events. [2024-06-03 22:46:46,884 INFO L125 PetriNetUnfolderBase]: For 15575/15577 co-relation queries the response was YES. [2024-06-03 22:46:46,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11164 conditions, 2426 events. 1596/2426 cut-off events. For 15575/15577 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11512 event pairs, 486 based on Foata normal form. 4/2427 useless extension candidates. Maximal degree in co-relation 11125. Up to 2329 conditions per place. [2024-06-03 22:46:46,898 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 107 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2024-06-03 22:46:46,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 1366 flow [2024-06-03 22:46:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:46:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:46:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 22:46:46,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 22:46:46,900 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 1044 flow. Second operand 7 states and 117 transitions. [2024-06-03 22:46:46,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 1366 flow [2024-06-03 22:46:46,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 124 transitions, 1193 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:46:46,916 INFO L231 Difference]: Finished difference. Result has 86 places, 103 transitions, 928 flow [2024-06-03 22:46:46,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=928, PETRI_PLACES=86, PETRI_TRANSITIONS=103} [2024-06-03 22:46:46,917 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2024-06-03 22:46:46,917 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 928 flow [2024-06-03 22:46:46,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 22:46:46,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:46,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:46,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:46:46,917 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:46:46,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 677561842, now seen corresponding path program 1 times [2024-06-03 22:46:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439285036] [2024-06-03 22:46:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:53,819 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-03 22:46:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439285036] [2024-06-03 22:46:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439285036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:53,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:53,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:46:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259601569] [2024-06-03 22:46:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:53,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:46:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:53,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:46:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:46:53,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:46:53,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-03 22:46:53,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:53,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:46:53,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:54,514 INFO L124 PetriNetUnfolderBase]: 1593/2418 cut-off events. [2024-06-03 22:46:54,514 INFO L125 PetriNetUnfolderBase]: For 16228/16230 co-relation queries the response was YES. [2024-06-03 22:46:54,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11009 conditions, 2418 events. 1593/2418 cut-off events. For 16228/16230 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11433 event pairs, 518 based on Foata normal form. 1/2416 useless extension candidates. Maximal degree in co-relation 10969. Up to 2367 conditions per place. [2024-06-03 22:46:54,526 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 102 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-06-03 22:46:54,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 1192 flow [2024-06-03 22:46:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:46:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:46:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-03 22:46:54,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:46:54,531 INFO L175 Difference]: Start difference. First operand has 86 places, 103 transitions, 928 flow. Second operand 5 states and 82 transitions. [2024-06-03 22:46:54,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 1192 flow [2024-06-03 22:46:54,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 1153 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:46:54,548 INFO L231 Difference]: Finished difference. Result has 86 places, 106 transitions, 937 flow [2024-06-03 22:46:54,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=937, PETRI_PLACES=86, PETRI_TRANSITIONS=106} [2024-06-03 22:46:54,548 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2024-06-03 22:46:54,548 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 106 transitions, 937 flow [2024-06-03 22:46:54,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-03 22:46:54,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:54,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:54,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:46:54,549 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:46:54,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1859508045, now seen corresponding path program 1 times [2024-06-03 22:46:54,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:54,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655625466] [2024-06-03 22:46:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:01,602 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-03 22:47:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655625466] [2024-06-03 22:47:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655625466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:01,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:01,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:01,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176106785] [2024-06-03 22:47:01,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:01,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:01,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:01,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:01,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:47:01,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 106 transitions, 937 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:01,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:01,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:47:01,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:02,612 INFO L124 PetriNetUnfolderBase]: 1669/2549 cut-off events. [2024-06-03 22:47:02,612 INFO L125 PetriNetUnfolderBase]: For 19207/19212 co-relation queries the response was YES. [2024-06-03 22:47:02,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11904 conditions, 2549 events. 1669/2549 cut-off events. For 19207/19212 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12311 event pairs, 445 based on Foata normal form. 8/2553 useless extension candidates. Maximal degree in co-relation 11863. Up to 2039 conditions per place. [2024-06-03 22:47:02,626 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 77 selfloop transitions, 63 changer transitions 0/144 dead transitions. [2024-06-03 22:47:02,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 144 transitions, 1476 flow [2024-06-03 22:47:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 22:47:02,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:47:02,629 INFO L175 Difference]: Start difference. First operand has 86 places, 106 transitions, 937 flow. Second operand 7 states and 133 transitions. [2024-06-03 22:47:02,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 144 transitions, 1476 flow [2024-06-03 22:47:02,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 144 transitions, 1450 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 22:47:02,646 INFO L231 Difference]: Finished difference. Result has 90 places, 115 transitions, 1137 flow [2024-06-03 22:47:02,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1137, PETRI_PLACES=90, PETRI_TRANSITIONS=115} [2024-06-03 22:47:02,647 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-03 22:47:02,647 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 115 transitions, 1137 flow [2024-06-03 22:47:02,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:02,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:02,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:02,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:47:02,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:47:02,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1859502465, now seen corresponding path program 2 times [2024-06-03 22:47:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021613182] [2024-06-03 22:47:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:09,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:09,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021613182] [2024-06-03 22:47:09,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021613182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:09,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:09,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:09,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850605656] [2024-06-03 22:47:09,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:09,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:09,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:09,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:09,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:47:09,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 115 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:09,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:09,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:47:09,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:10,620 INFO L124 PetriNetUnfolderBase]: 1649/2527 cut-off events. [2024-06-03 22:47:10,620 INFO L125 PetriNetUnfolderBase]: For 21955/21964 co-relation queries the response was YES. [2024-06-03 22:47:10,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12276 conditions, 2527 events. 1649/2527 cut-off events. For 21955/21964 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12208 event pairs, 455 based on Foata normal form. 14/2537 useless extension candidates. Maximal degree in co-relation 12234. Up to 2023 conditions per place. [2024-06-03 22:47:10,633 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 77 selfloop transitions, 65 changer transitions 0/146 dead transitions. [2024-06-03 22:47:10,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 146 transitions, 1565 flow [2024-06-03 22:47:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 22:47:10,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-03 22:47:10,635 INFO L175 Difference]: Start difference. First operand has 90 places, 115 transitions, 1137 flow. Second operand 7 states and 135 transitions. [2024-06-03 22:47:10,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 146 transitions, 1565 flow [2024-06-03 22:47:10,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 146 transitions, 1474 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 22:47:10,654 INFO L231 Difference]: Finished difference. Result has 94 places, 115 transitions, 1188 flow [2024-06-03 22:47:10,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1188, PETRI_PLACES=94, PETRI_TRANSITIONS=115} [2024-06-03 22:47:10,655 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-03 22:47:10,655 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1188 flow [2024-06-03 22:47:10,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:10,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:10,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:10,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:47:10,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:47:10,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1889651803, now seen corresponding path program 3 times [2024-06-03 22:47:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309567719] [2024-06-03 22:47:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:19,015 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-03 22:47:19,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:19,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309567719] [2024-06-03 22:47:19,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309567719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:19,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:19,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373296393] [2024-06-03 22:47:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:19,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:19,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:19,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:19,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:47:19,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1188 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:19,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:19,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:47:19,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:19,961 INFO L124 PetriNetUnfolderBase]: 1639/2507 cut-off events. [2024-06-03 22:47:19,961 INFO L125 PetriNetUnfolderBase]: For 24717/24728 co-relation queries the response was YES. [2024-06-03 22:47:19,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12430 conditions, 2507 events. 1639/2507 cut-off events. For 24717/24728 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12063 event pairs, 465 based on Foata normal form. 7/2499 useless extension candidates. Maximal degree in co-relation 12387. Up to 2015 conditions per place. [2024-06-03 22:47:19,974 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 73 selfloop transitions, 60 changer transitions 0/137 dead transitions. [2024-06-03 22:47:19,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 137 transitions, 1518 flow [2024-06-03 22:47:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:47:19,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:47:19,977 INFO L175 Difference]: Start difference. First operand has 94 places, 115 transitions, 1188 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:47:19,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 137 transitions, 1518 flow [2024-06-03 22:47:19,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 137 transitions, 1384 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:47:19,995 INFO L231 Difference]: Finished difference. Result has 96 places, 115 transitions, 1182 flow [2024-06-03 22:47:19,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1182, PETRI_PLACES=96, PETRI_TRANSITIONS=115} [2024-06-03 22:47:19,996 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-03 22:47:19,996 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 115 transitions, 1182 flow [2024-06-03 22:47:19,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:19,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:19,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:19,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:47:19,997 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:47:19,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash -470418324, now seen corresponding path program 1 times [2024-06-03 22:47:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289175491] [2024-06-03 22:47:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:26,769 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-03 22:47:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:26,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289175491] [2024-06-03 22:47:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289175491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:26,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:26,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:47:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253287826] [2024-06-03 22:47:26,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:26,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:47:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:26,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:47:26,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:47:26,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:47:26,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 115 transitions, 1182 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:47:26,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:26,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:47:26,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:27,565 INFO L124 PetriNetUnfolderBase]: 1643/2518 cut-off events. [2024-06-03 22:47:27,565 INFO L125 PetriNetUnfolderBase]: For 26564/26582 co-relation queries the response was YES. [2024-06-03 22:47:27,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12619 conditions, 2518 events. 1643/2518 cut-off events. For 26564/26582 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12096 event pairs, 490 based on Foata normal form. 14/2525 useless extension candidates. Maximal degree in co-relation 12575. Up to 2402 conditions per place. [2024-06-03 22:47:27,578 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 112 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2024-06-03 22:47:27,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 135 transitions, 1574 flow [2024-06-03 22:47:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:47:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:47:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-03 22:47:27,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-03 22:47:27,580 INFO L175 Difference]: Start difference. First operand has 96 places, 115 transitions, 1182 flow. Second operand 6 states and 99 transitions. [2024-06-03 22:47:27,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 135 transitions, 1574 flow [2024-06-03 22:47:27,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 1402 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:47:27,599 INFO L231 Difference]: Finished difference. Result has 96 places, 123 transitions, 1136 flow [2024-06-03 22:47:27,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1136, PETRI_PLACES=96, PETRI_TRANSITIONS=123} [2024-06-03 22:47:27,599 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-03 22:47:27,600 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 123 transitions, 1136 flow [2024-06-03 22:47:27,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:47:27,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:27,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:27,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:47:27,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:47:27,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1068096776, now seen corresponding path program 1 times [2024-06-03 22:47:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:27,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418824969] [2024-06-03 22:47:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:36,486 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-03 22:47:36,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:36,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418824969] [2024-06-03 22:47:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418824969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:36,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56292651] [2024-06-03 22:47:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:36,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:36,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:36,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:47:36,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 123 transitions, 1136 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:36,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:36,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:47:36,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:37,539 INFO L124 PetriNetUnfolderBase]: 1660/2540 cut-off events. [2024-06-03 22:47:37,539 INFO L125 PetriNetUnfolderBase]: For 29050/29055 co-relation queries the response was YES. [2024-06-03 22:47:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12973 conditions, 2540 events. 1660/2540 cut-off events. For 29050/29055 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12300 event pairs, 367 based on Foata normal form. 6/2542 useless extension candidates. Maximal degree in co-relation 12927. Up to 2222 conditions per place. [2024-06-03 22:47:37,553 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 111 selfloop transitions, 35 changer transitions 0/150 dead transitions. [2024-06-03 22:47:37,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 150 transitions, 1578 flow [2024-06-03 22:47:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 22:47:37,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 22:47:37,555 INFO L175 Difference]: Start difference. First operand has 96 places, 123 transitions, 1136 flow. Second operand 7 states and 125 transitions. [2024-06-03 22:47:37,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 150 transitions, 1578 flow [2024-06-03 22:47:37,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 150 transitions, 1538 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-03 22:47:37,578 INFO L231 Difference]: Finished difference. Result has 101 places, 125 transitions, 1191 flow [2024-06-03 22:47:37,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1191, PETRI_PLACES=101, PETRI_TRANSITIONS=125} [2024-06-03 22:47:37,578 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-03 22:47:37,578 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 125 transitions, 1191 flow [2024-06-03 22:47:37,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:37,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:37,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:37,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:47:37,579 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:47:37,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1694707026, now seen corresponding path program 2 times [2024-06-03 22:47:37,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:37,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879113323] [2024-06-03 22:47:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:45,406 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-03 22:47:45,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:45,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879113323] [2024-06-03 22:47:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879113323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:45,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:45,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:45,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713558601] [2024-06-03 22:47:45,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:45,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:45,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:45,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:45,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:47:45,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 125 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:45,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:45,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:47:45,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:46,410 INFO L124 PetriNetUnfolderBase]: 1652/2527 cut-off events. [2024-06-03 22:47:46,411 INFO L125 PetriNetUnfolderBase]: For 31772/31777 co-relation queries the response was YES. [2024-06-03 22:47:46,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13187 conditions, 2527 events. 1652/2527 cut-off events. For 31772/31777 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12199 event pairs, 364 based on Foata normal form. 6/2529 useless extension candidates. Maximal degree in co-relation 13139. Up to 2216 conditions per place. [2024-06-03 22:47:46,422 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 113 selfloop transitions, 41 changer transitions 0/158 dead transitions. [2024-06-03 22:47:46,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 158 transitions, 1599 flow [2024-06-03 22:47:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:47:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:47:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-03 22:47:46,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173441734417344 [2024-06-03 22:47:46,432 INFO L175 Difference]: Start difference. First operand has 101 places, 125 transitions, 1191 flow. Second operand 9 states and 154 transitions. [2024-06-03 22:47:46,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 158 transitions, 1599 flow [2024-06-03 22:47:46,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 158 transitions, 1500 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 22:47:46,456 INFO L231 Difference]: Finished difference. Result has 105 places, 125 transitions, 1183 flow [2024-06-03 22:47:46,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=105, PETRI_TRANSITIONS=125} [2024-06-03 22:47:46,457 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-03 22:47:46,457 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 125 transitions, 1183 flow [2024-06-03 22:47:46,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 22:47:46,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:46,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:46,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:47:46,457 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:47:46,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1810182894, now seen corresponding path program 1 times [2024-06-03 22:47:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219303253] [2024-06-03 22:47:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:53,674 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-03 22:47:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:53,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219303253] [2024-06-03 22:47:53,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219303253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:53,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:53,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:47:53,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241783645] [2024-06-03 22:47:53,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:53,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:47:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:47:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:47:53,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:47:53,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 125 transitions, 1183 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-03 22:47:53,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:53,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:47:53,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:54,966 INFO L124 PetriNetUnfolderBase]: 1778/2731 cut-off events. [2024-06-03 22:47:54,966 INFO L125 PetriNetUnfolderBase]: For 39448/39453 co-relation queries the response was YES. [2024-06-03 22:47:54,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14063 conditions, 2731 events. 1778/2731 cut-off events. For 39448/39453 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13515 event pairs, 144 based on Foata normal form. 34/2761 useless extension candidates. Maximal degree in co-relation 14015. Up to 1578 conditions per place. [2024-06-03 22:47:54,982 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 108 selfloop transitions, 64 changer transitions 0/176 dead transitions. [2024-06-03 22:47:54,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 1761 flow [2024-06-03 22:47:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:47:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:47:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-03 22:47:54,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43658536585365854 [2024-06-03 22:47:54,985 INFO L175 Difference]: Start difference. First operand has 105 places, 125 transitions, 1183 flow. Second operand 10 states and 179 transitions. [2024-06-03 22:47:54,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 1761 flow [2024-06-03 22:47:55,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 176 transitions, 1623 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:47:55,013 INFO L231 Difference]: Finished difference. Result has 107 places, 129 transitions, 1262 flow [2024-06-03 22:47:55,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1262, PETRI_PLACES=107, PETRI_TRANSITIONS=129} [2024-06-03 22:47:55,014 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-03 22:47:55,014 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 129 transitions, 1262 flow [2024-06-03 22:47:55,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-03 22:47:55,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:55,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:55,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:47:55,015 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:47:55,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash -424146151, now seen corresponding path program 1 times [2024-06-03 22:47:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622902759] [2024-06-03 22:47:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:01,596 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-03 22:48:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622902759] [2024-06-03 22:48:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622902759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:01,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:48:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213178711] [2024-06-03 22:48:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:01,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:48:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:01,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:48:01,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:48:01,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:01,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 129 transitions, 1262 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:01,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:01,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:01,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:02,469 INFO L124 PetriNetUnfolderBase]: 1783/2743 cut-off events. [2024-06-03 22:48:02,469 INFO L125 PetriNetUnfolderBase]: For 42060/42066 co-relation queries the response was YES. [2024-06-03 22:48:02,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14752 conditions, 2743 events. 1783/2743 cut-off events. For 42060/42066 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13625 event pairs, 478 based on Foata normal form. 7/2747 useless extension candidates. Maximal degree in co-relation 14703. Up to 2647 conditions per place. [2024-06-03 22:48:02,485 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 131 selfloop transitions, 13 changer transitions 0/148 dead transitions. [2024-06-03 22:48:02,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 1634 flow [2024-06-03 22:48:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:48:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:48:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-03 22:48:02,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 22:48:02,486 INFO L175 Difference]: Start difference. First operand has 107 places, 129 transitions, 1262 flow. Second operand 6 states and 100 transitions. [2024-06-03 22:48:02,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 148 transitions, 1634 flow [2024-06-03 22:48:02,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 148 transitions, 1520 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 22:48:02,527 INFO L231 Difference]: Finished difference. Result has 107 places, 132 transitions, 1217 flow [2024-06-03 22:48:02,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1217, PETRI_PLACES=107, PETRI_TRANSITIONS=132} [2024-06-03 22:48:02,528 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-03 22:48:02,528 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 132 transitions, 1217 flow [2024-06-03 22:48:02,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:02,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:02,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:02,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:48:02,529 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:48:02,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash -122633692, now seen corresponding path program 2 times [2024-06-03 22:48:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314238570] [2024-06-03 22:48:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:10,601 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-03 22:48:10,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314238570] [2024-06-03 22:48:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314238570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:10,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:10,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:48:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841626763] [2024-06-03 22:48:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:10,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:48:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:48:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:48:10,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:10,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 132 transitions, 1217 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-03 22:48:10,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:10,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:11,870 INFO L124 PetriNetUnfolderBase]: 1817/2789 cut-off events. [2024-06-03 22:48:11,870 INFO L125 PetriNetUnfolderBase]: For 46920/46928 co-relation queries the response was YES. [2024-06-03 22:48:11,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14782 conditions, 2789 events. 1817/2789 cut-off events. For 46920/46928 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13775 event pairs, 190 based on Foata normal form. 9/2784 useless extension candidates. Maximal degree in co-relation 14732. Up to 1593 conditions per place. [2024-06-03 22:48:11,885 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 110 selfloop transitions, 70 changer transitions 0/184 dead transitions. [2024-06-03 22:48:11,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 184 transitions, 1918 flow [2024-06-03 22:48:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:48:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:48:11,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-03 22:48:11,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43658536585365854 [2024-06-03 22:48:11,888 INFO L175 Difference]: Start difference. First operand has 107 places, 132 transitions, 1217 flow. Second operand 10 states and 179 transitions. [2024-06-03 22:48:11,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 184 transitions, 1918 flow [2024-06-03 22:48:11,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 184 transitions, 1883 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 22:48:11,928 INFO L231 Difference]: Finished difference. Result has 114 places, 138 transitions, 1423 flow [2024-06-03 22:48:11,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1423, PETRI_PLACES=114, PETRI_TRANSITIONS=138} [2024-06-03 22:48:11,928 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-03 22:48:11,928 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 138 transitions, 1423 flow [2024-06-03 22:48:11,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-03 22:48:11,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:11,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:11,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:48:11,929 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:48:11,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash -645400012, now seen corresponding path program 3 times [2024-06-03 22:48:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762296194] [2024-06-03 22:48:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:19,094 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-03 22:48:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762296194] [2024-06-03 22:48:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762296194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:19,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:48:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982435252] [2024-06-03 22:48:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:19,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:48:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:19,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:48:19,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:48:19,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:19,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 138 transitions, 1423 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-03 22:48:19,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:19,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:19,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:20,409 INFO L124 PetriNetUnfolderBase]: 1809/2780 cut-off events. [2024-06-03 22:48:20,409 INFO L125 PetriNetUnfolderBase]: For 54467/54475 co-relation queries the response was YES. [2024-06-03 22:48:20,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15524 conditions, 2780 events. 1809/2780 cut-off events. For 54467/54475 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13774 event pairs, 182 based on Foata normal form. 5/2766 useless extension candidates. Maximal degree in co-relation 15472. Up to 1591 conditions per place. [2024-06-03 22:48:20,423 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 113 selfloop transitions, 68 changer transitions 0/185 dead transitions. [2024-06-03 22:48:20,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 185 transitions, 1975 flow [2024-06-03 22:48:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:48:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:48:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-06-03 22:48:20,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41685144124168516 [2024-06-03 22:48:20,426 INFO L175 Difference]: Start difference. First operand has 114 places, 138 transitions, 1423 flow. Second operand 11 states and 188 transitions. [2024-06-03 22:48:20,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 185 transitions, 1975 flow [2024-06-03 22:48:20,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 185 transitions, 1835 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 22:48:20,474 INFO L231 Difference]: Finished difference. Result has 119 places, 138 transitions, 1429 flow [2024-06-03 22:48:20,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1429, PETRI_PLACES=119, PETRI_TRANSITIONS=138} [2024-06-03 22:48:20,475 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-03 22:48:20,475 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 138 transitions, 1429 flow [2024-06-03 22:48:20,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-03 22:48:20,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:20,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:20,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:48:20,475 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:48:20,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash -562148129, now seen corresponding path program 2 times [2024-06-03 22:48:20,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272795421] [2024-06-03 22:48:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:20,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:27,700 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-03 22:48:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272795421] [2024-06-03 22:48:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272795421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:48:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384572252] [2024-06-03 22:48:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:27,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:48:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:48:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:48:27,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:27,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 138 transitions, 1429 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:27,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:27,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:27,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:28,583 INFO L124 PetriNetUnfolderBase]: 1801/2777 cut-off events. [2024-06-03 22:48:28,583 INFO L125 PetriNetUnfolderBase]: For 52107/52125 co-relation queries the response was YES. [2024-06-03 22:48:28,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15331 conditions, 2777 events. 1801/2777 cut-off events. For 52107/52125 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13767 event pairs, 475 based on Foata normal form. 14/2784 useless extension candidates. Maximal degree in co-relation 15279. Up to 2661 conditions per place. [2024-06-03 22:48:28,597 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 124 selfloop transitions, 21 changer transitions 0/149 dead transitions. [2024-06-03 22:48:28,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 149 transitions, 1757 flow [2024-06-03 22:48:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:48:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:48:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-03 22:48:28,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-03 22:48:28,599 INFO L175 Difference]: Start difference. First operand has 119 places, 138 transitions, 1429 flow. Second operand 6 states and 98 transitions. [2024-06-03 22:48:28,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 149 transitions, 1757 flow [2024-06-03 22:48:28,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 149 transitions, 1553 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-03 22:48:28,636 INFO L231 Difference]: Finished difference. Result has 114 places, 138 transitions, 1275 flow [2024-06-03 22:48:28,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1275, PETRI_PLACES=114, PETRI_TRANSITIONS=138} [2024-06-03 22:48:28,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-03 22:48:28,637 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 138 transitions, 1275 flow [2024-06-03 22:48:28,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:28,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:28,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:28,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:48:28,637 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:48:28,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1703786927, now seen corresponding path program 1 times [2024-06-03 22:48:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030871220] [2024-06-03 22:48:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:35,343 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-03 22:48:35,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:35,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030871220] [2024-06-03 22:48:35,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030871220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:35,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:35,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:48:35,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426157288] [2024-06-03 22:48:35,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:35,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:48:35,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:35,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:48:35,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:48:35,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:35,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 138 transitions, 1275 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:35,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:35,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:35,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:36,164 INFO L124 PetriNetUnfolderBase]: 1806/2778 cut-off events. [2024-06-03 22:48:36,164 INFO L125 PetriNetUnfolderBase]: For 53584/53586 co-relation queries the response was YES. [2024-06-03 22:48:36,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14936 conditions, 2778 events. 1806/2778 cut-off events. For 53584/53586 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13727 event pairs, 509 based on Foata normal form. 1/2776 useless extension candidates. Maximal degree in co-relation 14883. Up to 2698 conditions per place. [2024-06-03 22:48:36,180 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 138 selfloop transitions, 11 changer transitions 0/153 dead transitions. [2024-06-03 22:48:36,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 153 transitions, 1633 flow [2024-06-03 22:48:36,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:48:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:48:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-03 22:48:36,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-03 22:48:36,182 INFO L175 Difference]: Start difference. First operand has 114 places, 138 transitions, 1275 flow. Second operand 6 states and 97 transitions. [2024-06-03 22:48:36,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 153 transitions, 1633 flow [2024-06-03 22:48:36,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 153 transitions, 1574 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:48:36,234 INFO L231 Difference]: Finished difference. Result has 115 places, 141 transitions, 1274 flow [2024-06-03 22:48:36,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1274, PETRI_PLACES=115, PETRI_TRANSITIONS=141} [2024-06-03 22:48:36,235 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-06-03 22:48:36,235 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 141 transitions, 1274 flow [2024-06-03 22:48:36,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:36,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:36,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:36,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:48:36,236 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:48:36,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1698073007, now seen corresponding path program 2 times [2024-06-03 22:48:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125178361] [2024-06-03 22:48:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:42,905 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-03 22:48:42,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125178361] [2024-06-03 22:48:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125178361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:42,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:42,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:48:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128823334] [2024-06-03 22:48:42,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:42,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:48:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:42,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:48:42,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:48:43,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:43,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 141 transitions, 1274 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:43,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:43,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:43,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:43,763 INFO L124 PetriNetUnfolderBase]: 1803/2775 cut-off events. [2024-06-03 22:48:43,763 INFO L125 PetriNetUnfolderBase]: For 56952/56957 co-relation queries the response was YES. [2024-06-03 22:48:43,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15244 conditions, 2775 events. 1803/2775 cut-off events. For 56952/56957 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13715 event pairs, 513 based on Foata normal form. 3/2774 useless extension candidates. Maximal degree in co-relation 15190. Up to 2688 conditions per place. [2024-06-03 22:48:43,778 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 133 selfloop transitions, 16 changer transitions 0/153 dead transitions. [2024-06-03 22:48:43,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 153 transitions, 1628 flow [2024-06-03 22:48:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:48:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:48:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-03 22:48:43,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:48:43,779 INFO L175 Difference]: Start difference. First operand has 115 places, 141 transitions, 1274 flow. Second operand 6 states and 96 transitions. [2024-06-03 22:48:43,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 153 transitions, 1628 flow [2024-06-03 22:48:43,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 153 transitions, 1592 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 22:48:43,819 INFO L231 Difference]: Finished difference. Result has 117 places, 144 transitions, 1312 flow [2024-06-03 22:48:43,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=117, PETRI_TRANSITIONS=144} [2024-06-03 22:48:43,820 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-03 22:48:43,820 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 144 transitions, 1312 flow [2024-06-03 22:48:43,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-03 22:48:43,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:43,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:48:43,820 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:48:43,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash -562134241, now seen corresponding path program 1 times [2024-06-03 22:48:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099654203] [2024-06-03 22:48:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:51,608 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-03 22:48:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:51,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099654203] [2024-06-03 22:48:51,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099654203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:51,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:51,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:48:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678742833] [2024-06-03 22:48:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:51,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:48:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:51,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:48:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:48:51,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:51,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 144 transitions, 1312 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:48:51,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:51,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:51,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:52,503 INFO L124 PetriNetUnfolderBase]: 1805/2783 cut-off events. [2024-06-03 22:48:52,503 INFO L125 PetriNetUnfolderBase]: For 60984/61002 co-relation queries the response was YES. [2024-06-03 22:48:52,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15623 conditions, 2783 events. 1805/2783 cut-off events. For 60984/61002 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13808 event pairs, 472 based on Foata normal form. 14/2790 useless extension candidates. Maximal degree in co-relation 15568. Up to 2661 conditions per place. [2024-06-03 22:48:52,519 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 130 selfloop transitions, 26 changer transitions 0/160 dead transitions. [2024-06-03 22:48:52,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 160 transitions, 1708 flow [2024-06-03 22:48:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:48:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:48:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-03 22:48:52,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-03 22:48:52,520 INFO L175 Difference]: Start difference. First operand has 117 places, 144 transitions, 1312 flow. Second operand 7 states and 111 transitions. [2024-06-03 22:48:52,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 160 transitions, 1708 flow [2024-06-03 22:48:52,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 1656 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 22:48:52,566 INFO L231 Difference]: Finished difference. Result has 120 places, 148 transitions, 1371 flow [2024-06-03 22:48:52,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1371, PETRI_PLACES=120, PETRI_TRANSITIONS=148} [2024-06-03 22:48:52,567 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2024-06-03 22:48:52,567 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 148 transitions, 1371 flow [2024-06-03 22:48:52,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:48:52,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:52,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:52,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:48:52,568 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:48:52,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash 569620843, now seen corresponding path program 1 times [2024-06-03 22:48:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:52,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711225198] [2024-06-03 22:48:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:59,582 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-03 22:48:59,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:59,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711225198] [2024-06-03 22:48:59,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711225198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:59,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:59,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:48:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879426760] [2024-06-03 22:48:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:48:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:48:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:48:59,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:48:59,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 148 transitions, 1371 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:48:59,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:59,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:48:59,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:00,606 INFO L124 PetriNetUnfolderBase]: 1815/2800 cut-off events. [2024-06-03 22:49:00,606 INFO L125 PetriNetUnfolderBase]: For 65080/65089 co-relation queries the response was YES. [2024-06-03 22:49:00,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16187 conditions, 2800 events. 1815/2800 cut-off events. For 65080/65089 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13947 event pairs, 464 based on Foata normal form. 10/2806 useless extension candidates. Maximal degree in co-relation 16131. Up to 2578 conditions per place. [2024-06-03 22:49:00,621 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 132 selfloop transitions, 38 changer transitions 0/174 dead transitions. [2024-06-03 22:49:00,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 174 transitions, 1819 flow [2024-06-03 22:49:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:49:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:49:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 22:49:00,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:49:00,622 INFO L175 Difference]: Start difference. First operand has 120 places, 148 transitions, 1371 flow. Second operand 7 states and 123 transitions. [2024-06-03 22:49:00,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 174 transitions, 1819 flow [2024-06-03 22:49:00,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 174 transitions, 1736 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 22:49:00,664 INFO L231 Difference]: Finished difference. Result has 122 places, 152 transitions, 1416 flow [2024-06-03 22:49:00,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1416, PETRI_PLACES=122, PETRI_TRANSITIONS=152} [2024-06-03 22:49:00,664 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2024-06-03 22:49:00,665 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 1416 flow [2024-06-03 22:49:00,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:49:00,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:00,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:00,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:49:00,665 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:49:00,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash -949175636, now seen corresponding path program 1 times [2024-06-03 22:49:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126905470] [2024-06-03 22:49:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:10,445 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-03 22:49:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126905470] [2024-06-03 22:49:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126905470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:49:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132690954] [2024-06-03 22:49:10,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:10,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:49:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:49:10,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:49:10,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:49:10,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 1416 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:10,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:10,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:49:10,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:11,702 INFO L124 PetriNetUnfolderBase]: 1898/2947 cut-off events. [2024-06-03 22:49:11,703 INFO L125 PetriNetUnfolderBase]: For 75264/75273 co-relation queries the response was YES. [2024-06-03 22:49:11,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17346 conditions, 2947 events. 1898/2947 cut-off events. For 75264/75273 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14922 event pairs, 160 based on Foata normal form. 24/2967 useless extension candidates. Maximal degree in co-relation 17289. Up to 1622 conditions per place. [2024-06-03 22:49:11,720 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 129 selfloop transitions, 81 changer transitions 0/214 dead transitions. [2024-06-03 22:49:11,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 214 transitions, 2210 flow [2024-06-03 22:49:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:49:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:49:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-06-03 22:49:11,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44567627494456763 [2024-06-03 22:49:11,723 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 1416 flow. Second operand 11 states and 201 transitions. [2024-06-03 22:49:11,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 214 transitions, 2210 flow [2024-06-03 22:49:11,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 214 transitions, 2048 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 22:49:11,787 INFO L231 Difference]: Finished difference. Result has 126 places, 155 transitions, 1485 flow [2024-06-03 22:49:11,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1485, PETRI_PLACES=126, PETRI_TRANSITIONS=155} [2024-06-03 22:49:11,788 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2024-06-03 22:49:11,788 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 155 transitions, 1485 flow [2024-06-03 22:49:11,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:11,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:11,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:11,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:49:11,788 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:49:11,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:11,789 INFO L85 PathProgramCache]: Analyzing trace with hash -949027766, now seen corresponding path program 2 times [2024-06-03 22:49:11,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:11,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826284754] [2024-06-03 22:49:11,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:11,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:21,519 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-03 22:49:21,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:21,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826284754] [2024-06-03 22:49:21,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826284754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:21,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:21,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:49:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62014802] [2024-06-03 22:49:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:21,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:49:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:49:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:49:21,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:49:21,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 155 transitions, 1485 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:21,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:21,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:49:21,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:22,776 INFO L124 PetriNetUnfolderBase]: 1973/3072 cut-off events. [2024-06-03 22:49:22,776 INFO L125 PetriNetUnfolderBase]: For 82788/82797 co-relation queries the response was YES. [2024-06-03 22:49:22,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18461 conditions, 3072 events. 1973/3072 cut-off events. For 82788/82797 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15789 event pairs, 170 based on Foata normal form. 28/3096 useless extension candidates. Maximal degree in co-relation 18403. Up to 1642 conditions per place. [2024-06-03 22:49:22,797 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 135 selfloop transitions, 77 changer transitions 0/216 dead transitions. [2024-06-03 22:49:22,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 216 transitions, 2204 flow [2024-06-03 22:49:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:49:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:49:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-06-03 22:49:22,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434589800443459 [2024-06-03 22:49:22,800 INFO L175 Difference]: Start difference. First operand has 126 places, 155 transitions, 1485 flow. Second operand 11 states and 200 transitions. [2024-06-03 22:49:22,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 216 transitions, 2204 flow [2024-06-03 22:49:22,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 216 transitions, 2074 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:49:22,872 INFO L231 Difference]: Finished difference. Result has 131 places, 158 transitions, 1574 flow [2024-06-03 22:49:22,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1574, PETRI_PLACES=131, PETRI_TRANSITIONS=158} [2024-06-03 22:49:22,872 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2024-06-03 22:49:22,873 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 158 transitions, 1574 flow [2024-06-03 22:49:22,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:22,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:22,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:22,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:49:22,873 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:49:22,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash -943665386, now seen corresponding path program 3 times [2024-06-03 22:49:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143326820] [2024-06-03 22:49:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:32,439 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-03 22:49:32,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143326820] [2024-06-03 22:49:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143326820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:32,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:49:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108705373] [2024-06-03 22:49:32,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:49:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:32,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:49:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:49:32,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:49:32,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 158 transitions, 1574 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:32,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:32,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:49:32,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:33,731 INFO L124 PetriNetUnfolderBase]: 2065/3223 cut-off events. [2024-06-03 22:49:33,731 INFO L125 PetriNetUnfolderBase]: For 91095/91100 co-relation queries the response was YES. [2024-06-03 22:49:33,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19573 conditions, 3223 events. 2065/3223 cut-off events. For 91095/91100 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16848 event pairs, 212 based on Foata normal form. 26/3245 useless extension candidates. Maximal degree in co-relation 19513. Up to 1666 conditions per place. [2024-06-03 22:49:33,752 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 71 changer transitions 0/211 dead transitions. [2024-06-03 22:49:33,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 211 transitions, 2264 flow [2024-06-03 22:49:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:49:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:49:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-03 22:49:33,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-03 22:49:33,755 INFO L175 Difference]: Start difference. First operand has 131 places, 158 transitions, 1574 flow. Second operand 10 states and 183 transitions. [2024-06-03 22:49:33,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 211 transitions, 2264 flow [2024-06-03 22:49:33,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 211 transitions, 2132 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:49:33,853 INFO L231 Difference]: Finished difference. Result has 135 places, 161 transitions, 1657 flow [2024-06-03 22:49:33,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1657, PETRI_PLACES=135, PETRI_TRANSITIONS=161} [2024-06-03 22:49:33,854 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-03 22:49:33,854 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 161 transitions, 1657 flow [2024-06-03 22:49:33,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:33,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:33,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:33,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:49:33,855 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:49:33,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1455102535, now seen corresponding path program 2 times [2024-06-03 22:49:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:33,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219172181] [2024-06-03 22:49:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:40,798 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-03 22:49:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219172181] [2024-06-03 22:49:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219172181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:40,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:49:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432507260] [2024-06-03 22:49:40,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:40,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:49:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:49:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:49:40,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:49:40,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 161 transitions, 1657 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:49:40,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:40,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:49:40,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:41,871 INFO L124 PetriNetUnfolderBase]: 2093/3274 cut-off events. [2024-06-03 22:49:41,872 INFO L125 PetriNetUnfolderBase]: For 95829/95834 co-relation queries the response was YES. [2024-06-03 22:49:41,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20321 conditions, 3274 events. 2093/3274 cut-off events. For 95829/95834 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17315 event pairs, 545 based on Foata normal form. 4/3274 useless extension candidates. Maximal degree in co-relation 20259. Up to 2993 conditions per place. [2024-06-03 22:49:41,891 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 140 selfloop transitions, 41 changer transitions 0/185 dead transitions. [2024-06-03 22:49:41,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 185 transitions, 2219 flow [2024-06-03 22:49:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:49:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:49:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:49:41,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:49:41,893 INFO L175 Difference]: Start difference. First operand has 135 places, 161 transitions, 1657 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:49:41,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 185 transitions, 2219 flow [2024-06-03 22:49:41,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 185 transitions, 2082 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 22:49:41,995 INFO L231 Difference]: Finished difference. Result has 136 places, 169 transitions, 1731 flow [2024-06-03 22:49:41,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1731, PETRI_PLACES=136, PETRI_TRANSITIONS=169} [2024-06-03 22:49:41,996 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-03 22:49:41,996 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 169 transitions, 1731 flow [2024-06-03 22:49:41,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:49:41,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:41,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:41,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:49:41,996 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:49:41,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -815738598, now seen corresponding path program 4 times [2024-06-03 22:49:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:41,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005376706] [2024-06-03 22:49:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:51,644 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-03 22:49:51,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:51,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005376706] [2024-06-03 22:49:51,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005376706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:51,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:51,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:49:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398304364] [2024-06-03 22:49:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:51,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:49:51,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:51,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:49:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:49:51,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:49:51,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 169 transitions, 1731 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:51,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:51,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:49:51,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:52,831 INFO L124 PetriNetUnfolderBase]: 2049/3206 cut-off events. [2024-06-03 22:49:52,831 INFO L125 PetriNetUnfolderBase]: For 95073/95084 co-relation queries the response was YES. [2024-06-03 22:49:52,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19568 conditions, 3206 events. 2049/3206 cut-off events. For 95073/95084 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16804 event pairs, 235 based on Foata normal form. 27/3218 useless extension candidates. Maximal degree in co-relation 19505. Up to 1693 conditions per place. [2024-06-03 22:49:52,849 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 138 selfloop transitions, 65 changer transitions 0/207 dead transitions. [2024-06-03 22:49:52,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 207 transitions, 2223 flow [2024-06-03 22:49:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-03 22:49:52,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-03 22:49:52,852 INFO L175 Difference]: Start difference. First operand has 136 places, 169 transitions, 1731 flow. Second operand 9 states and 159 transitions. [2024-06-03 22:49:52,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 207 transitions, 2223 flow [2024-06-03 22:49:52,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 207 transitions, 2130 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-03 22:49:52,944 INFO L231 Difference]: Finished difference. Result has 142 places, 168 transitions, 1736 flow [2024-06-03 22:49:52,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1736, PETRI_PLACES=142, PETRI_TRANSITIONS=168} [2024-06-03 22:49:52,944 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2024-06-03 22:49:52,944 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 168 transitions, 1736 flow [2024-06-03 22:49:52,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-03 22:49:52,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:52,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:52,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:49:52,945 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:49:52,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -246722133, now seen corresponding path program 3 times [2024-06-03 22:49:52,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:52,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333640441] [2024-06-03 22:49:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:50:00,385 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-03 22:50:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:50:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333640441] [2024-06-03 22:50:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333640441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:50:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:50:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:50:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324115641] [2024-06-03 22:50:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:50:00,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:50:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:50:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:50:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:50:00,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:50:00,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 168 transitions, 1736 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:00,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:50:00,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:50:00,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:50:01,397 INFO L124 PetriNetUnfolderBase]: 2081/3257 cut-off events. [2024-06-03 22:50:01,397 INFO L125 PetriNetUnfolderBase]: For 98191/98202 co-relation queries the response was YES. [2024-06-03 22:50:01,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20449 conditions, 3257 events. 2081/3257 cut-off events. For 98191/98202 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17212 event pairs, 540 based on Foata normal form. 7/3249 useless extension candidates. Maximal degree in co-relation 20383. Up to 2860 conditions per place. [2024-06-03 22:50:01,418 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 136 selfloop transitions, 56 changer transitions 0/196 dead transitions. [2024-06-03 22:50:01,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 196 transitions, 2482 flow [2024-06-03 22:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:50:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:50:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:50:01,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:50:01,419 INFO L175 Difference]: Start difference. First operand has 142 places, 168 transitions, 1736 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:50:01,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 196 transitions, 2482 flow [2024-06-03 22:50:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 196 transitions, 2261 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 22:50:01,509 INFO L231 Difference]: Finished difference. Result has 140 places, 182 transitions, 1859 flow [2024-06-03 22:50:01,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1859, PETRI_PLACES=140, PETRI_TRANSITIONS=182} [2024-06-03 22:50:01,509 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-06-03 22:50:01,509 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 182 transitions, 1859 flow [2024-06-03 22:50:01,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:01,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:50:01,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:50:01,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:50:01,510 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:50:01,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:50:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash -494949551, now seen corresponding path program 1 times [2024-06-03 22:50:01,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:50:01,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356331847] [2024-06-03 22:50:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:50:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:50:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:50:08,784 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-03 22:50:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:50:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356331847] [2024-06-03 22:50:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356331847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:50:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:50:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:50:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077393312] [2024-06-03 22:50:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:50:08,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:50:08,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:50:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:50:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:50:08,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:50:08,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 182 transitions, 1859 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 22:50:08,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:50:08,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:50:08,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:50:09,836 INFO L124 PetriNetUnfolderBase]: 2091/3270 cut-off events. [2024-06-03 22:50:09,836 INFO L125 PetriNetUnfolderBase]: For 97247/97249 co-relation queries the response was YES. [2024-06-03 22:50:09,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20698 conditions, 3270 events. 2091/3270 cut-off events. For 97247/97249 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17221 event pairs, 519 based on Foata normal form. 2/3269 useless extension candidates. Maximal degree in co-relation 20630. Up to 3134 conditions per place. [2024-06-03 22:50:09,857 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 183 selfloop transitions, 19 changer transitions 0/206 dead transitions. [2024-06-03 22:50:09,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 206 transitions, 2386 flow [2024-06-03 22:50:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:50:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:50:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-03 22:50:09,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719512195121951 [2024-06-03 22:50:09,860 INFO L175 Difference]: Start difference. First operand has 140 places, 182 transitions, 1859 flow. Second operand 8 states and 122 transitions. [2024-06-03 22:50:09,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 206 transitions, 2386 flow [2024-06-03 22:50:09,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 206 transitions, 2275 flow, removed 42 selfloop flow, removed 2 redundant places. [2024-06-03 22:50:09,970 INFO L231 Difference]: Finished difference. Result has 148 places, 190 transitions, 1886 flow [2024-06-03 22:50:09,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1886, PETRI_PLACES=148, PETRI_TRANSITIONS=190} [2024-06-03 22:50:09,970 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2024-06-03 22:50:09,970 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 1886 flow [2024-06-03 22:50:09,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 22:50:09,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:50:09,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:50:09,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:50:09,971 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:50:09,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:50:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1277786317, now seen corresponding path program 2 times [2024-06-03 22:50:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:50:09,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716548635] [2024-06-03 22:50:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:50:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:50:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:50:16,873 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-03 22:50:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:50:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716548635] [2024-06-03 22:50:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716548635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:50:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:50:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:50:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149502564] [2024-06-03 22:50:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:50:16,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:50:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:50:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:50:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:50:16,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:50:16,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 1886 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:16,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:50:16,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:50:16,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:50:17,924 INFO L124 PetriNetUnfolderBase]: 2109/3287 cut-off events. [2024-06-03 22:50:17,925 INFO L125 PetriNetUnfolderBase]: For 101827/101829 co-relation queries the response was YES. [2024-06-03 22:50:17,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21076 conditions, 3287 events. 2109/3287 cut-off events. For 101827/101829 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17214 event pairs, 519 based on Foata normal form. 2/3286 useless extension candidates. Maximal degree in co-relation 21004. Up to 3146 conditions per place. [2024-06-03 22:50:17,944 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 182 selfloop transitions, 25 changer transitions 0/211 dead transitions. [2024-06-03 22:50:17,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 211 transitions, 2514 flow [2024-06-03 22:50:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:50:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:50:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:50:17,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:50:17,945 INFO L175 Difference]: Start difference. First operand has 148 places, 190 transitions, 1886 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:50:17,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 211 transitions, 2514 flow [2024-06-03 22:50:18,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 211 transitions, 2454 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-03 22:50:18,042 INFO L231 Difference]: Finished difference. Result has 152 places, 196 transitions, 1988 flow [2024-06-03 22:50:18,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1988, PETRI_PLACES=152, PETRI_TRANSITIONS=196} [2024-06-03 22:50:18,043 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-03 22:50:18,043 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 196 transitions, 1988 flow [2024-06-03 22:50:18,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:18,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:50:18,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:50:18,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:50:18,043 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:50:18,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:50:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1586002909, now seen corresponding path program 1 times [2024-06-03 22:50:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:50:18,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254764324] [2024-06-03 22:50:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:50:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:50:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:50:25,307 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-03 22:50:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:50:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254764324] [2024-06-03 22:50:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254764324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:50:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:50:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:50:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065744228] [2024-06-03 22:50:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:50:25,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:50:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:50:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:50:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:50:25,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:50:25,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 196 transitions, 1988 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:25,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:50:25,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:50:25,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:50:26,374 INFO L124 PetriNetUnfolderBase]: 2160/3353 cut-off events. [2024-06-03 22:50:26,374 INFO L125 PetriNetUnfolderBase]: For 111740/111742 co-relation queries the response was YES. [2024-06-03 22:50:26,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22091 conditions, 3353 events. 2160/3353 cut-off events. For 111740/111742 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17494 event pairs, 499 based on Foata normal form. 3/3343 useless extension candidates. Maximal degree in co-relation 22018. Up to 3083 conditions per place. [2024-06-03 22:50:26,395 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 170 selfloop transitions, 49 changer transitions 0/223 dead transitions. [2024-06-03 22:50:26,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 223 transitions, 2714 flow [2024-06-03 22:50:26,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:50:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:50:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:50:26,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:50:26,396 INFO L175 Difference]: Start difference. First operand has 152 places, 196 transitions, 1988 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:50:26,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 223 transitions, 2714 flow [2024-06-03 22:50:26,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 223 transitions, 2640 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-03 22:50:26,512 INFO L231 Difference]: Finished difference. Result has 156 places, 209 transitions, 2239 flow [2024-06-03 22:50:26,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2239, PETRI_PLACES=156, PETRI_TRANSITIONS=209} [2024-06-03 22:50:26,513 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-03 22:50:26,513 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 209 transitions, 2239 flow [2024-06-03 22:50:26,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:26,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:50:26,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:50:26,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:50:26,513 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:50:26,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:50:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -246300099, now seen corresponding path program 2 times [2024-06-03 22:50:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:50:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971195373] [2024-06-03 22:50:26,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:50:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:50:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:50:33,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-03 22:50:33,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:50:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971195373] [2024-06-03 22:50:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971195373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:50:33,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:50:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:50:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497319990] [2024-06-03 22:50:33,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:50:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:50:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:50:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:50:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:50:33,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:50:33,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 209 transitions, 2239 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:33,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:50:33,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:50:33,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:50:34,718 INFO L124 PetriNetUnfolderBase]: 2177/3383 cut-off events. [2024-06-03 22:50:34,718 INFO L125 PetriNetUnfolderBase]: For 117538/117546 co-relation queries the response was YES. [2024-06-03 22:50:34,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22693 conditions, 3383 events. 2177/3383 cut-off events. For 117538/117546 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17738 event pairs, 503 based on Foata normal form. 7/3375 useless extension candidates. Maximal degree in co-relation 22618. Up to 2953 conditions per place. [2024-06-03 22:50:34,743 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 149 selfloop transitions, 74 changer transitions 0/227 dead transitions. [2024-06-03 22:50:34,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 227 transitions, 2980 flow [2024-06-03 22:50:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:50:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:50:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:50:34,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:50:34,744 INFO L175 Difference]: Start difference. First operand has 156 places, 209 transitions, 2239 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:50:34,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 227 transitions, 2980 flow [2024-06-03 22:50:34,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 227 transitions, 2851 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-03 22:50:34,896 INFO L231 Difference]: Finished difference. Result has 160 places, 215 transitions, 2395 flow [2024-06-03 22:50:34,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2395, PETRI_PLACES=160, PETRI_TRANSITIONS=215} [2024-06-03 22:50:34,896 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-03 22:50:34,897 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 215 transitions, 2395 flow [2024-06-03 22:50:34,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:34,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:50:34,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:50:34,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:50:34,897 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:50:34,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:50:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash -445430635, now seen corresponding path program 3 times [2024-06-03 22:50:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:50:34,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690505096] [2024-06-03 22:50:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:50:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:50:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:50:42,493 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-03 22:50:42,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:50:42,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690505096] [2024-06-03 22:50:42,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690505096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:50:42,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:50:42,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:50:42,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318120169] [2024-06-03 22:50:42,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:50:42,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:50:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:50:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:50:42,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:50:42,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:50:42,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 215 transitions, 2395 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:42,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:50:42,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:50:42,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:50:43,522 INFO L124 PetriNetUnfolderBase]: 2171/3375 cut-off events. [2024-06-03 22:50:43,523 INFO L125 PetriNetUnfolderBase]: For 124601/124609 co-relation queries the response was YES. [2024-06-03 22:50:43,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22968 conditions, 3375 events. 2171/3375 cut-off events. For 124601/124609 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17840 event pairs, 528 based on Foata normal form. 3/3374 useless extension candidates. Maximal degree in co-relation 22891. Up to 3221 conditions per place. [2024-06-03 22:50:43,549 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 194 selfloop transitions, 32 changer transitions 0/230 dead transitions. [2024-06-03 22:50:43,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 230 transitions, 3011 flow [2024-06-03 22:50:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:50:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:50:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-03 22:50:43,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-03 22:50:43,552 INFO L175 Difference]: Start difference. First operand has 160 places, 215 transitions, 2395 flow. Second operand 7 states and 113 transitions. [2024-06-03 22:50:43,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 230 transitions, 3011 flow [2024-06-03 22:50:43,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 230 transitions, 2764 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 22:50:43,702 INFO L231 Difference]: Finished difference. Result has 161 places, 218 transitions, 2278 flow [2024-06-03 22:50:43,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2278, PETRI_PLACES=161, PETRI_TRANSITIONS=218} [2024-06-03 22:50:43,703 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places. [2024-06-03 22:50:43,703 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 218 transitions, 2278 flow [2024-06-03 22:50:43,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:43,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:50:43,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:50:43,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:50:43,703 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:50:43,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:50:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash -246537249, now seen corresponding path program 3 times [2024-06-03 22:50:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:50:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984476203] [2024-06-03 22:50:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:50:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:50:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:50:50,848 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-03 22:50:50,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:50:50,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984476203] [2024-06-03 22:50:50,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984476203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:50:50,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:50:50,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:50:50,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991657305] [2024-06-03 22:50:50,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:50:50,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:50:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:50:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:50:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:50:50,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:50:50,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 218 transitions, 2278 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:50,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:50:50,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:50:50,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:50:51,872 INFO L124 PetriNetUnfolderBase]: 2174/3380 cut-off events. [2024-06-03 22:50:51,873 INFO L125 PetriNetUnfolderBase]: For 128911/128919 co-relation queries the response was YES. [2024-06-03 22:50:51,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22837 conditions, 3380 events. 2174/3380 cut-off events. For 128911/128919 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17825 event pairs, 517 based on Foata normal form. 7/3372 useless extension candidates. Maximal degree in co-relation 22760. Up to 2952 conditions per place. [2024-06-03 22:50:51,898 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 155 selfloop transitions, 74 changer transitions 0/233 dead transitions. [2024-06-03 22:50:51,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 233 transitions, 2976 flow [2024-06-03 22:50:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:50:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:50:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:50:51,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:50:51,899 INFO L175 Difference]: Start difference. First operand has 161 places, 218 transitions, 2278 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:50:51,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 233 transitions, 2976 flow [2024-06-03 22:50:52,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 233 transitions, 2868 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-03 22:50:52,041 INFO L231 Difference]: Finished difference. Result has 163 places, 222 transitions, 2386 flow [2024-06-03 22:50:52,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2386, PETRI_PLACES=163, PETRI_TRANSITIONS=222} [2024-06-03 22:50:52,042 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2024-06-03 22:50:52,042 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 222 transitions, 2386 flow [2024-06-03 22:50:52,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:50:52,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:50:52,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:50:52,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:50:52,042 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:50:52,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:50:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash -246291171, now seen corresponding path program 1 times [2024-06-03 22:50:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:50:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416431856] [2024-06-03 22:50:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:50:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:50:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:51:00,347 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-03 22:51:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:51:00,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416431856] [2024-06-03 22:51:00,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416431856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:51:00,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:51:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:51:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680702318] [2024-06-03 22:51:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:51:00,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:51:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:51:00,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:51:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:51:00,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:51:00,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 222 transitions, 2386 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:51:00,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:51:00,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:51:00,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:51:01,423 INFO L124 PetriNetUnfolderBase]: 2177/3388 cut-off events. [2024-06-03 22:51:01,423 INFO L125 PetriNetUnfolderBase]: For 133630/133642 co-relation queries the response was YES. [2024-06-03 22:51:01,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23225 conditions, 3388 events. 2177/3388 cut-off events. For 133630/133642 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17755 event pairs, 489 based on Foata normal form. 12/3394 useless extension candidates. Maximal degree in co-relation 23147. Up to 3229 conditions per place. [2024-06-03 22:51:01,452 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 205 selfloop transitions, 29 changer transitions 0/238 dead transitions. [2024-06-03 22:51:01,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 238 transitions, 2966 flow [2024-06-03 22:51:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:51:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:51:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-03 22:51:01,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-03 22:51:01,453 INFO L175 Difference]: Start difference. First operand has 163 places, 222 transitions, 2386 flow. Second operand 8 states and 123 transitions. [2024-06-03 22:51:01,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 238 transitions, 2966 flow [2024-06-03 22:51:01,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 238 transitions, 2783 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-03 22:51:01,649 INFO L231 Difference]: Finished difference. Result has 166 places, 225 transitions, 2345 flow [2024-06-03 22:51:01,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2345, PETRI_PLACES=166, PETRI_TRANSITIONS=225} [2024-06-03 22:51:01,650 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 124 predicate places. [2024-06-03 22:51:01,650 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 225 transitions, 2345 flow [2024-06-03 22:51:01,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:51:01,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:51:01,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:51:01,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:51:01,650 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:51:01,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:51:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1522384857, now seen corresponding path program 1 times [2024-06-03 22:51:01,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:51:01,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515388096] [2024-06-03 22:51:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:51:01,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:51:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:51:09,151 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-03 22:51:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:51:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515388096] [2024-06-03 22:51:09,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515388096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:51:09,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:51:09,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:51:09,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309683684] [2024-06-03 22:51:09,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:51:09,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:51:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:51:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:51:09,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:51:09,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:51:09,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 225 transitions, 2345 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:51:09,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:51:09,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:51:09,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:51:10,258 INFO L124 PetriNetUnfolderBase]: 2187/3409 cut-off events. [2024-06-03 22:51:10,259 INFO L125 PetriNetUnfolderBase]: For 138990/139008 co-relation queries the response was YES. [2024-06-03 22:51:10,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23294 conditions, 3409 events. 2187/3409 cut-off events. For 138990/139008 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17962 event pairs, 487 based on Foata normal form. 14/3410 useless extension candidates. Maximal degree in co-relation 23217. Up to 3152 conditions per place. [2024-06-03 22:51:10,280 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 201 selfloop transitions, 40 changer transitions 0/245 dead transitions. [2024-06-03 22:51:10,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 245 transitions, 2942 flow [2024-06-03 22:51:10,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:51:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:51:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 22:51:10,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 22:51:10,282 INFO L175 Difference]: Start difference. First operand has 166 places, 225 transitions, 2345 flow. Second operand 7 states and 117 transitions. [2024-06-03 22:51:10,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 245 transitions, 2942 flow [2024-06-03 22:51:10,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 245 transitions, 2822 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-03 22:51:10,438 INFO L231 Difference]: Finished difference. Result has 167 places, 229 transitions, 2383 flow [2024-06-03 22:51:10,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2383, PETRI_PLACES=167, PETRI_TRANSITIONS=229} [2024-06-03 22:51:10,438 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-03 22:51:10,438 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 229 transitions, 2383 flow [2024-06-03 22:51:10,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:51:10,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:51:10,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:51:10,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:51:10,440 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:51:10,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:51:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -903064272, now seen corresponding path program 1 times [2024-06-03 22:51:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:51:10,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72211593] [2024-06-03 22:51:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:51:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:51:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:51:17,121 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-03 22:51:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:51:17,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72211593] [2024-06-03 22:51:17,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72211593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:51:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:51:17,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:51:17,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375602112] [2024-06-03 22:51:17,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:51:17,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:51:17,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:51:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:51:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:51:17,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:51:17,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 229 transitions, 2383 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:51:17,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:51:17,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:51:17,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:51:18,176 INFO L124 PetriNetUnfolderBase]: 2187/3402 cut-off events. [2024-06-03 22:51:18,176 INFO L125 PetriNetUnfolderBase]: For 143074/143082 co-relation queries the response was YES. [2024-06-03 22:51:18,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23353 conditions, 3402 events. 2187/3402 cut-off events. For 143074/143082 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17869 event pairs, 480 based on Foata normal form. 6/3404 useless extension candidates. Maximal degree in co-relation 23275. Up to 3154 conditions per place. [2024-06-03 22:51:18,204 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 39 changer transitions 0/250 dead transitions. [2024-06-03 22:51:18,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 250 transitions, 2977 flow [2024-06-03 22:51:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:51:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:51:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:51:18,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:51:18,205 INFO L175 Difference]: Start difference. First operand has 167 places, 229 transitions, 2383 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:51:18,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 250 transitions, 2977 flow [2024-06-03 22:51:18,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 250 transitions, 2868 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-03 22:51:18,388 INFO L231 Difference]: Finished difference. Result has 169 places, 232 transitions, 2413 flow [2024-06-03 22:51:18,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2413, PETRI_PLACES=169, PETRI_TRANSITIONS=232} [2024-06-03 22:51:18,389 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2024-06-03 22:51:18,389 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 232 transitions, 2413 flow [2024-06-03 22:51:18,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:51:18,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:51:18,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:51:18,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:51:18,389 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:51:18,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:51:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash 417467832, now seen corresponding path program 2 times [2024-06-03 22:51:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:51:18,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169504023] [2024-06-03 22:51:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:51:18,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:51:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:51:25,404 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-03 22:51:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:51:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169504023] [2024-06-03 22:51:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169504023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:51:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:51:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:51:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084162034] [2024-06-03 22:51:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:51:25,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:51:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:51:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:51:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:51:25,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:51:25,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 232 transitions, 2413 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:51:25,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:51:25,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:51:25,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:51:26,427 INFO L124 PetriNetUnfolderBase]: 2181/3393 cut-off events. [2024-06-03 22:51:26,427 INFO L125 PetriNetUnfolderBase]: For 147373/147381 co-relation queries the response was YES. [2024-06-03 22:51:26,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23331 conditions, 3393 events. 2181/3393 cut-off events. For 147373/147381 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17835 event pairs, 481 based on Foata normal form. 6/3395 useless extension candidates. Maximal degree in co-relation 23252. Up to 3106 conditions per place. [2024-06-03 22:51:26,455 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 195 selfloop transitions, 48 changer transitions 0/247 dead transitions. [2024-06-03 22:51:26,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 247 transitions, 3027 flow [2024-06-03 22:51:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:51:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:51:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:51:26,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-03 22:51:26,458 INFO L175 Difference]: Start difference. First operand has 169 places, 232 transitions, 2413 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:51:26,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 247 transitions, 3027 flow [2024-06-03 22:51:26,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 247 transitions, 2932 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 22:51:26,616 INFO L231 Difference]: Finished difference. Result has 171 places, 232 transitions, 2423 flow [2024-06-03 22:51:26,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2318, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2423, PETRI_PLACES=171, PETRI_TRANSITIONS=232} [2024-06-03 22:51:26,616 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-03 22:51:26,616 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 232 transitions, 2423 flow [2024-06-03 22:51:26,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:51:26,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:51:26,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:51:26,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:51:26,617 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:51:26,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:51:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2136473885, now seen corresponding path program 2 times [2024-06-03 22:51:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:51:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581723781] [2024-06-03 22:51:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:51:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:51:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:51:33,834 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-03 22:51:33,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:51:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581723781] [2024-06-03 22:51:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581723781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:51:33,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:51:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:51:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679213226] [2024-06-03 22:51:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:51:33,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:51:33,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:51:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:51:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:51:33,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:51:33,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 232 transitions, 2423 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:51:33,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:51:33,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:51:33,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:51:34,875 INFO L124 PetriNetUnfolderBase]: 2193/3413 cut-off events. [2024-06-03 22:51:34,875 INFO L125 PetriNetUnfolderBase]: For 153906/153914 co-relation queries the response was YES. [2024-06-03 22:51:34,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23622 conditions, 3413 events. 2193/3413 cut-off events. For 153906/153914 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17941 event pairs, 503 based on Foata normal form. 6/3404 useless extension candidates. Maximal degree in co-relation 23542. Up to 2974 conditions per place. [2024-06-03 22:51:34,903 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 156 selfloop transitions, 87 changer transitions 0/247 dead transitions. [2024-06-03 22:51:34,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 247 transitions, 3184 flow [2024-06-03 22:51:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:51:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:51:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:51:34,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-03 22:51:34,909 INFO L175 Difference]: Start difference. First operand has 171 places, 232 transitions, 2423 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:51:34,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 247 transitions, 3184 flow [2024-06-03 22:51:35,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 247 transitions, 3096 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 22:51:35,128 INFO L231 Difference]: Finished difference. Result has 174 places, 236 transitions, 2592 flow [2024-06-03 22:51:35,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2592, PETRI_PLACES=174, PETRI_TRANSITIONS=236} [2024-06-03 22:51:35,129 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 132 predicate places. [2024-06-03 22:51:35,129 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 236 transitions, 2592 flow [2024-06-03 22:51:35,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:51:35,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:51:35,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:51:35,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:51:35,129 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:51:35,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:51:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash 487632433, now seen corresponding path program 3 times [2024-06-03 22:51:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:51:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458497817] [2024-06-03 22:51:35,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:51:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:51:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:51:42,813 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-03 22:51:42,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:51:42,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458497817] [2024-06-03 22:51:42,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458497817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:51:42,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:51:42,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:51:42,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802966374] [2024-06-03 22:51:42,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:51:42,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:51:42,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:51:42,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:51:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:51:42,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:51:42,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 236 transitions, 2592 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:51:42,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:51:42,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:51:42,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:51:43,792 INFO L124 PetriNetUnfolderBase]: 2187/3405 cut-off events. [2024-06-03 22:51:43,792 INFO L125 PetriNetUnfolderBase]: For 158447/158455 co-relation queries the response was YES. [2024-06-03 22:51:43,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23811 conditions, 3405 events. 2187/3405 cut-off events. For 158447/158455 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17894 event pairs, 503 based on Foata normal form. 6/3396 useless extension candidates. Maximal degree in co-relation 23730. Up to 2969 conditions per place. [2024-06-03 22:51:43,819 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 160 selfloop transitions, 82 changer transitions 0/246 dead transitions. [2024-06-03 22:51:43,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 246 transitions, 3192 flow [2024-06-03 22:51:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:51:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:51:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:51:43,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-03 22:51:43,820 INFO L175 Difference]: Start difference. First operand has 174 places, 236 transitions, 2592 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:51:43,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 246 transitions, 3192 flow [2024-06-03 22:51:44,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 246 transitions, 2998 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-03 22:51:44,060 INFO L231 Difference]: Finished difference. Result has 177 places, 236 transitions, 2570 flow [2024-06-03 22:51:44,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2570, PETRI_PLACES=177, PETRI_TRANSITIONS=236} [2024-06-03 22:51:44,061 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-03 22:51:44,061 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 236 transitions, 2570 flow [2024-06-03 22:51:44,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:51:44,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:51:44,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:51:44,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:51:44,062 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:51:44,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:51:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1635974830, now seen corresponding path program 3 times [2024-06-03 22:51:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:51:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689630049] [2024-06-03 22:51:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:51:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:51:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:51:51,993 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-03 22:51:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:51:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689630049] [2024-06-03 22:51:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689630049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:51:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:51:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:51:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310157383] [2024-06-03 22:51:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:51:51,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:51:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:51:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:51:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:51:52,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:51:52,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 236 transitions, 2570 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 22:51:52,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:51:52,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:51:52,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:51:53,123 INFO L124 PetriNetUnfolderBase]: 2182/3394 cut-off events. [2024-06-03 22:51:53,123 INFO L125 PetriNetUnfolderBase]: For 162047/162049 co-relation queries the response was YES. [2024-06-03 22:51:53,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23819 conditions, 3394 events. 2182/3394 cut-off events. For 162047/162049 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17730 event pairs, 509 based on Foata normal form. 3/3385 useless extension candidates. Maximal degree in co-relation 23737. Up to 3157 conditions per place. [2024-06-03 22:51:53,146 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 209 selfloop transitions, 41 changer transitions 0/254 dead transitions. [2024-06-03 22:51:53,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 254 transitions, 3142 flow [2024-06-03 22:51:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:51:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:51:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-03 22:51:53,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-03 22:51:53,148 INFO L175 Difference]: Start difference. First operand has 177 places, 236 transitions, 2570 flow. Second operand 8 states and 127 transitions. [2024-06-03 22:51:53,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 254 transitions, 3142 flow [2024-06-03 22:51:53,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 254 transitions, 2817 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-03 22:51:53,348 INFO L231 Difference]: Finished difference. Result has 177 places, 237 transitions, 2347 flow [2024-06-03 22:51:53,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2347, PETRI_PLACES=177, PETRI_TRANSITIONS=237} [2024-06-03 22:51:53,349 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-03 22:51:53,349 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 237 transitions, 2347 flow [2024-06-03 22:51:53,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 22:51:53,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:51:53,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:51:53,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:51:53,349 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:51:53,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:51:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash -956677200, now seen corresponding path program 4 times [2024-06-03 22:51:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:51:53,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780528873] [2024-06-03 22:51:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:51:53,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:51:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:00,663 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-03 22:52:00,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:00,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780528873] [2024-06-03 22:52:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780528873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:00,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:00,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:52:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416305957] [2024-06-03 22:52:00,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:00,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:52:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:52:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:52:00,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:00,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 237 transitions, 2347 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:52:00,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:00,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:00,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:52:01,700 INFO L124 PetriNetUnfolderBase]: 2174/3380 cut-off events. [2024-06-03 22:52:01,700 INFO L125 PetriNetUnfolderBase]: For 166638/166642 co-relation queries the response was YES. [2024-06-03 22:52:01,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23460 conditions, 3380 events. 2174/3380 cut-off events. For 166638/166642 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17714 event pairs, 510 based on Foata normal form. 3/3370 useless extension candidates. Maximal degree in co-relation 23377. Up to 3110 conditions per place. [2024-06-03 22:52:01,722 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 195 selfloop transitions, 51 changer transitions 0/250 dead transitions. [2024-06-03 22:52:01,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 250 transitions, 2879 flow [2024-06-03 22:52:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:52:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:52:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 22:52:01,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 22:52:01,724 INFO L175 Difference]: Start difference. First operand has 177 places, 237 transitions, 2347 flow. Second operand 7 states and 117 transitions. [2024-06-03 22:52:01,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 250 transitions, 2879 flow [2024-06-03 22:52:01,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 250 transitions, 2746 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 22:52:01,915 INFO L231 Difference]: Finished difference. Result has 178 places, 237 transitions, 2324 flow [2024-06-03 22:52:01,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2324, PETRI_PLACES=178, PETRI_TRANSITIONS=237} [2024-06-03 22:52:01,915 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2024-06-03 22:52:01,915 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 237 transitions, 2324 flow [2024-06-03 22:52:01,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:52:01,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:52:01,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:52:01,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:52:01,916 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:52:01,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:52:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 233718704, now seen corresponding path program 5 times [2024-06-03 22:52:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:52:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437796142] [2024-06-03 22:52:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:52:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:52:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:08,840 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-03 22:52:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437796142] [2024-06-03 22:52:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437796142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:08,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:52:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704901841] [2024-06-03 22:52:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:08,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:52:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:08,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:52:08,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:52:08,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:08,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 237 transitions, 2324 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:52:08,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:08,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:08,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:52:09,811 INFO L124 PetriNetUnfolderBase]: 2176/3389 cut-off events. [2024-06-03 22:52:09,811 INFO L125 PetriNetUnfolderBase]: For 173653/173663 co-relation queries the response was YES. [2024-06-03 22:52:09,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23512 conditions, 3389 events. 2176/3389 cut-off events. For 173653/173663 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17836 event pairs, 532 based on Foata normal form. 9/3383 useless extension candidates. Maximal degree in co-relation 23427. Up to 2959 conditions per place. [2024-06-03 22:52:09,833 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 164 selfloop transitions, 83 changer transitions 0/251 dead transitions. [2024-06-03 22:52:09,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 251 transitions, 2990 flow [2024-06-03 22:52:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:52:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:52:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:52:09,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-03 22:52:09,834 INFO L175 Difference]: Start difference. First operand has 178 places, 237 transitions, 2324 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:52:09,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 251 transitions, 2990 flow [2024-06-03 22:52:10,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 251 transitions, 2870 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:52:10,015 INFO L231 Difference]: Finished difference. Result has 179 places, 241 transitions, 2431 flow [2024-06-03 22:52:10,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2431, PETRI_PLACES=179, PETRI_TRANSITIONS=241} [2024-06-03 22:52:10,016 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places. [2024-06-03 22:52:10,016 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 241 transitions, 2431 flow [2024-06-03 22:52:10,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:52:10,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:52:10,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:52:10,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:52:10,016 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:52:10,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:52:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 239432624, now seen corresponding path program 6 times [2024-06-03 22:52:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:52:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589536194] [2024-06-03 22:52:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:52:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:52:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:16,856 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-03 22:52:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589536194] [2024-06-03 22:52:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589536194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:16,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:16,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:52:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650064635] [2024-06-03 22:52:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:16,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:52:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:52:16,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:52:16,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:16,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 241 transitions, 2431 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:52:16,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:16,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:16,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:52:17,854 INFO L124 PetriNetUnfolderBase]: 2160/3363 cut-off events. [2024-06-03 22:52:17,855 INFO L125 PetriNetUnfolderBase]: For 175682/175692 co-relation queries the response was YES. [2024-06-03 22:52:17,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23532 conditions, 3363 events. 2160/3363 cut-off events. For 175682/175692 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17635 event pairs, 532 based on Foata normal form. 7/3355 useless extension candidates. Maximal degree in co-relation 23446. Up to 2943 conditions per place. [2024-06-03 22:52:17,877 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 159 selfloop transitions, 87 changer transitions 0/250 dead transitions. [2024-06-03 22:52:17,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 250 transitions, 2947 flow [2024-06-03 22:52:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:52:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:52:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:52:17,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-03 22:52:17,878 INFO L175 Difference]: Start difference. First operand has 179 places, 241 transitions, 2431 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:52:17,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 250 transitions, 2947 flow [2024-06-03 22:52:18,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 250 transitions, 2764 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-03 22:52:18,081 INFO L231 Difference]: Finished difference. Result has 182 places, 241 transitions, 2431 flow [2024-06-03 22:52:18,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2431, PETRI_PLACES=182, PETRI_TRANSITIONS=241} [2024-06-03 22:52:18,081 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2024-06-03 22:52:18,081 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 241 transitions, 2431 flow [2024-06-03 22:52:18,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 22:52:18,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:52:18,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:52:18,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:52:18,082 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:52:18,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:52:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 246613650, now seen corresponding path program 1 times [2024-06-03 22:52:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:52:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619366897] [2024-06-03 22:52:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:52:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:52:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:25,705 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-03 22:52:25,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:25,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619366897] [2024-06-03 22:52:25,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619366897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:25,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:25,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:52:25,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492448445] [2024-06-03 22:52:25,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:25,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:52:25,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:25,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:52:25,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:52:25,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:25,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 241 transitions, 2431 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:52:25,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:25,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:25,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:52:26,704 INFO L124 PetriNetUnfolderBase]: 2165/3373 cut-off events. [2024-06-03 22:52:26,705 INFO L125 PetriNetUnfolderBase]: For 180859/180871 co-relation queries the response was YES. [2024-06-03 22:52:26,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23682 conditions, 3373 events. 2165/3373 cut-off events. For 180859/180871 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17719 event pairs, 517 based on Foata normal form. 9/3376 useless extension candidates. Maximal degree in co-relation 23595. Up to 3228 conditions per place. [2024-06-03 22:52:26,725 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 227 selfloop transitions, 24 changer transitions 0/255 dead transitions. [2024-06-03 22:52:26,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 255 transitions, 3025 flow [2024-06-03 22:52:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:52:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:52:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-03 22:52:26,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-03 22:52:26,726 INFO L175 Difference]: Start difference. First operand has 182 places, 241 transitions, 2431 flow. Second operand 7 states and 109 transitions. [2024-06-03 22:52:26,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 255 transitions, 3025 flow [2024-06-03 22:52:26,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 255 transitions, 2780 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 22:52:26,892 INFO L231 Difference]: Finished difference. Result has 181 places, 244 transitions, 2300 flow [2024-06-03 22:52:26,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2300, PETRI_PLACES=181, PETRI_TRANSITIONS=244} [2024-06-03 22:52:26,892 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places. [2024-06-03 22:52:26,893 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 244 transitions, 2300 flow [2024-06-03 22:52:26,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:52:26,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:52:26,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:52:26,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:52:26,893 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:52:26,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:52:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash 246626670, now seen corresponding path program 2 times [2024-06-03 22:52:26,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:52:26,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701546310] [2024-06-03 22:52:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:52:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:52:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:34,431 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-03 22:52:34,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701546310] [2024-06-03 22:52:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701546310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:34,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:34,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:52:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083858899] [2024-06-03 22:52:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:34,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:52:34,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:34,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:52:34,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:52:34,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:34,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 244 transitions, 2300 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:52:34,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:34,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:34,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:52:35,434 INFO L124 PetriNetUnfolderBase]: 2162/3369 cut-off events. [2024-06-03 22:52:35,434 INFO L125 PetriNetUnfolderBase]: For 185067/185079 co-relation queries the response was YES. [2024-06-03 22:52:35,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23643 conditions, 3369 events. 2162/3369 cut-off events. For 185067/185079 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17678 event pairs, 517 based on Foata normal form. 9/3372 useless extension candidates. Maximal degree in co-relation 23555. Up to 3215 conditions per place. [2024-06-03 22:52:35,459 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 224 selfloop transitions, 31 changer transitions 0/259 dead transitions. [2024-06-03 22:52:35,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 259 transitions, 2910 flow [2024-06-03 22:52:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:52:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:52:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-03 22:52:35,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719512195121951 [2024-06-03 22:52:35,460 INFO L175 Difference]: Start difference. First operand has 181 places, 244 transitions, 2300 flow. Second operand 8 states and 122 transitions. [2024-06-03 22:52:35,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 259 transitions, 2910 flow [2024-06-03 22:52:35,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 259 transitions, 2818 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-03 22:52:35,671 INFO L231 Difference]: Finished difference. Result has 184 places, 247 transitions, 2346 flow [2024-06-03 22:52:35,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2346, PETRI_PLACES=184, PETRI_TRANSITIONS=247} [2024-06-03 22:52:35,671 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-03 22:52:35,671 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 247 transitions, 2346 flow [2024-06-03 22:52:35,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-03 22:52:35,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:52:35,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:52:35,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:52:35,672 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:52:35,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:52:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash -960478544, now seen corresponding path program 1 times [2024-06-03 22:52:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:52:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742317582] [2024-06-03 22:52:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:52:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:52:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:42,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-03 22:52:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:42,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742317582] [2024-06-03 22:52:42,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742317582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:42,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:42,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:52:42,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293852151] [2024-06-03 22:52:42,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:42,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:52:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:52:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:52:43,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:43,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 247 transitions, 2346 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:52:43,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:43,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:43,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:52:43,990 INFO L124 PetriNetUnfolderBase]: 2159/3361 cut-off events. [2024-06-03 22:52:43,990 INFO L125 PetriNetUnfolderBase]: For 189777/189781 co-relation queries the response was YES. [2024-06-03 22:52:44,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23879 conditions, 3361 events. 2159/3361 cut-off events. For 189777/189781 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17665 event pairs, 540 based on Foata normal form. 2/3360 useless extension candidates. Maximal degree in co-relation 23790. Up to 3229 conditions per place. [2024-06-03 22:52:44,015 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 239 selfloop transitions, 20 changer transitions 0/263 dead transitions. [2024-06-03 22:52:44,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 263 transitions, 2912 flow [2024-06-03 22:52:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:52:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:52:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-03 22:52:44,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-03 22:52:44,017 INFO L175 Difference]: Start difference. First operand has 184 places, 247 transitions, 2346 flow. Second operand 7 states and 113 transitions. [2024-06-03 22:52:44,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 263 transitions, 2912 flow [2024-06-03 22:52:44,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 263 transitions, 2778 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-03 22:52:44,230 INFO L231 Difference]: Finished difference. Result has 185 places, 247 transitions, 2262 flow [2024-06-03 22:52:44,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2262, PETRI_PLACES=185, PETRI_TRANSITIONS=247} [2024-06-03 22:52:44,230 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2024-06-03 22:52:44,230 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 247 transitions, 2262 flow [2024-06-03 22:52:44,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:52:44,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:52:44,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:52:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:52:44,231 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:52:44,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:52:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash -960388179, now seen corresponding path program 1 times [2024-06-03 22:52:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:52:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604300000] [2024-06-03 22:52:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:52:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:52:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:50,802 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-03 22:52:50,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604300000] [2024-06-03 22:52:50,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604300000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:50,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:50,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:52:50,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72480277] [2024-06-03 22:52:50,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:50,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:52:50,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:50,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:52:50,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:52:50,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:50,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 247 transitions, 2262 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:52:50,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:50,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:50,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:52:51,906 INFO L124 PetriNetUnfolderBase]: 2245/3466 cut-off events. [2024-06-03 22:52:51,906 INFO L125 PetriNetUnfolderBase]: For 205398/205402 co-relation queries the response was YES. [2024-06-03 22:52:51,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24742 conditions, 3466 events. 2245/3466 cut-off events. For 205398/205402 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18073 event pairs, 448 based on Foata normal form. 7/3451 useless extension candidates. Maximal degree in co-relation 24652. Up to 2879 conditions per place. [2024-06-03 22:52:51,933 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 191 selfloop transitions, 97 changer transitions 0/292 dead transitions. [2024-06-03 22:52:51,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 292 transitions, 3317 flow [2024-06-03 22:52:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:52:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:52:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 22:52:51,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-03 22:52:51,934 INFO L175 Difference]: Start difference. First operand has 185 places, 247 transitions, 2262 flow. Second operand 8 states and 141 transitions. [2024-06-03 22:52:51,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 292 transitions, 3317 flow [2024-06-03 22:52:52,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 292 transitions, 3265 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:52:52,161 INFO L231 Difference]: Finished difference. Result has 189 places, 271 transitions, 2773 flow [2024-06-03 22:52:52,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2773, PETRI_PLACES=189, PETRI_TRANSITIONS=271} [2024-06-03 22:52:52,162 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2024-06-03 22:52:52,162 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 271 transitions, 2773 flow [2024-06-03 22:52:52,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:52:52,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:52:52,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:52:52,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:52:52,162 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:52:52,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:52:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1921448838, now seen corresponding path program 1 times [2024-06-03 22:52:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:52:52,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275910103] [2024-06-03 22:52:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:52:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:52:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:52:59,230 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-03 22:52:59,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:52:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275910103] [2024-06-03 22:52:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275910103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:52:59,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:52:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:52:59,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899536081] [2024-06-03 22:52:59,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:52:59,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:52:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:52:59,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:52:59,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:52:59,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:52:59,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 271 transitions, 2773 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:52:59,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:52:59,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:52:59,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:53:00,405 INFO L124 PetriNetUnfolderBase]: 2398/3679 cut-off events. [2024-06-03 22:53:00,405 INFO L125 PetriNetUnfolderBase]: For 243215/243219 co-relation queries the response was YES. [2024-06-03 22:53:00,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28487 conditions, 3679 events. 2398/3679 cut-off events. For 243215/243219 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19228 event pairs, 447 based on Foata normal form. 10/3667 useless extension candidates. Maximal degree in co-relation 28394. Up to 2878 conditions per place. [2024-06-03 22:53:00,433 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 181 selfloop transitions, 122 changer transitions 0/307 dead transitions. [2024-06-03 22:53:00,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 307 transitions, 3955 flow [2024-06-03 22:53:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:53:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:53:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 22:53:00,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:53:00,434 INFO L175 Difference]: Start difference. First operand has 189 places, 271 transitions, 2773 flow. Second operand 8 states and 144 transitions. [2024-06-03 22:53:00,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 307 transitions, 3955 flow [2024-06-03 22:53:00,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 307 transitions, 3801 flow, removed 56 selfloop flow, removed 2 redundant places. [2024-06-03 22:53:00,730 INFO L231 Difference]: Finished difference. Result has 196 places, 287 transitions, 3240 flow [2024-06-03 22:53:00,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3240, PETRI_PLACES=196, PETRI_TRANSITIONS=287} [2024-06-03 22:53:00,730 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-03 22:53:00,730 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 287 transitions, 3240 flow [2024-06-03 22:53:00,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:00,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:53:00,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:53:00,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:53:00,731 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:53:00,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:53:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash -956669109, now seen corresponding path program 2 times [2024-06-03 22:53:00,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:53:00,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63422168] [2024-06-03 22:53:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:53:00,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:53:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:53:07,603 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-03 22:53:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:53:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63422168] [2024-06-03 22:53:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63422168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:53:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:53:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:53:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882452607] [2024-06-03 22:53:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:53:07,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:53:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:53:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:53:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:53:07,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:53:07,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 287 transitions, 3240 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:07,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:53:07,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:53:07,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:53:08,813 INFO L124 PetriNetUnfolderBase]: 2556/3898 cut-off events. [2024-06-03 22:53:08,813 INFO L125 PetriNetUnfolderBase]: For 273152/273156 co-relation queries the response was YES. [2024-06-03 22:53:08,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32169 conditions, 3898 events. 2556/3898 cut-off events. For 273152/273156 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20421 event pairs, 486 based on Foata normal form. 7/3883 useless extension candidates. Maximal degree in co-relation 32073. Up to 2963 conditions per place. [2024-06-03 22:53:08,914 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 196 selfloop transitions, 131 changer transitions 0/331 dead transitions. [2024-06-03 22:53:08,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 331 transitions, 4675 flow [2024-06-03 22:53:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:53:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:53:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 22:53:08,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-03 22:53:08,915 INFO L175 Difference]: Start difference. First operand has 196 places, 287 transitions, 3240 flow. Second operand 8 states and 145 transitions. [2024-06-03 22:53:08,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 331 transitions, 4675 flow [2024-06-03 22:53:09,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 331 transitions, 4371 flow, removed 105 selfloop flow, removed 3 redundant places. [2024-06-03 22:53:09,242 INFO L231 Difference]: Finished difference. Result has 203 places, 309 transitions, 3745 flow [2024-06-03 22:53:09,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3745, PETRI_PLACES=203, PETRI_TRANSITIONS=309} [2024-06-03 22:53:09,242 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2024-06-03 22:53:09,243 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 309 transitions, 3745 flow [2024-06-03 22:53:09,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:09,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:53:09,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:53:09,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:53:09,243 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:53:09,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:53:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1921449055, now seen corresponding path program 3 times [2024-06-03 22:53:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:53:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055563177] [2024-06-03 22:53:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:53:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:53:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:53:16,064 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-03 22:53:16,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:53:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055563177] [2024-06-03 22:53:16,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055563177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:53:16,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:53:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:53:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849134651] [2024-06-03 22:53:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:53:16,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:53:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:53:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:53:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:53:16,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:53:16,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 309 transitions, 3745 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:16,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:53:16,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:53:16,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:53:17,348 INFO L124 PetriNetUnfolderBase]: 2534/3869 cut-off events. [2024-06-03 22:53:17,348 INFO L125 PetriNetUnfolderBase]: For 278421/278425 co-relation queries the response was YES. [2024-06-03 22:53:17,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31880 conditions, 3869 events. 2534/3869 cut-off events. For 278421/278425 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20213 event pairs, 468 based on Foata normal form. 13/3860 useless extension candidates. Maximal degree in co-relation 31780. Up to 2957 conditions per place. [2024-06-03 22:53:17,374 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 189 selfloop transitions, 141 changer transitions 0/334 dead transitions. [2024-06-03 22:53:17,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 334 transitions, 4817 flow [2024-06-03 22:53:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:53:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:53:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:53:17,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:53:17,376 INFO L175 Difference]: Start difference. First operand has 203 places, 309 transitions, 3745 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:53:17,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 334 transitions, 4817 flow [2024-06-03 22:53:17,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 334 transitions, 4585 flow, removed 69 selfloop flow, removed 3 redundant places. [2024-06-03 22:53:17,707 INFO L231 Difference]: Finished difference. Result has 208 places, 314 transitions, 3941 flow [2024-06-03 22:53:17,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3941, PETRI_PLACES=208, PETRI_TRANSITIONS=314} [2024-06-03 22:53:17,707 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2024-06-03 22:53:17,707 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 314 transitions, 3941 flow [2024-06-03 22:53:17,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:17,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:53:17,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:53:17,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:53:17,708 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:53:17,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:53:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash 239440715, now seen corresponding path program 4 times [2024-06-03 22:53:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:53:17,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139123690] [2024-06-03 22:53:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:53:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:53:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:53:24,735 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-03 22:53:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:53:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139123690] [2024-06-03 22:53:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139123690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:53:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:53:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:53:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27616168] [2024-06-03 22:53:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:53:24,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:53:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:53:24,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:53:24,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:53:24,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:53:24,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 314 transitions, 3941 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:24,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:53:24,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:53:24,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:53:26,009 INFO L124 PetriNetUnfolderBase]: 2676/4085 cut-off events. [2024-06-03 22:53:26,009 INFO L125 PetriNetUnfolderBase]: For 302219/302229 co-relation queries the response was YES. [2024-06-03 22:53:26,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34561 conditions, 4085 events. 2676/4085 cut-off events. For 302219/302229 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21599 event pairs, 552 based on Foata normal form. 8/4075 useless extension candidates. Maximal degree in co-relation 34459. Up to 2542 conditions per place. [2024-06-03 22:53:26,041 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 204 selfloop transitions, 149 changer transitions 0/357 dead transitions. [2024-06-03 22:53:26,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 357 transitions, 5521 flow [2024-06-03 22:53:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:53:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:53:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:53:26,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:53:26,043 INFO L175 Difference]: Start difference. First operand has 208 places, 314 transitions, 3941 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:53:26,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 357 transitions, 5521 flow [2024-06-03 22:53:26,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 357 transitions, 5223 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-03 22:53:26,478 INFO L231 Difference]: Finished difference. Result has 215 places, 334 transitions, 4489 flow [2024-06-03 22:53:26,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3643, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4489, PETRI_PLACES=215, PETRI_TRANSITIONS=334} [2024-06-03 22:53:26,478 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-03 22:53:26,478 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 334 transitions, 4489 flow [2024-06-03 22:53:26,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:26,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:53:26,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:53:26,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:53:26,479 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:53:26,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:53:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 239446295, now seen corresponding path program 5 times [2024-06-03 22:53:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:53:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83481806] [2024-06-03 22:53:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:53:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:53:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:53:33,508 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-03 22:53:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:53:33,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83481806] [2024-06-03 22:53:33,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83481806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:53:33,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:53:33,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:53:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571022936] [2024-06-03 22:53:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:53:33,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:53:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:53:33,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:53:33,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:53:33,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:53:33,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 334 transitions, 4489 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:33,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:53:33,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:53:33,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:53:34,782 INFO L124 PetriNetUnfolderBase]: 2820/4286 cut-off events. [2024-06-03 22:53:34,783 INFO L125 PetriNetUnfolderBase]: For 346791/346801 co-relation queries the response was YES. [2024-06-03 22:53:34,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38332 conditions, 4286 events. 2820/4286 cut-off events. For 346791/346801 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22710 event pairs, 570 based on Foata normal form. 14/4282 useless extension candidates. Maximal degree in co-relation 38226. Up to 2630 conditions per place. [2024-06-03 22:53:34,819 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 206 selfloop transitions, 158 changer transitions 0/368 dead transitions. [2024-06-03 22:53:34,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 368 transitions, 5981 flow [2024-06-03 22:53:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:53:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:53:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-03 22:53:34,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-03 22:53:34,820 INFO L175 Difference]: Start difference. First operand has 215 places, 334 transitions, 4489 flow. Second operand 8 states and 147 transitions. [2024-06-03 22:53:34,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 368 transitions, 5981 flow [2024-06-03 22:53:35,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 368 transitions, 5689 flow, removed 115 selfloop flow, removed 2 redundant places. [2024-06-03 22:53:35,356 INFO L231 Difference]: Finished difference. Result has 222 places, 346 transitions, 4834 flow [2024-06-03 22:53:35,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4251, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4834, PETRI_PLACES=222, PETRI_TRANSITIONS=346} [2024-06-03 22:53:35,356 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-03 22:53:35,356 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 346 transitions, 4834 flow [2024-06-03 22:53:35,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:35,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:53:35,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:53:35,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:53:35,357 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:53:35,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:53:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1777558308, now seen corresponding path program 2 times [2024-06-03 22:53:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:53:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472159819] [2024-06-03 22:53:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:53:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:53:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:53:42,625 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-03 22:53:42,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:53:42,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472159819] [2024-06-03 22:53:42,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472159819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:53:42,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:53:42,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:53:42,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48405402] [2024-06-03 22:53:42,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:53:42,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:53:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:53:42,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:53:42,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:53:42,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:53:42,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 346 transitions, 4834 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:42,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:53:42,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:53:42,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:53:44,021 INFO L124 PetriNetUnfolderBase]: 2789/4244 cut-off events. [2024-06-03 22:53:44,021 INFO L125 PetriNetUnfolderBase]: For 331574/331584 co-relation queries the response was YES. [2024-06-03 22:53:44,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37375 conditions, 4244 events. 2789/4244 cut-off events. For 331574/331584 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22499 event pairs, 556 based on Foata normal form. 11/4237 useless extension candidates. Maximal degree in co-relation 37266. Up to 3002 conditions per place. [2024-06-03 22:53:44,053 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 216 selfloop transitions, 155 changer transitions 0/375 dead transitions. [2024-06-03 22:53:44,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 375 transitions, 6126 flow [2024-06-03 22:53:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:53:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:53:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 22:53:44,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-03 22:53:44,054 INFO L175 Difference]: Start difference. First operand has 222 places, 346 transitions, 4834 flow. Second operand 8 states and 143 transitions. [2024-06-03 22:53:44,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 375 transitions, 6126 flow [2024-06-03 22:53:44,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 375 transitions, 5639 flow, removed 115 selfloop flow, removed 4 redundant places. [2024-06-03 22:53:44,564 INFO L231 Difference]: Finished difference. Result has 229 places, 356 transitions, 5039 flow [2024-06-03 22:53:44,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4427, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5039, PETRI_PLACES=229, PETRI_TRANSITIONS=356} [2024-06-03 22:53:44,565 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-03 22:53:44,565 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 356 transitions, 5039 flow [2024-06-03 22:53:44,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:44,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:53:44,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:53:44,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:53:44,566 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:53:44,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:53:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 247065072, now seen corresponding path program 3 times [2024-06-03 22:53:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:53:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494277757] [2024-06-03 22:53:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:53:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:53:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:53:52,011 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-03 22:53:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:53:52,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494277757] [2024-06-03 22:53:52,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494277757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:53:52,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:53:52,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:53:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116533949] [2024-06-03 22:53:52,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:53:52,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:53:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:53:52,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:53:52,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:53:52,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:53:52,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 356 transitions, 5039 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:52,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:53:52,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:53:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:53:53,411 INFO L124 PetriNetUnfolderBase]: 2934/4449 cut-off events. [2024-06-03 22:53:53,411 INFO L125 PetriNetUnfolderBase]: For 360619/360629 co-relation queries the response was YES. [2024-06-03 22:53:53,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40041 conditions, 4449 events. 2934/4449 cut-off events. For 360619/360629 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23644 event pairs, 526 based on Foata normal form. 5/4436 useless extension candidates. Maximal degree in co-relation 39928. Up to 2974 conditions per place. [2024-06-03 22:53:53,452 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 204 selfloop transitions, 190 changer transitions 0/398 dead transitions. [2024-06-03 22:53:53,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 398 transitions, 6764 flow [2024-06-03 22:53:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:53:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:53:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 22:53:53,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-03 22:53:53,453 INFO L175 Difference]: Start difference. First operand has 229 places, 356 transitions, 5039 flow. Second operand 8 states and 143 transitions. [2024-06-03 22:53:53,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 398 transitions, 6764 flow [2024-06-03 22:53:53,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 398 transitions, 6571 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 22:53:53,946 INFO L231 Difference]: Finished difference. Result has 235 places, 379 transitions, 5865 flow [2024-06-03 22:53:53,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4852, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5865, PETRI_PLACES=235, PETRI_TRANSITIONS=379} [2024-06-03 22:53:53,947 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-03 22:53:53,947 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 379 transitions, 5865 flow [2024-06-03 22:53:53,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:53:53,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:53:53,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:53:53,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:53:53,947 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:53:53,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:53:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 246797945, now seen corresponding path program 6 times [2024-06-03 22:53:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:53:53,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108132829] [2024-06-03 22:53:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:53:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:53:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:54:01,364 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-03 22:54:01,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:54:01,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108132829] [2024-06-03 22:54:01,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108132829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:54:01,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:54:01,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:54:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803070326] [2024-06-03 22:54:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:54:01,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:54:01,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:54:01,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:54:01,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:54:01,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:54:01,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 379 transitions, 5865 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:01,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:54:01,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:54:01,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:54:02,770 INFO L124 PetriNetUnfolderBase]: 2958/4490 cut-off events. [2024-06-03 22:54:02,770 INFO L125 PetriNetUnfolderBase]: For 381316/381326 co-relation queries the response was YES. [2024-06-03 22:54:02,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41254 conditions, 4490 events. 2958/4490 cut-off events. For 381316/381326 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23864 event pairs, 548 based on Foata normal form. 14/4486 useless extension candidates. Maximal degree in co-relation 41138. Up to 2737 conditions per place. [2024-06-03 22:54:02,809 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 202 selfloop transitions, 202 changer transitions 0/408 dead transitions. [2024-06-03 22:54:02,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 408 transitions, 7339 flow [2024-06-03 22:54:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:54:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:54:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-03 22:54:02,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-03 22:54:02,810 INFO L175 Difference]: Start difference. First operand has 235 places, 379 transitions, 5865 flow. Second operand 8 states and 147 transitions. [2024-06-03 22:54:02,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 408 transitions, 7339 flow [2024-06-03 22:54:03,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 408 transitions, 7145 flow, removed 66 selfloop flow, removed 2 redundant places. [2024-06-03 22:54:03,407 INFO L231 Difference]: Finished difference. Result has 242 places, 389 transitions, 6354 flow [2024-06-03 22:54:03,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5675, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6354, PETRI_PLACES=242, PETRI_TRANSITIONS=389} [2024-06-03 22:54:03,407 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places. [2024-06-03 22:54:03,407 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 389 transitions, 6354 flow [2024-06-03 22:54:03,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:03,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:54:03,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:54:03,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:54:03,408 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:54:03,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:54:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash 954632608, now seen corresponding path program 4 times [2024-06-03 22:54:03,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:54:03,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064483377] [2024-06-03 22:54:03,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:54:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:54:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:54:11,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-03 22:54:11,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:54:11,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064483377] [2024-06-03 22:54:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064483377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:54:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:54:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:54:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20612994] [2024-06-03 22:54:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:54:11,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:54:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:54:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:54:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:54:11,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:54:11,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 389 transitions, 6354 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:11,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:54:11,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:54:11,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:54:12,579 INFO L124 PetriNetUnfolderBase]: 2941/4464 cut-off events. [2024-06-03 22:54:12,579 INFO L125 PetriNetUnfolderBase]: For 365676/365686 co-relation queries the response was YES. [2024-06-03 22:54:12,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41932 conditions, 4464 events. 2941/4464 cut-off events. For 365676/365686 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23609 event pairs, 532 based on Foata normal form. 8/4457 useless extension candidates. Maximal degree in co-relation 41813. Up to 4024 conditions per place. [2024-06-03 22:54:12,616 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 303 selfloop transitions, 96 changer transitions 0/403 dead transitions. [2024-06-03 22:54:12,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 403 transitions, 7290 flow [2024-06-03 22:54:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:54:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:54:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:54:12,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:54:12,618 INFO L175 Difference]: Start difference. First operand has 242 places, 389 transitions, 6354 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:54:12,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 403 transitions, 7290 flow [2024-06-03 22:54:13,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 403 transitions, 6905 flow, removed 93 selfloop flow, removed 4 redundant places. [2024-06-03 22:54:13,179 INFO L231 Difference]: Finished difference. Result has 246 places, 393 transitions, 6289 flow [2024-06-03 22:54:13,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5983, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6289, PETRI_PLACES=246, PETRI_TRANSITIONS=393} [2024-06-03 22:54:13,180 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places. [2024-06-03 22:54:13,180 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 393 transitions, 6289 flow [2024-06-03 22:54:13,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:13,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:54:13,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:54:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:54:13,180 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:54:13,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:54:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash -574382386, now seen corresponding path program 1 times [2024-06-03 22:54:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:54:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866040230] [2024-06-03 22:54:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:54:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:54:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:54:20,063 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-03 22:54:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:54:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866040230] [2024-06-03 22:54:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866040230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:54:20,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:54:20,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:54:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831943062] [2024-06-03 22:54:20,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:54:20,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:54:20,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:54:20,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:54:20,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:54:20,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:54:20,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 393 transitions, 6289 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:20,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:54:20,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:54:20,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:54:21,501 INFO L124 PetriNetUnfolderBase]: 2957/4493 cut-off events. [2024-06-03 22:54:21,502 INFO L125 PetriNetUnfolderBase]: For 379011/379023 co-relation queries the response was YES. [2024-06-03 22:54:21,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41398 conditions, 4493 events. 2957/4493 cut-off events. For 379011/379023 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23791 event pairs, 395 based on Foata normal form. 14/4503 useless extension candidates. Maximal degree in co-relation 41279. Up to 4121 conditions per place. [2024-06-03 22:54:21,544 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 378 selfloop transitions, 46 changer transitions 0/428 dead transitions. [2024-06-03 22:54:21,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 428 transitions, 7307 flow [2024-06-03 22:54:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:54:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:54:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-03 22:54:21,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:54:21,545 INFO L175 Difference]: Start difference. First operand has 246 places, 393 transitions, 6289 flow. Second operand 9 states and 153 transitions. [2024-06-03 22:54:21,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 428 transitions, 7307 flow [2024-06-03 22:54:22,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 428 transitions, 7033 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-03 22:54:22,134 INFO L231 Difference]: Finished difference. Result has 249 places, 396 transitions, 6189 flow [2024-06-03 22:54:22,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6015, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6189, PETRI_PLACES=249, PETRI_TRANSITIONS=396} [2024-06-03 22:54:22,134 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places. [2024-06-03 22:54:22,135 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 396 transitions, 6189 flow [2024-06-03 22:54:22,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:22,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:54:22,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:54:22,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:54:22,135 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:54:22,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:54:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1795994178, now seen corresponding path program 2 times [2024-06-03 22:54:22,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:54:22,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996341532] [2024-06-03 22:54:22,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:54:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:54:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:54:28,811 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-03 22:54:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:54:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996341532] [2024-06-03 22:54:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996341532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:54:28,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:54:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:54:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560634121] [2024-06-03 22:54:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:54:28,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:54:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:54:28,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:54:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:54:28,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:54:28,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 396 transitions, 6189 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:28,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:54:28,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:54:28,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:54:30,230 INFO L124 PetriNetUnfolderBase]: 2973/4518 cut-off events. [2024-06-03 22:54:30,230 INFO L125 PetriNetUnfolderBase]: For 387365/387377 co-relation queries the response was YES. [2024-06-03 22:54:30,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41686 conditions, 4518 events. 2973/4518 cut-off events. For 387365/387377 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23973 event pairs, 396 based on Foata normal form. 14/4528 useless extension candidates. Maximal degree in co-relation 41566. Up to 4123 conditions per place. [2024-06-03 22:54:30,274 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 376 selfloop transitions, 53 changer transitions 0/433 dead transitions. [2024-06-03 22:54:30,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 433 transitions, 7227 flow [2024-06-03 22:54:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:54:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:54:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-03 22:54:30,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4073170731707317 [2024-06-03 22:54:30,279 INFO L175 Difference]: Start difference. First operand has 249 places, 396 transitions, 6189 flow. Second operand 10 states and 167 transitions. [2024-06-03 22:54:30,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 433 transitions, 7227 flow [2024-06-03 22:54:30,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 433 transitions, 7075 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-03 22:54:30,993 INFO L231 Difference]: Finished difference. Result has 252 places, 399 transitions, 6231 flow [2024-06-03 22:54:30,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6231, PETRI_PLACES=252, PETRI_TRANSITIONS=399} [2024-06-03 22:54:30,993 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-03 22:54:30,993 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 399 transitions, 6231 flow [2024-06-03 22:54:30,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:30,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:54:30,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:54:30,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:54:30,994 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:54:30,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:54:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1518948790, now seen corresponding path program 1 times [2024-06-03 22:54:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:54:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314721977] [2024-06-03 22:54:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:54:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:54:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:54:38,671 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-03 22:54:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:54:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314721977] [2024-06-03 22:54:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314721977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:54:38,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:54:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:54:38,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15220560] [2024-06-03 22:54:38,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:54:38,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:54:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:54:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:54:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:54:38,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:54:38,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 399 transitions, 6231 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:54:38,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:54:38,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:54:38,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:54:40,046 INFO L124 PetriNetUnfolderBase]: 2983/4536 cut-off events. [2024-06-03 22:54:40,046 INFO L125 PetriNetUnfolderBase]: For 395278/395296 co-relation queries the response was YES. [2024-06-03 22:54:40,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42029 conditions, 4536 events. 2983/4536 cut-off events. For 395278/395296 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 24166 event pairs, 513 based on Foata normal form. 14/4537 useless extension candidates. Maximal degree in co-relation 41908. Up to 4261 conditions per place. [2024-06-03 22:54:40,090 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 371 selfloop transitions, 45 changer transitions 0/420 dead transitions. [2024-06-03 22:54:40,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 420 transitions, 7200 flow [2024-06-03 22:54:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:54:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:54:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-03 22:54:40,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-03 22:54:40,091 INFO L175 Difference]: Start difference. First operand has 252 places, 399 transitions, 6231 flow. Second operand 8 states and 130 transitions. [2024-06-03 22:54:40,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 420 transitions, 7200 flow [2024-06-03 22:54:40,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 420 transitions, 7028 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-03 22:54:40,830 INFO L231 Difference]: Finished difference. Result has 252 places, 403 transitions, 6245 flow [2024-06-03 22:54:40,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6059, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6245, PETRI_PLACES=252, PETRI_TRANSITIONS=403} [2024-06-03 22:54:40,830 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-03 22:54:40,830 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 403 transitions, 6245 flow [2024-06-03 22:54:40,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:54:40,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:54:40,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:54:40,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:54:40,830 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:54:40,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:54:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 829862594, now seen corresponding path program 1 times [2024-06-03 22:54:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:54:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738454077] [2024-06-03 22:54:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:54:40,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:54:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:54:47,320 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-03 22:54:47,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:54:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738454077] [2024-06-03 22:54:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738454077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:54:47,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:54:47,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:54:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829442941] [2024-06-03 22:54:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:54:47,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:54:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:54:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:54:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:54:47,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:54:47,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 403 transitions, 6245 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:47,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:54:47,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:54:47,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:54:48,828 INFO L124 PetriNetUnfolderBase]: 2983/4517 cut-off events. [2024-06-03 22:54:48,828 INFO L125 PetriNetUnfolderBase]: For 405490/405500 co-relation queries the response was YES. [2024-06-03 22:54:48,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41886 conditions, 4517 events. 2983/4517 cut-off events. For 405490/405500 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23883 event pairs, 489 based on Foata normal form. 6/4519 useless extension candidates. Maximal degree in co-relation 41764. Up to 3975 conditions per place. [2024-06-03 22:54:48,866 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 343 selfloop transitions, 84 changer transitions 0/431 dead transitions. [2024-06-03 22:54:48,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 431 transitions, 7273 flow [2024-06-03 22:54:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:54:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:54:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 22:54:48,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-03 22:54:48,867 INFO L175 Difference]: Start difference. First operand has 252 places, 403 transitions, 6245 flow. Second operand 8 states and 141 transitions. [2024-06-03 22:54:48,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 431 transitions, 7273 flow [2024-06-03 22:54:49,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 431 transitions, 7144 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 22:54:49,467 INFO L231 Difference]: Finished difference. Result has 255 places, 407 transitions, 6411 flow [2024-06-03 22:54:49,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6116, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6411, PETRI_PLACES=255, PETRI_TRANSITIONS=407} [2024-06-03 22:54:49,468 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 213 predicate places. [2024-06-03 22:54:49,468 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 407 transitions, 6411 flow [2024-06-03 22:54:49,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:49,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:54:49,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:54:49,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:54:49,469 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:54:49,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:54:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1628816820, now seen corresponding path program 2 times [2024-06-03 22:54:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:54:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285466394] [2024-06-03 22:54:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:54:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:54:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:54:56,073 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-03 22:54:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:54:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285466394] [2024-06-03 22:54:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285466394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:54:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:54:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:54:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778868969] [2024-06-03 22:54:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:54:56,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:54:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:54:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:54:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:54:56,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:54:56,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 407 transitions, 6411 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:56,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:54:56,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:54:56,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:54:57,522 INFO L124 PetriNetUnfolderBase]: 2989/4537 cut-off events. [2024-06-03 22:54:57,522 INFO L125 PetriNetUnfolderBase]: For 416966/416976 co-relation queries the response was YES. [2024-06-03 22:54:57,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42490 conditions, 4537 events. 2989/4537 cut-off events. For 416966/416976 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24118 event pairs, 483 based on Foata normal form. 6/4539 useless extension candidates. Maximal degree in co-relation 42366. Up to 3941 conditions per place. [2024-06-03 22:54:57,562 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 340 selfloop transitions, 92 changer transitions 0/436 dead transitions. [2024-06-03 22:54:57,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 436 transitions, 7659 flow [2024-06-03 22:54:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:54:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:54:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-03 22:54:57,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-03 22:54:57,563 INFO L175 Difference]: Start difference. First operand has 255 places, 407 transitions, 6411 flow. Second operand 8 states and 142 transitions. [2024-06-03 22:54:57,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 436 transitions, 7659 flow [2024-06-03 22:54:58,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 436 transitions, 7491 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-03 22:54:58,302 INFO L231 Difference]: Finished difference. Result has 260 places, 413 transitions, 6647 flow [2024-06-03 22:54:58,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6243, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6647, PETRI_PLACES=260, PETRI_TRANSITIONS=413} [2024-06-03 22:54:58,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places. [2024-06-03 22:54:58,303 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 413 transitions, 6647 flow [2024-06-03 22:54:58,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:54:58,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:54:58,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:54:58,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:54:58,303 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:54:58,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:54:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash 510442884, now seen corresponding path program 3 times [2024-06-03 22:54:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:54:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352395492] [2024-06-03 22:54:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:54:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:54:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:55:05,552 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-03 22:55:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:55:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352395492] [2024-06-03 22:55:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352395492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:55:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:55:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:55:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558971641] [2024-06-03 22:55:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:55:05,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:55:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:55:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:55:05,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:55:05,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:55:05,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 413 transitions, 6647 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:55:05,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:55:05,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:55:05,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:55:07,073 INFO L124 PetriNetUnfolderBase]: 3065/4646 cut-off events. [2024-06-03 22:55:07,073 INFO L125 PetriNetUnfolderBase]: For 448499/448509 co-relation queries the response was YES. [2024-06-03 22:55:07,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44415 conditions, 4646 events. 3065/4646 cut-off events. For 448499/448509 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 24703 event pairs, 508 based on Foata normal form. 6/4648 useless extension candidates. Maximal degree in co-relation 44289. Up to 3905 conditions per place. [2024-06-03 22:55:07,112 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 341 selfloop transitions, 103 changer transitions 0/448 dead transitions. [2024-06-03 22:55:07,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 448 transitions, 8178 flow [2024-06-03 22:55:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:55:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:55:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:55:07,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:55:07,113 INFO L175 Difference]: Start difference. First operand has 260 places, 413 transitions, 6647 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:55:07,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 448 transitions, 8178 flow [2024-06-03 22:55:07,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 448 transitions, 7968 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-03 22:55:07,844 INFO L231 Difference]: Finished difference. Result has 264 places, 426 transitions, 7090 flow [2024-06-03 22:55:07,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6437, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7090, PETRI_PLACES=264, PETRI_TRANSITIONS=426} [2024-06-03 22:55:07,845 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-03 22:55:07,845 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 426 transitions, 7090 flow [2024-06-03 22:55:07,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:55:07,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:55:07,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:55:07,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:55:07,845 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:55:07,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:55:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash -455591058, now seen corresponding path program 3 times [2024-06-03 22:55:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:55:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489537615] [2024-06-03 22:55:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:55:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:55:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:55:14,890 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-03 22:55:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:55:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489537615] [2024-06-03 22:55:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489537615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:55:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:55:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:55:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697168259] [2024-06-03 22:55:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:55:14,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:55:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:55:14,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:55:14,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:55:14,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:55:14,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 426 transitions, 7090 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:55:14,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:55:14,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:55:14,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:55:16,380 INFO L124 PetriNetUnfolderBase]: 3094/4689 cut-off events. [2024-06-03 22:55:16,381 INFO L125 PetriNetUnfolderBase]: For 467363/467373 co-relation queries the response was YES. [2024-06-03 22:55:16,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45323 conditions, 4689 events. 3094/4689 cut-off events. For 467363/467373 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24950 event pairs, 410 based on Foata normal form. 9/4694 useless extension candidates. Maximal degree in co-relation 45195. Up to 4208 conditions per place. [2024-06-03 22:55:16,426 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 388 selfloop transitions, 62 changer transitions 0/454 dead transitions. [2024-06-03 22:55:16,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 454 transitions, 8320 flow [2024-06-03 22:55:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:55:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:55:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-03 22:55:16,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-03 22:55:16,428 INFO L175 Difference]: Start difference. First operand has 264 places, 426 transitions, 7090 flow. Second operand 9 states and 148 transitions. [2024-06-03 22:55:16,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 454 transitions, 8320 flow [2024-06-03 22:55:17,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 454 transitions, 8116 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-03 22:55:17,260 INFO L231 Difference]: Finished difference. Result has 268 places, 431 transitions, 7154 flow [2024-06-03 22:55:17,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6886, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7154, PETRI_PLACES=268, PETRI_TRANSITIONS=431} [2024-06-03 22:55:17,260 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places. [2024-06-03 22:55:17,260 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 431 transitions, 7154 flow [2024-06-03 22:55:17,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:55:17,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:55:17,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:55:17,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:55:17,261 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:55:17,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:55:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 56847602, now seen corresponding path program 2 times [2024-06-03 22:55:17,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:55:17,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214752031] [2024-06-03 22:55:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:55:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:55:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:55:25,162 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-03 22:55:25,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:55:25,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214752031] [2024-06-03 22:55:25,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214752031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:55:25,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:55:25,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:55:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492996421] [2024-06-03 22:55:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:55:25,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:55:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:55:25,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:55:25,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:55:25,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:55:25,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 431 transitions, 7154 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:55:25,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:55:25,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:55:25,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:55:26,593 INFO L124 PetriNetUnfolderBase]: 3104/4705 cut-off events. [2024-06-03 22:55:26,593 INFO L125 PetriNetUnfolderBase]: For 474963/474973 co-relation queries the response was YES. [2024-06-03 22:55:26,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45591 conditions, 4705 events. 3104/4705 cut-off events. For 474963/474973 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 25117 event pairs, 534 based on Foata normal form. 7/4697 useless extension candidates. Maximal degree in co-relation 45462. Up to 4188 conditions per place. [2024-06-03 22:55:26,648 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 333 selfloop transitions, 119 changer transitions 0/456 dead transitions. [2024-06-03 22:55:26,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 456 transitions, 8440 flow [2024-06-03 22:55:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:55:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:55:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-03 22:55:26,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-03 22:55:26,649 INFO L175 Difference]: Start difference. First operand has 268 places, 431 transitions, 7154 flow. Second operand 8 states and 132 transitions. [2024-06-03 22:55:26,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 456 transitions, 8440 flow [2024-06-03 22:55:27,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 456 transitions, 8274 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-03 22:55:27,533 INFO L231 Difference]: Finished difference. Result has 271 places, 445 transitions, 7512 flow [2024-06-03 22:55:27,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6988, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7512, PETRI_PLACES=271, PETRI_TRANSITIONS=445} [2024-06-03 22:55:27,533 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 229 predicate places. [2024-06-03 22:55:27,533 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 445 transitions, 7512 flow [2024-06-03 22:55:27,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:55:27,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:55:27,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:55:27,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:55:27,534 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:55:27,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:55:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2062916716, now seen corresponding path program 3 times [2024-06-03 22:55:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:55:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994940784] [2024-06-03 22:55:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:55:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:55:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:55:34,977 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-03 22:55:34,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:55:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994940784] [2024-06-03 22:55:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994940784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:55:34,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:55:34,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:55:34,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644695262] [2024-06-03 22:55:34,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:55:34,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:55:34,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:55:34,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:55:34,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:55:35,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:55:35,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 445 transitions, 7512 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:55:35,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:55:35,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:55:35,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:55:36,403 INFO L124 PetriNetUnfolderBase]: 3114/4721 cut-off events. [2024-06-03 22:55:36,403 INFO L125 PetriNetUnfolderBase]: For 487342/487352 co-relation queries the response was YES. [2024-06-03 22:55:36,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46119 conditions, 4721 events. 3114/4721 cut-off events. For 487342/487352 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25187 event pairs, 537 based on Foata normal form. 7/4713 useless extension candidates. Maximal degree in co-relation 45988. Up to 4273 conditions per place. [2024-06-03 22:55:36,447 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 360 selfloop transitions, 95 changer transitions 0/459 dead transitions. [2024-06-03 22:55:36,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 459 transitions, 8548 flow [2024-06-03 22:55:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:55:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:55:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-03 22:55:36,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-03 22:55:36,448 INFO L175 Difference]: Start difference. First operand has 271 places, 445 transitions, 7512 flow. Second operand 8 states and 129 transitions. [2024-06-03 22:55:36,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 459 transitions, 8548 flow [2024-06-03 22:55:37,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 459 transitions, 8380 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-03 22:55:37,316 INFO L231 Difference]: Finished difference. Result has 275 places, 449 transitions, 7649 flow [2024-06-03 22:55:37,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7344, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7649, PETRI_PLACES=275, PETRI_TRANSITIONS=449} [2024-06-03 22:55:37,317 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places. [2024-06-03 22:55:37,317 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 449 transitions, 7649 flow [2024-06-03 22:55:37,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:55:37,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:55:37,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:55:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:55:37,317 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:55:37,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:55:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2062171868, now seen corresponding path program 4 times [2024-06-03 22:55:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:55:37,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364398657] [2024-06-03 22:55:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:55:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:55:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:55:45,075 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-03 22:55:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:55:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364398657] [2024-06-03 22:55:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364398657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:55:45,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:55:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:55:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702171578] [2024-06-03 22:55:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:55:45,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:55:45,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:55:45,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:55:45,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:55:45,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:55:45,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 449 transitions, 7649 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:55:45,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:55:45,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:55:45,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:55:46,500 INFO L124 PetriNetUnfolderBase]: 3102/4702 cut-off events. [2024-06-03 22:55:46,500 INFO L125 PetriNetUnfolderBase]: For 495260/495270 co-relation queries the response was YES. [2024-06-03 22:55:46,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46230 conditions, 4702 events. 3102/4702 cut-off events. For 495260/495270 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 25074 event pairs, 534 based on Foata normal form. 7/4694 useless extension candidates. Maximal degree in co-relation 46097. Up to 4256 conditions per place. [2024-06-03 22:55:46,546 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 365 selfloop transitions, 90 changer transitions 0/459 dead transitions. [2024-06-03 22:55:46,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 459 transitions, 8585 flow [2024-06-03 22:55:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:55:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:55:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-03 22:55:46,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:55:46,548 INFO L175 Difference]: Start difference. First operand has 275 places, 449 transitions, 7649 flow. Second operand 8 states and 128 transitions. [2024-06-03 22:55:46,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 459 transitions, 8585 flow [2024-06-03 22:55:47,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 459 transitions, 8342 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-03 22:55:47,563 INFO L231 Difference]: Finished difference. Result has 277 places, 449 transitions, 7593 flow [2024-06-03 22:55:47,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7406, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7593, PETRI_PLACES=277, PETRI_TRANSITIONS=449} [2024-06-03 22:55:47,563 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places. [2024-06-03 22:55:47,563 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 449 transitions, 7593 flow [2024-06-03 22:55:47,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:55:47,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:55:47,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:55:47,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:55:47,564 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:55:47,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:55:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1083443376, now seen corresponding path program 4 times [2024-06-03 22:55:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:55:47,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424588684] [2024-06-03 22:55:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:55:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:55:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:55:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:55:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:55:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424588684] [2024-06-03 22:55:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424588684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:55:54,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:55:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:55:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719020163] [2024-06-03 22:55:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:55:54,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:55:54,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:55:54,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:55:54,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:55:54,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:55:54,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 449 transitions, 7593 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-03 22:55:54,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:55:54,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:55:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:55:56,039 INFO L124 PetriNetUnfolderBase]: 3112/4703 cut-off events. [2024-06-03 22:55:56,040 INFO L125 PetriNetUnfolderBase]: For 505302/505306 co-relation queries the response was YES. [2024-06-03 22:55:56,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46523 conditions, 4703 events. 3112/4703 cut-off events. For 505302/505306 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24948 event pairs, 525 based on Foata normal form. 6/4688 useless extension candidates. Maximal degree in co-relation 46389. Up to 4170 conditions per place. [2024-06-03 22:55:56,081 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 379 selfloop transitions, 93 changer transitions 0/476 dead transitions. [2024-06-03 22:55:56,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 476 transitions, 8720 flow [2024-06-03 22:55:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:55:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:55:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-03 22:55:56,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-03 22:55:56,082 INFO L175 Difference]: Start difference. First operand has 277 places, 449 transitions, 7593 flow. Second operand 9 states and 148 transitions. [2024-06-03 22:55:56,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 476 transitions, 8720 flow [2024-06-03 22:55:56,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 476 transitions, 8487 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-03 22:55:56,893 INFO L231 Difference]: Finished difference. Result has 280 places, 453 transitions, 7664 flow [2024-06-03 22:55:56,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7360, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7664, PETRI_PLACES=280, PETRI_TRANSITIONS=453} [2024-06-03 22:55:56,893 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places. [2024-06-03 22:55:56,893 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 453 transitions, 7664 flow [2024-06-03 22:55:56,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-03 22:55:56,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:55:56,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:55:56,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:55:56,893 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:55:56,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:55:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 292724720, now seen corresponding path program 5 times [2024-06-03 22:55:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:55:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432718261] [2024-06-03 22:55:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:55:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:55:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:56:03,505 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-03 22:56:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:56:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432718261] [2024-06-03 22:56:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432718261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:56:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:56:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:56:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93141138] [2024-06-03 22:56:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:56:03,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:56:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:56:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:56:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:56:03,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:56:03,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 453 transitions, 7664 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:03,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:56:03,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:56:03,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:56:05,052 INFO L124 PetriNetUnfolderBase]: 3100/4684 cut-off events. [2024-06-03 22:56:05,053 INFO L125 PetriNetUnfolderBase]: For 513715/513719 co-relation queries the response was YES. [2024-06-03 22:56:05,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46326 conditions, 4684 events. 3100/4684 cut-off events. For 513715/513719 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24939 event pairs, 510 based on Foata normal form. 5/4665 useless extension candidates. Maximal degree in co-relation 46191. Up to 4062 conditions per place. [2024-06-03 22:56:05,097 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 366 selfloop transitions, 105 changer transitions 0/475 dead transitions. [2024-06-03 22:56:05,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 475 transitions, 8852 flow [2024-06-03 22:56:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:56:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:56:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-03 22:56:05,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-03 22:56:05,099 INFO L175 Difference]: Start difference. First operand has 280 places, 453 transitions, 7664 flow. Second operand 8 states and 140 transitions. [2024-06-03 22:56:05,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 475 transitions, 8852 flow [2024-06-03 22:56:06,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 475 transitions, 8624 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-03 22:56:06,120 INFO L231 Difference]: Finished difference. Result has 282 places, 454 transitions, 7688 flow [2024-06-03 22:56:06,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7436, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7688, PETRI_PLACES=282, PETRI_TRANSITIONS=454} [2024-06-03 22:56:06,120 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 240 predicate places. [2024-06-03 22:56:06,121 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 454 transitions, 7688 flow [2024-06-03 22:56:06,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:06,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:56:06,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:56:06,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:56:06,121 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:56:06,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:56:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash 209815496, now seen corresponding path program 6 times [2024-06-03 22:56:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:56:06,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147734201] [2024-06-03 22:56:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:56:06,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:56:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:56:12,372 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-03 22:56:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:56:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147734201] [2024-06-03 22:56:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147734201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:56:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:56:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:56:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408339822] [2024-06-03 22:56:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:56:12,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:56:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:56:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:56:12,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:56:12,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:56:12,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 454 transitions, 7688 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:12,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:56:12,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:56:12,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:56:13,862 INFO L124 PetriNetUnfolderBase]: 3090/4670 cut-off events. [2024-06-03 22:56:13,862 INFO L125 PetriNetUnfolderBase]: For 515236/515240 co-relation queries the response was YES. [2024-06-03 22:56:13,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46210 conditions, 4670 events. 3090/4670 cut-off events. For 515236/515240 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24811 event pairs, 516 based on Foata normal form. 3/4649 useless extension candidates. Maximal degree in co-relation 46074. Up to 4138 conditions per place. [2024-06-03 22:56:13,909 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 387 selfloop transitions, 86 changer transitions 0/477 dead transitions. [2024-06-03 22:56:13,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 477 transitions, 8710 flow [2024-06-03 22:56:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:56:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:56:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:56:13,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:56:13,910 INFO L175 Difference]: Start difference. First operand has 282 places, 454 transitions, 7688 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:56:13,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 477 transitions, 8710 flow [2024-06-03 22:56:14,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 477 transitions, 8440 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-03 22:56:14,935 INFO L231 Difference]: Finished difference. Result has 285 places, 454 transitions, 7597 flow [2024-06-03 22:56:14,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7418, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7597, PETRI_PLACES=285, PETRI_TRANSITIONS=454} [2024-06-03 22:56:14,935 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-03 22:56:14,935 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 454 transitions, 7597 flow [2024-06-03 22:56:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:14,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:56:14,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:56:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:56:14,936 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:56:14,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:56:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1571085436, now seen corresponding path program 7 times [2024-06-03 22:56:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:56:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479943017] [2024-06-03 22:56:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:56:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:56:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:56:21,353 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-03 22:56:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:56:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479943017] [2024-06-03 22:56:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479943017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:56:21,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:56:21,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:56:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587360739] [2024-06-03 22:56:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:56:21,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:56:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:56:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:56:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:56:21,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:56:21,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 454 transitions, 7597 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:21,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:56:21,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:56:21,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:56:22,891 INFO L124 PetriNetUnfolderBase]: 3084/4662 cut-off events. [2024-06-03 22:56:22,891 INFO L125 PetriNetUnfolderBase]: For 522694/522698 co-relation queries the response was YES. [2024-06-03 22:56:22,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45848 conditions, 4662 events. 3084/4662 cut-off events. For 522694/522698 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24847 event pairs, 517 based on Foata normal form. 3/4641 useless extension candidates. Maximal degree in co-relation 45711. Up to 4105 conditions per place. [2024-06-03 22:56:22,939 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 379 selfloop transitions, 95 changer transitions 0/478 dead transitions. [2024-06-03 22:56:22,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 478 transitions, 8831 flow [2024-06-03 22:56:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:56:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:56:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:56:22,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:56:22,941 INFO L175 Difference]: Start difference. First operand has 285 places, 454 transitions, 7597 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:56:22,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 478 transitions, 8831 flow [2024-06-03 22:56:23,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 478 transitions, 8585 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:56:23,880 INFO L231 Difference]: Finished difference. Result has 285 places, 456 transitions, 7635 flow [2024-06-03 22:56:23,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7351, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7635, PETRI_PLACES=285, PETRI_TRANSITIONS=456} [2024-06-03 22:56:23,881 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-03 22:56:23,881 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 456 transitions, 7635 flow [2024-06-03 22:56:23,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:23,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:56:23,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:56:23,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:56:23,881 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:56:23,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:56:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 564435656, now seen corresponding path program 8 times [2024-06-03 22:56:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:56:23,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625118758] [2024-06-03 22:56:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:56:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:56:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:56:30,682 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-03 22:56:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:56:30,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625118758] [2024-06-03 22:56:30,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625118758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:56:30,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:56:30,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:56:30,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058914774] [2024-06-03 22:56:30,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:56:30,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:56:30,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:56:30,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:56:30,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:56:30,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:56:30,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 456 transitions, 7635 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:30,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:56:30,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:56:30,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:56:32,208 INFO L124 PetriNetUnfolderBase]: 3114/4696 cut-off events. [2024-06-03 22:56:32,208 INFO L125 PetriNetUnfolderBase]: For 548249/548253 co-relation queries the response was YES. [2024-06-03 22:56:32,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46389 conditions, 4696 events. 3114/4696 cut-off events. For 548249/548253 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24855 event pairs, 510 based on Foata normal form. 7/4683 useless extension candidates. Maximal degree in co-relation 46252. Up to 3732 conditions per place. [2024-06-03 22:56:32,249 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 320 selfloop transitions, 159 changer transitions 0/483 dead transitions. [2024-06-03 22:56:32,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 483 transitions, 9134 flow [2024-06-03 22:56:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:56:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:56:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 22:56:32,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-03 22:56:32,251 INFO L175 Difference]: Start difference. First operand has 285 places, 456 transitions, 7635 flow. Second operand 8 states and 145 transitions. [2024-06-03 22:56:32,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 483 transitions, 9134 flow [2024-06-03 22:56:33,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 483 transitions, 8914 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-03 22:56:33,089 INFO L231 Difference]: Finished difference. Result has 288 places, 463 transitions, 7923 flow [2024-06-03 22:56:33,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7415, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7923, PETRI_PLACES=288, PETRI_TRANSITIONS=463} [2024-06-03 22:56:33,090 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 246 predicate places. [2024-06-03 22:56:33,090 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 463 transitions, 7923 flow [2024-06-03 22:56:33,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:33,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:56:33,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:56:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:56:33,091 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:56:33,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:56:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1583049886, now seen corresponding path program 9 times [2024-06-03 22:56:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:56:33,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278322195] [2024-06-03 22:56:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:56:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:56:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:56:39,835 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-03 22:56:39,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:56:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278322195] [2024-06-03 22:56:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278322195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:56:39,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:56:39,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:56:39,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523916669] [2024-06-03 22:56:39,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:56:39,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:56:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:56:39,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:56:39,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:56:39,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:56:39,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 463 transitions, 7923 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:39,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:56:39,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:56:39,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:56:41,318 INFO L124 PetriNetUnfolderBase]: 3094/4676 cut-off events. [2024-06-03 22:56:41,318 INFO L125 PetriNetUnfolderBase]: For 544736/544740 co-relation queries the response was YES. [2024-06-03 22:56:41,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46150 conditions, 4676 events. 3094/4676 cut-off events. For 544736/544740 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 24855 event pairs, 498 based on Foata normal form. 7/4659 useless extension candidates. Maximal degree in co-relation 46012. Up to 3721 conditions per place. [2024-06-03 22:56:41,366 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 316 selfloop transitions, 163 changer transitions 0/483 dead transitions. [2024-06-03 22:56:41,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 483 transitions, 9251 flow [2024-06-03 22:56:41,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:56:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:56:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 22:56:41,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:56:41,367 INFO L175 Difference]: Start difference. First operand has 288 places, 463 transitions, 7923 flow. Second operand 8 states and 144 transitions. [2024-06-03 22:56:41,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 483 transitions, 9251 flow [2024-06-03 22:56:42,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 483 transitions, 8822 flow, removed 79 selfloop flow, removed 5 redundant places. [2024-06-03 22:56:42,398 INFO L231 Difference]: Finished difference. Result has 291 places, 463 transitions, 7831 flow [2024-06-03 22:56:42,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7494, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7831, PETRI_PLACES=291, PETRI_TRANSITIONS=463} [2024-06-03 22:56:42,399 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 249 predicate places. [2024-06-03 22:56:42,399 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 463 transitions, 7831 flow [2024-06-03 22:56:42,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:42,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:56:42,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:56:42,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:56:42,399 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:56:42,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:56:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash 729837640, now seen corresponding path program 10 times [2024-06-03 22:56:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:56:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787923596] [2024-06-03 22:56:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:56:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:56:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:56:49,742 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-03 22:56:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:56:49,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787923596] [2024-06-03 22:56:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787923596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:56:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:56:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:56:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587499224] [2024-06-03 22:56:49,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:56:49,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:56:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:56:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:56:49,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:56:49,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:56:49,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 463 transitions, 7831 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:49,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:56:49,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:56:49,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:56:51,233 INFO L124 PetriNetUnfolderBase]: 3200/4845 cut-off events. [2024-06-03 22:56:51,233 INFO L125 PetriNetUnfolderBase]: For 588303/588313 co-relation queries the response was YES. [2024-06-03 22:56:51,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48110 conditions, 4845 events. 3200/4845 cut-off events. For 588303/588313 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25935 event pairs, 589 based on Foata normal form. 8/4835 useless extension candidates. Maximal degree in co-relation 47971. Up to 2893 conditions per place. [2024-06-03 22:56:51,279 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 253 selfloop transitions, 243 changer transitions 0/500 dead transitions. [2024-06-03 22:56:51,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 500 transitions, 9764 flow [2024-06-03 22:56:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:56:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:56:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 22:56:51,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-03 22:56:51,280 INFO L175 Difference]: Start difference. First operand has 291 places, 463 transitions, 7831 flow. Second operand 8 states and 145 transitions. [2024-06-03 22:56:51,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 500 transitions, 9764 flow [2024-06-03 22:56:52,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 500 transitions, 9234 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-03 22:56:52,262 INFO L231 Difference]: Finished difference. Result has 290 places, 480 transitions, 8216 flow [2024-06-03 22:56:52,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7301, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8216, PETRI_PLACES=290, PETRI_TRANSITIONS=480} [2024-06-03 22:56:52,262 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places. [2024-06-03 22:56:52,262 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 480 transitions, 8216 flow [2024-06-03 22:56:52,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:52,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:56:52,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:56:52,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:56:52,263 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:56:52,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:56:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash -699253884, now seen corresponding path program 11 times [2024-06-03 22:56:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:56:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509432571] [2024-06-03 22:56:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:56:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:56:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:56:59,284 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-03 22:56:59,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:56:59,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509432571] [2024-06-03 22:56:59,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509432571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:56:59,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:56:59,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:56:59,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374477326] [2024-06-03 22:56:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:56:59,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:56:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:56:59,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:56:59,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:56:59,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:56:59,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 480 transitions, 8216 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:56:59,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:56:59,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:56:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:57:00,728 INFO L124 PetriNetUnfolderBase]: 3182/4813 cut-off events. [2024-06-03 22:57:00,728 INFO L125 PetriNetUnfolderBase]: For 585230/585240 co-relation queries the response was YES. [2024-06-03 22:57:00,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47848 conditions, 4813 events. 3182/4813 cut-off events. For 585230/585240 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25718 event pairs, 560 based on Foata normal form. 8/4803 useless extension candidates. Maximal degree in co-relation 47709. Up to 2888 conditions per place. [2024-06-03 22:57:00,779 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 249 selfloop transitions, 247 changer transitions 0/500 dead transitions. [2024-06-03 22:57:00,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 500 transitions, 9773 flow [2024-06-03 22:57:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:57:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:57:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:57:00,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:57:00,780 INFO L175 Difference]: Start difference. First operand has 290 places, 480 transitions, 8216 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:57:00,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 500 transitions, 9773 flow [2024-06-03 22:57:01,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 500 transitions, 9328 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-03 22:57:01,853 INFO L231 Difference]: Finished difference. Result has 294 places, 481 transitions, 8295 flow [2024-06-03 22:57:01,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7771, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8295, PETRI_PLACES=294, PETRI_TRANSITIONS=481} [2024-06-03 22:57:01,854 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2024-06-03 22:57:01,854 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 481 transitions, 8295 flow [2024-06-03 22:57:01,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:57:01,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:57:01,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:57:01,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:57:01,854 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:57:01,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:57:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1173951470, now seen corresponding path program 12 times [2024-06-03 22:57:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:57:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51067112] [2024-06-03 22:57:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:57:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:57:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:57:09,130 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-03 22:57:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:57:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51067112] [2024-06-03 22:57:09,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51067112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:57:09,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:57:09,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:57:09,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700446715] [2024-06-03 22:57:09,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:57:09,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:57:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:57:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:57:09,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:57:09,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:57:09,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 481 transitions, 8295 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:57:09,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:57:09,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:57:09,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:57:10,548 INFO L124 PetriNetUnfolderBase]: 3138/4753 cut-off events. [2024-06-03 22:57:10,548 INFO L125 PetriNetUnfolderBase]: For 578829/578839 co-relation queries the response was YES. [2024-06-03 22:57:10,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46548 conditions, 4753 events. 3138/4753 cut-off events. For 578829/578839 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25388 event pairs, 555 based on Foata normal form. 14/4749 useless extension candidates. Maximal degree in co-relation 46408. Up to 2868 conditions per place. [2024-06-03 22:57:10,597 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 261 selfloop transitions, 235 changer transitions 0/500 dead transitions. [2024-06-03 22:57:10,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 500 transitions, 9843 flow [2024-06-03 22:57:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:57:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:57:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-03 22:57:10,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-03 22:57:10,598 INFO L175 Difference]: Start difference. First operand has 294 places, 481 transitions, 8295 flow. Second operand 8 states and 147 transitions. [2024-06-03 22:57:10,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 500 transitions, 9843 flow [2024-06-03 22:57:11,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 500 transitions, 9264 flow, removed 77 selfloop flow, removed 5 redundant places. [2024-06-03 22:57:11,743 INFO L231 Difference]: Finished difference. Result has 297 places, 481 transitions, 8199 flow [2024-06-03 22:57:11,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7716, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8199, PETRI_PLACES=297, PETRI_TRANSITIONS=481} [2024-06-03 22:57:11,744 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places. [2024-06-03 22:57:11,744 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 481 transitions, 8199 flow [2024-06-03 22:57:11,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:57:11,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:57:11,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:57:11,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:57:11,744 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:57:11,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:57:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1344777032, now seen corresponding path program 4 times [2024-06-03 22:57:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:57:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14580078] [2024-06-03 22:57:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:57:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:57:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:57:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:57:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:57:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14580078] [2024-06-03 22:57:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14580078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:57:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:57:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:57:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425514686] [2024-06-03 22:57:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:57:18,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:57:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:57:18,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:57:18,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:57:19,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:57:19,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 481 transitions, 8199 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:57:19,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:57:19,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:57:19,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:57:20,477 INFO L124 PetriNetUnfolderBase]: 3170/4800 cut-off events. [2024-06-03 22:57:20,477 INFO L125 PetriNetUnfolderBase]: For 575356/575366 co-relation queries the response was YES. [2024-06-03 22:57:20,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46694 conditions, 4800 events. 3170/4800 cut-off events. For 575356/575366 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 25566 event pairs, 414 based on Foata normal form. 13/4798 useless extension candidates. Maximal degree in co-relation 46553. Up to 4053 conditions per place. [2024-06-03 22:57:20,521 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 414 selfloop transitions, 93 changer transitions 0/511 dead transitions. [2024-06-03 22:57:20,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 511 transitions, 9825 flow [2024-06-03 22:57:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:57:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:57:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-03 22:57:20,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-03 22:57:20,523 INFO L175 Difference]: Start difference. First operand has 297 places, 481 transitions, 8199 flow. Second operand 9 states and 151 transitions. [2024-06-03 22:57:20,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 511 transitions, 9825 flow [2024-06-03 22:57:21,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 511 transitions, 8862 flow, removed 22 selfloop flow, removed 12 redundant places. [2024-06-03 22:57:21,555 INFO L231 Difference]: Finished difference. Result has 294 places, 490 transitions, 7641 flow [2024-06-03 22:57:21,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7236, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7641, PETRI_PLACES=294, PETRI_TRANSITIONS=490} [2024-06-03 22:57:21,556 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2024-06-03 22:57:21,556 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 490 transitions, 7641 flow [2024-06-03 22:57:21,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-03 22:57:21,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:57:21,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:57:21,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 22:57:21,556 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:57:21,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:57:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -931100756, now seen corresponding path program 1 times [2024-06-03 22:57:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:57:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929367443] [2024-06-03 22:57:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:57:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:57:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:57:29,095 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-03 22:57:29,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:57:29,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929367443] [2024-06-03 22:57:29,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929367443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:57:29,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:57:29,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:57:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566291933] [2024-06-03 22:57:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:57:29,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:57:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:57:29,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:57:29,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:57:29,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:57:29,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 490 transitions, 7641 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:57:29,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:57:29,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:57:29,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:57:30,641 INFO L124 PetriNetUnfolderBase]: 3186/4825 cut-off events. [2024-06-03 22:57:30,641 INFO L125 PetriNetUnfolderBase]: For 569169/569181 co-relation queries the response was YES. [2024-06-03 22:57:30,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45960 conditions, 4825 events. 3186/4825 cut-off events. For 569169/569181 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 25774 event pairs, 500 based on Foata normal form. 12/4831 useless extension candidates. Maximal degree in co-relation 45821. Up to 4622 conditions per place. [2024-06-03 22:57:30,683 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 473 selfloop transitions, 35 changer transitions 0/512 dead transitions. [2024-06-03 22:57:30,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 512 transitions, 9061 flow [2024-06-03 22:57:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:57:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:57:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-03 22:57:30,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-03 22:57:30,685 INFO L175 Difference]: Start difference. First operand has 294 places, 490 transitions, 7641 flow. Second operand 8 states and 125 transitions. [2024-06-03 22:57:30,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 512 transitions, 9061 flow [2024-06-03 22:57:31,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 512 transitions, 8900 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-03 22:57:31,682 INFO L231 Difference]: Finished difference. Result has 299 places, 496 transitions, 7760 flow [2024-06-03 22:57:31,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7480, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7760, PETRI_PLACES=299, PETRI_TRANSITIONS=496} [2024-06-03 22:57:31,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2024-06-03 22:57:31,682 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 496 transitions, 7760 flow [2024-06-03 22:57:31,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:57:31,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:57:31,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:57:31,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 22:57:31,683 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:57:31,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:57:31,683 INFO L85 PathProgramCache]: Analyzing trace with hash -944922850, now seen corresponding path program 5 times [2024-06-03 22:57:31,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:57:31,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670389676] [2024-06-03 22:57:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:57:31,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:57:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:57:38,698 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-03 22:57:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:57:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670389676] [2024-06-03 22:57:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670389676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:57:38,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:57:38,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:57:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785373449] [2024-06-03 22:57:38,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:57:38,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:57:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:57:38,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:57:38,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:57:38,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:57:38,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 496 transitions, 7760 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:57:38,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:57:38,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:57:38,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:57:40,173 INFO L124 PetriNetUnfolderBase]: 3210/4867 cut-off events. [2024-06-03 22:57:40,173 INFO L125 PetriNetUnfolderBase]: For 593636/593646 co-relation queries the response was YES. [2024-06-03 22:57:40,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46241 conditions, 4867 events. 3210/4867 cut-off events. For 593636/593646 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 26195 event pairs, 551 based on Foata normal form. 6/4855 useless extension candidates. Maximal degree in co-relation 46099. Up to 3520 conditions per place. [2024-06-03 22:57:40,224 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 322 selfloop transitions, 193 changer transitions 0/519 dead transitions. [2024-06-03 22:57:40,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 519 transitions, 9458 flow [2024-06-03 22:57:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:57:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:57:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 22:57:40,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-03 22:57:40,225 INFO L175 Difference]: Start difference. First operand has 299 places, 496 transitions, 7760 flow. Second operand 8 states and 143 transitions. [2024-06-03 22:57:40,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 519 transitions, 9458 flow [2024-06-03 22:57:41,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 519 transitions, 9304 flow, removed 64 selfloop flow, removed 4 redundant places. [2024-06-03 22:57:41,358 INFO L231 Difference]: Finished difference. Result has 303 places, 501 transitions, 8123 flow [2024-06-03 22:57:41,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7606, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8123, PETRI_PLACES=303, PETRI_TRANSITIONS=501} [2024-06-03 22:57:41,358 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 261 predicate places. [2024-06-03 22:57:41,359 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 501 transitions, 8123 flow [2024-06-03 22:57:41,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:57:41,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:57:41,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:57:41,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 22:57:41,359 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:57:41,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:57:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash -476878980, now seen corresponding path program 2 times [2024-06-03 22:57:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:57:41,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589585030] [2024-06-03 22:57:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:57:41,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:57:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:57:48,851 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-03 22:57:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:57:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589585030] [2024-06-03 22:57:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589585030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:57:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:57:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:57:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375055282] [2024-06-03 22:57:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:57:48,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:57:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:57:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:57:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:57:48,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:57:48,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 501 transitions, 8123 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:57:48,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:57:48,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:57:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:57:50,298 INFO L124 PetriNetUnfolderBase]: 3205/4859 cut-off events. [2024-06-03 22:57:50,298 INFO L125 PetriNetUnfolderBase]: For 591654/591666 co-relation queries the response was YES. [2024-06-03 22:57:50,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46878 conditions, 4859 events. 3205/4859 cut-off events. For 591654/591666 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 26045 event pairs, 503 based on Foata normal form. 10/4863 useless extension candidates. Maximal degree in co-relation 46735. Up to 4687 conditions per place. [2024-06-03 22:57:50,347 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 484 selfloop transitions, 26 changer transitions 0/514 dead transitions. [2024-06-03 22:57:50,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 514 transitions, 9185 flow [2024-06-03 22:57:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:57:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:57:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-03 22:57:50,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36890243902439024 [2024-06-03 22:57:50,349 INFO L175 Difference]: Start difference. First operand has 303 places, 501 transitions, 8123 flow. Second operand 8 states and 121 transitions. [2024-06-03 22:57:50,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 514 transitions, 9185 flow [2024-06-03 22:57:51,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 514 transitions, 8627 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-03 22:57:51,621 INFO L231 Difference]: Finished difference. Result has 306 places, 501 transitions, 7622 flow [2024-06-03 22:57:51,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7565, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7622, PETRI_PLACES=306, PETRI_TRANSITIONS=501} [2024-06-03 22:57:51,621 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places. [2024-06-03 22:57:51,621 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 501 transitions, 7622 flow [2024-06-03 22:57:51,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:57:51,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:57:51,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:57:51,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 22:57:51,622 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:57:51,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:57:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash -931101190, now seen corresponding path program 6 times [2024-06-03 22:57:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:57:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356552555] [2024-06-03 22:57:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:57:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:57:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:57:58,587 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-03 22:57:58,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:57:58,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356552555] [2024-06-03 22:57:58,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356552555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:57:58,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:57:58,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:57:58,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512356498] [2024-06-03 22:57:58,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:57:58,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:57:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:57:58,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:57:58,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:57:58,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:57:58,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 501 transitions, 7622 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:57:58,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:57:58,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:57:58,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:58:00,138 INFO L124 PetriNetUnfolderBase]: 3311/5016 cut-off events. [2024-06-03 22:58:00,138 INFO L125 PetriNetUnfolderBase]: For 645304/645314 co-relation queries the response was YES. [2024-06-03 22:58:00,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48106 conditions, 5016 events. 3311/5016 cut-off events. For 645304/645314 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 27032 event pairs, 558 based on Foata normal form. 6/5004 useless extension candidates. Maximal degree in co-relation 47962. Up to 3221 conditions per place. [2024-06-03 22:58:00,183 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 308 selfloop transitions, 228 changer transitions 0/540 dead transitions. [2024-06-03 22:58:00,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 540 transitions, 9709 flow [2024-06-03 22:58:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:58:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:58:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 22:58:00,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-03 22:58:00,184 INFO L175 Difference]: Start difference. First operand has 306 places, 501 transitions, 7622 flow. Second operand 8 states and 143 transitions. [2024-06-03 22:58:00,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 540 transitions, 9709 flow [2024-06-03 22:58:01,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 540 transitions, 9630 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 22:58:01,469 INFO L231 Difference]: Finished difference. Result has 308 places, 522 transitions, 8496 flow [2024-06-03 22:58:01,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7543, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8496, PETRI_PLACES=308, PETRI_TRANSITIONS=522} [2024-06-03 22:58:01,469 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 266 predicate places. [2024-06-03 22:58:01,469 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 522 transitions, 8496 flow [2024-06-03 22:58:01,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:58:01,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:58:01,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:58:01,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 22:58:01,469 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:58:01,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:58:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1258618890, now seen corresponding path program 7 times [2024-06-03 22:58:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:58:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734955335] [2024-06-03 22:58:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:58:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:58:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:58:09,198 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-03 22:58:09,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:58:09,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734955335] [2024-06-03 22:58:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734955335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:58:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:58:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:58:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258680523] [2024-06-03 22:58:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:58:09,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:58:09,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:58:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:58:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:58:09,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:58:09,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 522 transitions, 8496 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:58:09,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:58:09,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:58:09,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:58:10,790 INFO L124 PetriNetUnfolderBase]: 3307/5011 cut-off events. [2024-06-03 22:58:10,790 INFO L125 PetriNetUnfolderBase]: For 650847/650857 co-relation queries the response was YES. [2024-06-03 22:58:10,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49248 conditions, 5011 events. 3307/5011 cut-off events. For 650847/650857 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 26978 event pairs, 520 based on Foata normal form. 7/5003 useless extension candidates. Maximal degree in co-relation 49102. Up to 4513 conditions per place. [2024-06-03 22:58:10,837 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 436 selfloop transitions, 105 changer transitions 0/545 dead transitions. [2024-06-03 22:58:10,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 545 transitions, 10002 flow [2024-06-03 22:58:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:58:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:58:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-03 22:58:10,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-03 22:58:10,838 INFO L175 Difference]: Start difference. First operand has 308 places, 522 transitions, 8496 flow. Second operand 9 states and 145 transitions. [2024-06-03 22:58:10,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 545 transitions, 10002 flow [2024-06-03 22:58:12,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 545 transitions, 9676 flow, removed 75 selfloop flow, removed 3 redundant places. [2024-06-03 22:58:12,332 INFO L231 Difference]: Finished difference. Result has 315 places, 533 transitions, 8655 flow [2024-06-03 22:58:12,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8178, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8655, PETRI_PLACES=315, PETRI_TRANSITIONS=533} [2024-06-03 22:58:12,332 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 273 predicate places. [2024-06-03 22:58:12,332 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 533 transitions, 8655 flow [2024-06-03 22:58:12,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03 22:58:12,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:58:12,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:58:12,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 22:58:12,333 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:58:12,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:58:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1092023184, now seen corresponding path program 1 times [2024-06-03 22:58:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:58:12,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114534336] [2024-06-03 22:58:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:58:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:58:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:58:20,152 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-03 22:58:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:58:20,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114534336] [2024-06-03 22:58:20,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114534336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:58:20,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:58:20,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:58:20,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141129986] [2024-06-03 22:58:20,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:58:20,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:58:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:58:20,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:58:20,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:58:20,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:58:20,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 533 transitions, 8655 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 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-03 22:58:20,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:58:20,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:58:20,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:58:21,812 INFO L124 PetriNetUnfolderBase]: 3315/5022 cut-off events. [2024-06-03 22:58:21,812 INFO L125 PetriNetUnfolderBase]: For 663610/663614 co-relation queries the response was YES. [2024-06-03 22:58:21,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49626 conditions, 5022 events. 3315/5022 cut-off events. For 663610/663614 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 27025 event pairs, 494 based on Foata normal form. 3/5022 useless extension candidates. Maximal degree in co-relation 49477. Up to 4839 conditions per place. [2024-06-03 22:58:21,865 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 533 selfloop transitions, 19 changer transitions 0/556 dead transitions. [2024-06-03 22:58:21,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 556 transitions, 9887 flow [2024-06-03 22:58:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:58:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:58:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-03 22:58:21,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685636856368564 [2024-06-03 22:58:21,866 INFO L175 Difference]: Start difference. First operand has 315 places, 533 transitions, 8655 flow. Second operand 9 states and 136 transitions. [2024-06-03 22:58:21,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 556 transitions, 9887 flow [2024-06-03 22:58:23,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 556 transitions, 9624 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-03 22:58:23,081 INFO L231 Difference]: Finished difference. Result has 318 places, 535 transitions, 8507 flow [2024-06-03 22:58:23,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8392, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8507, PETRI_PLACES=318, PETRI_TRANSITIONS=535} [2024-06-03 22:58:23,082 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places. [2024-06-03 22:58:23,082 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 535 transitions, 8507 flow [2024-06-03 22:58:23,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 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-03 22:58:23,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:58:23,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:58:23,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 22:58:23,083 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:58:23,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:58:23,083 INFO L85 PathProgramCache]: Analyzing trace with hash 289937262, now seen corresponding path program 1 times [2024-06-03 22:58:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:58:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935511222] [2024-06-03 22:58:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:58:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:58:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:58:30,088 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-03 22:58:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:58:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935511222] [2024-06-03 22:58:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935511222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:58:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:58:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:58:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192590862] [2024-06-03 22:58:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:58:30,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:58:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:58:30,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:58:30,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:58:30,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:58:30,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 535 transitions, 8507 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:58:30,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:58:30,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:58:30,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:58:31,723 INFO L124 PetriNetUnfolderBase]: 3308/4998 cut-off events. [2024-06-03 22:58:31,723 INFO L125 PetriNetUnfolderBase]: For 667965/667969 co-relation queries the response was YES. [2024-06-03 22:58:31,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49100 conditions, 4998 events. 3308/4998 cut-off events. For 667965/667969 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 26829 event pairs, 485 based on Foata normal form. 4/4980 useless extension candidates. Maximal degree in co-relation 48950. Up to 4316 conditions per place. [2024-06-03 22:58:31,770 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 430 selfloop transitions, 122 changer transitions 0/556 dead transitions. [2024-06-03 22:58:31,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 556 transitions, 9855 flow [2024-06-03 22:58:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:58:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:58:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 22:58:31,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-03 22:58:31,772 INFO L175 Difference]: Start difference. First operand has 318 places, 535 transitions, 8507 flow. Second operand 8 states and 141 transitions. [2024-06-03 22:58:31,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 556 transitions, 9855 flow [2024-06-03 22:58:33,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 556 transitions, 9696 flow, removed 62 selfloop flow, removed 7 redundant places. [2024-06-03 22:58:33,239 INFO L231 Difference]: Finished difference. Result has 319 places, 535 transitions, 8613 flow [2024-06-03 22:58:33,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8348, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8613, PETRI_PLACES=319, PETRI_TRANSITIONS=535} [2024-06-03 22:58:33,239 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 277 predicate places. [2024-06-03 22:58:33,239 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 535 transitions, 8613 flow [2024-06-03 22:58:33,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:58:33,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:58:33,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:58:33,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 22:58:33,240 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:58:33,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:58:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash 289937138, now seen corresponding path program 2 times [2024-06-03 22:58:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:58:33,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157076445] [2024-06-03 22:58:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:58:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:58:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:58:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:58:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:58:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157076445] [2024-06-03 22:58:40,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157076445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:58:40,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:58:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:58:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843952242] [2024-06-03 22:58:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:58:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:58:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:58:40,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:58:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:58:40,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:58:40,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 535 transitions, 8613 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:58:40,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:58:40,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:58:40,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:58:42,214 INFO L124 PetriNetUnfolderBase]: 3316/5033 cut-off events. [2024-06-03 22:58:42,214 INFO L125 PetriNetUnfolderBase]: For 682946/682950 co-relation queries the response was YES. [2024-06-03 22:58:42,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49773 conditions, 5033 events. 3316/5033 cut-off events. For 682946/682950 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27207 event pairs, 475 based on Foata normal form. 3/5033 useless extension candidates. Maximal degree in co-relation 49622. Up to 4825 conditions per place. [2024-06-03 22:58:42,260 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 531 selfloop transitions, 26 changer transitions 0/561 dead transitions. [2024-06-03 22:58:42,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 561 transitions, 9867 flow [2024-06-03 22:58:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:58:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:58:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-03 22:58:42,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-03 22:58:42,261 INFO L175 Difference]: Start difference. First operand has 319 places, 535 transitions, 8613 flow. Second operand 9 states and 141 transitions. [2024-06-03 22:58:42,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 561 transitions, 9867 flow [2024-06-03 22:58:43,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 561 transitions, 9531 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-03 22:58:43,658 INFO L231 Difference]: Finished difference. Result has 320 places, 537 transitions, 8411 flow [2024-06-03 22:58:43,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8277, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8411, PETRI_PLACES=320, PETRI_TRANSITIONS=537} [2024-06-03 22:58:43,659 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places. [2024-06-03 22:58:43,659 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 537 transitions, 8411 flow [2024-06-03 22:58:43,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:58:43,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:58:43,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:58:43,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 22:58:43,659 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:58:43,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:58:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1583295964, now seen corresponding path program 3 times [2024-06-03 22:58:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:58:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866891449] [2024-06-03 22:58:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:58:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:58:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:58:51,095 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-03 22:58:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:58:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866891449] [2024-06-03 22:58:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866891449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:58:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:58:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:58:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759123007] [2024-06-03 22:58:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:58:51,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:58:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:58:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:58:51,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:58:51,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:58:51,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 537 transitions, 8411 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:58:51,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:58:51,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:58:51,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:58:52,756 INFO L124 PetriNetUnfolderBase]: 3324/5041 cut-off events. [2024-06-03 22:58:52,756 INFO L125 PetriNetUnfolderBase]: For 696926/696930 co-relation queries the response was YES. [2024-06-03 22:58:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49479 conditions, 5041 events. 3324/5041 cut-off events. For 696926/696930 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 27226 event pairs, 498 based on Foata normal form. 3/5041 useless extension candidates. Maximal degree in co-relation 49329. Up to 4822 conditions per place. [2024-06-03 22:58:52,801 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 526 selfloop transitions, 31 changer transitions 0/561 dead transitions. [2024-06-03 22:58:52,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 561 transitions, 9663 flow [2024-06-03 22:58:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:58:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:58:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-03 22:58:52,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-03 22:58:52,803 INFO L175 Difference]: Start difference. First operand has 320 places, 537 transitions, 8411 flow. Second operand 9 states and 141 transitions. [2024-06-03 22:58:52,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 561 transitions, 9663 flow [2024-06-03 22:58:53,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 561 transitions, 9547 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-03 22:58:53,980 INFO L231 Difference]: Finished difference. Result has 322 places, 539 transitions, 8442 flow [2024-06-03 22:58:53,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8295, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8442, PETRI_PLACES=322, PETRI_TRANSITIONS=539} [2024-06-03 22:58:53,981 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 280 predicate places. [2024-06-03 22:58:53,981 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 539 transitions, 8442 flow [2024-06-03 22:58:53,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:58:53,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:58:53,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:58:53,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 22:58:53,981 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:58:53,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:58:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash 564629282, now seen corresponding path program 1 times [2024-06-03 22:58:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:58:53,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670341959] [2024-06-03 22:58:53,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:58:53,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:58:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:59:01,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-03 22:59:01,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:59:01,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670341959] [2024-06-03 22:59:01,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670341959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:59:01,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:59:01,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:59:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109698890] [2024-06-03 22:59:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:59:01,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:59:01,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:59:01,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:59:01,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:59:01,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:59:01,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 539 transitions, 8442 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:59:01,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:59:01,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:59:01,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:59:03,051 INFO L124 PetriNetUnfolderBase]: 3869/5893 cut-off events. [2024-06-03 22:59:03,051 INFO L125 PetriNetUnfolderBase]: For 1192660/1192664 co-relation queries the response was YES. [2024-06-03 22:59:03,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58709 conditions, 5893 events. 3869/5893 cut-off events. For 1192660/1192664 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 32750 event pairs, 326 based on Foata normal form. 83/5954 useless extension candidates. Maximal degree in co-relation 58558. Up to 3032 conditions per place. [2024-06-03 22:59:03,116 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 427 selfloop transitions, 180 changer transitions 0/611 dead transitions. [2024-06-03 22:59:03,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 611 transitions, 10830 flow [2024-06-03 22:59:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:59:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:59:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-03 22:59:03,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458980044345898 [2024-06-03 22:59:03,117 INFO L175 Difference]: Start difference. First operand has 322 places, 539 transitions, 8442 flow. Second operand 11 states and 207 transitions. [2024-06-03 22:59:03,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 611 transitions, 10830 flow [2024-06-03 22:59:04,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 611 transitions, 10699 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-03 22:59:04,753 INFO L231 Difference]: Finished difference. Result has 329 places, 556 transitions, 9311 flow [2024-06-03 22:59:04,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8311, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9311, PETRI_PLACES=329, PETRI_TRANSITIONS=556} [2024-06-03 22:59:04,753 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 287 predicate places. [2024-06-03 22:59:04,753 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 556 transitions, 9311 flow [2024-06-03 22:59:04,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-03 22:59:04,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:59:04,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:59:04,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 22:59:04,754 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:59:04,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:59:04,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1167091604, now seen corresponding path program 2 times [2024-06-03 22:59:04,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:59:04,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278502273] [2024-06-03 22:59:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:59:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:59:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15