./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe004_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/safe004_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/safe004_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_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:29:15,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:29:15,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:29:15,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:29:15,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:29:15,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:29:15,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:29:15,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:29:15,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:29:15,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:29:15,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:29:15,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:29:15,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:29:15,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:29:15,720 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:29:15,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:29:15,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:29:15,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:29:15,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:29:15,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:29:15,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:29:15,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:29:15,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:29:15,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:29:15,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:29:15,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:29:15,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:29:15,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:29:15,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:29:15,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:29:15,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:29:15,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:29:15,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:29:15,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:29:15,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:29:15,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:29:15,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:29:15,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:29:15,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:29:15,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:29:15,728 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:29:15,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:29:15,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:29:15,728 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:29:15,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:29:15,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:29:15,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:29:15,958 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:29:15,959 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:29:15,960 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/safe004_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-03 22:29:16,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:29:16,105 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:29:16,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:29:17,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:29:17,289 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:29:17,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:29:17,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29e4e997/9489244615334c1f8cc8868fe55a4eed/FLAG58d2c2978 [2024-06-03 22:29:17,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29e4e997/9489244615334c1f8cc8868fe55a4eed [2024-06-03 22:29:17,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:29:17,316 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:29:17,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:29:17,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:29:17,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:29:17,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:29:16" (1/2) ... [2024-06-03 22:29:17,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2866e0a1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:29:17, skipping insertion in model container [2024-06-03 22:29:17,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:29:16" (1/2) ... [2024-06-03 22:29:17,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54af524b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:29:17, skipping insertion in model container [2024-06-03 22:29:17,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:29:17" (2/2) ... [2024-06-03 22:29:17,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2866e0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:17, skipping insertion in model container [2024-06-03 22:29:17,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:29:17" (2/2) ... [2024-06-03 22:29:17,326 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:29:17,397 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:29:17,398 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) [2024-06-03 22:29:17,399 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) [2024-06-03 22:29:17,400 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) [2024-06-03 22:29:17,400 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:29:17,400 INFO L106 edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1; [2024-06-03 22:29:17,441 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:29:17,774 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:29:17,783 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:29:18,156 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:29:18,190 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:29:18,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18 WrapperNode [2024-06-03 22:29:18,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:29:18,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:29:18,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:29:18,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:29:18,198 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:29:18" (1/1) ... [2024-06-03 22:29:18,243 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:29:18" (1/1) ... [2024-06-03 22:29:18,349 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2024-06-03 22:29:18,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:29:18,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:29:18,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:29:18,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:29:18,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,418 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:29:18,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:29:18,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:29:18,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:29:18,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:29:18,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (1/1) ... [2024-06-03 22:29:18,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:29:18,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:29:18,506 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:29:18,525 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:29:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:29:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:29:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:29:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:29:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:29:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:29:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 22:29:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 22:29:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:29:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:29:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:29:18,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:29:18,538 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:29:18,673 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:29:18,676 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:29:19,674 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:29:19,674 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:29:19,894 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:29:19,894 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:29:19,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:29:19 BoogieIcfgContainer [2024-06-03 22:29:19,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:29:19,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:29:19,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:29:19,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:29:19,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:29:16" (1/4) ... [2024-06-03 22:29:19,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6d2e4f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:29:19, skipping insertion in model container [2024-06-03 22:29:19,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:29:17" (2/4) ... [2024-06-03 22:29:19,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6d2e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:29:19, skipping insertion in model container [2024-06-03 22:29:19,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:29:18" (3/4) ... [2024-06-03 22:29:19,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6d2e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:29:19, skipping insertion in model container [2024-06-03 22:29:19,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:29:19" (4/4) ... [2024-06-03 22:29:19,903 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:29:19,916 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:29:19,916 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 22:29:19,916 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:29:20,013 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:29:20,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:29:20,084 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 22:29:20,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:29:20,087 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 63 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:29:20,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:29:20,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 22:29:20,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:29:20,109 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;@26aef108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:29:20,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 22:29:20,116 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:29:20,116 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:29:20,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:29:20,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:20,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:29:20,118 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:29:20,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1456369184, now seen corresponding path program 1 times [2024-06-03 22:29:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120474807] [2024-06-03 22:29:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:24,154 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:29:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:24,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120474807] [2024-06-03 22:29:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120474807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:24,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:24,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:29:24,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337962023] [2024-06-03 22:29:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:24,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:29:24,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:29:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:29:24,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:29:24,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:29:24,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:24,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:29:24,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:24,996 INFO L124 PetriNetUnfolderBase]: 1152/1756 cut-off events. [2024-06-03 22:29:24,996 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-03 22:29:25,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 1756 events. 1152/1756 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8194 event pairs, 693 based on Foata normal form. 2/1710 useless extension candidates. Maximal degree in co-relation 3583. Up to 1738 conditions per place. [2024-06-03 22:29:25,009 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-03 22:29:25,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 177 flow [2024-06-03 22:29:25,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:29:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:29:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-03 22:29:25,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2024-06-03 22:29:25,020 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 71 transitions. [2024-06-03 22:29:25,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 177 flow [2024-06-03 22:29:25,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 22:29:25,023 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-03 22:29:25,025 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:29:25,027 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-03 22:29:25,028 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-03 22:29:25,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:29:25,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:25,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:25,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:29:25,029 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:29:25,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash 588573823, now seen corresponding path program 1 times [2024-06-03 22:29:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:25,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629608634] [2024-06-03 22:29:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629608634] [2024-06-03 22:29:27,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629608634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:27,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:29:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918248441] [2024-06-03 22:29:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:27,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:29:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:29:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:29:28,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:29:28,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:29:28,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:28,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:29:28,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:28,825 INFO L124 PetriNetUnfolderBase]: 1644/2457 cut-off events. [2024-06-03 22:29:28,825 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2024-06-03 22:29:28,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 2457 events. 1644/2457 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11113 event pairs, 1035 based on Foata normal form. 3/2458 useless extension candidates. Maximal degree in co-relation 5625. Up to 2429 conditions per place. [2024-06-03 22:29:28,839 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-03 22:29:28,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 260 flow [2024-06-03 22:29:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:29:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:29:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-06-03 22:29:28,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-03 22:29:28,842 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 84 transitions. [2024-06-03 22:29:28,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 260 flow [2024-06-03 22:29:28,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:29:28,845 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 152 flow [2024-06-03 22:29:28,846 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-06-03 22:29:28,846 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-06-03 22:29:28,846 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 152 flow [2024-06-03 22:29:28,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:29:28,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:28,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:28,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:29:28,849 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:29:28,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1065920051, now seen corresponding path program 1 times [2024-06-03 22:29:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54706306] [2024-06-03 22:29:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:31,569 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:29:31,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54706306] [2024-06-03 22:29:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54706306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:31,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:29:31,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31647317] [2024-06-03 22:29:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:31,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:29:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:31,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:29:31,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:29:31,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:29:31,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:29:31,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:31,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:29:31,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:32,407 INFO L124 PetriNetUnfolderBase]: 1632/2439 cut-off events. [2024-06-03 22:29:32,407 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2024-06-03 22:29:32,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6215 conditions, 2439 events. 1632/2439 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11020 event pairs, 743 based on Foata normal form. 6/2443 useless extension candidates. Maximal degree in co-relation 6197. Up to 2381 conditions per place. [2024-06-03 22:29:32,418 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-03 22:29:32,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 346 flow [2024-06-03 22:29:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:29:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:29:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-03 22:29:32,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024390243902439 [2024-06-03 22:29:32,420 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 152 flow. Second operand 5 states and 103 transitions. [2024-06-03 22:29:32,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 346 flow [2024-06-03 22:29:32,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 344 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-03 22:29:32,423 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 198 flow [2024-06-03 22:29:32,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-03 22:29:32,424 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-06-03 22:29:32,424 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 198 flow [2024-06-03 22:29:32,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:29:32,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:32,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:32,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:29:32,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:29:32,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2146976690, now seen corresponding path program 1 times [2024-06-03 22:29:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:32,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239549800] [2024-06-03 22:29:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:36,287 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:29:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239549800] [2024-06-03 22:29:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239549800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:36,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:36,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:29:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539652616] [2024-06-03 22:29:36,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:36,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:29:36,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:36,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:29:36,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:29:36,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:29:36,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:36,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:36,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:29:36,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:37,196 INFO L124 PetriNetUnfolderBase]: 1623/2424 cut-off events. [2024-06-03 22:29:37,196 INFO L125 PetriNetUnfolderBase]: For 2223/2223 co-relation queries the response was YES. [2024-06-03 22:29:37,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 2424 events. 1623/2424 cut-off events. For 2223/2223 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10903 event pairs, 579 based on Foata normal form. 6/2428 useless extension candidates. Maximal degree in co-relation 6761. Up to 2336 conditions per place. [2024-06-03 22:29:37,208 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 57 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2024-06-03 22:29:37,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 410 flow [2024-06-03 22:29:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:29:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:29:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-03 22:29:37,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2024-06-03 22:29:37,211 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 198 flow. Second operand 6 states and 117 transitions. [2024-06-03 22:29:37,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 410 flow [2024-06-03 22:29:37,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 388 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:29:37,214 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 217 flow [2024-06-03 22:29:37,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-06-03 22:29:37,215 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2024-06-03 22:29:37,215 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 217 flow [2024-06-03 22:29:37,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:37,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:37,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:37,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:29:37,216 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:29:37,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1906018500, now seen corresponding path program 1 times [2024-06-03 22:29:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:37,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514528959] [2024-06-03 22:29:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:42,362 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:29:42,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:42,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514528959] [2024-06-03 22:29:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514528959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:42,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:29:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117653784] [2024-06-03 22:29:42,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:42,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:29:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:29:42,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:29:42,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:29:42,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:29:42,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:42,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:29:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:43,184 INFO L124 PetriNetUnfolderBase]: 1237/1933 cut-off events. [2024-06-03 22:29:43,185 INFO L125 PetriNetUnfolderBase]: For 2895/2931 co-relation queries the response was YES. [2024-06-03 22:29:43,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5692 conditions, 1933 events. 1237/1933 cut-off events. For 2895/2931 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9278 event pairs, 586 based on Foata normal form. 4/1867 useless extension candidates. Maximal degree in co-relation 5670. Up to 1810 conditions per place. [2024-06-03 22:29:43,193 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 42 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-03 22:29:43,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 363 flow [2024-06-03 22:29:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:29:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:29:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-03 22:29:43,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-03 22:29:43,195 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 217 flow. Second operand 5 states and 92 transitions. [2024-06-03 22:29:43,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 363 flow [2024-06-03 22:29:43,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 332 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 22:29:43,198 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 231 flow [2024-06-03 22:29:43,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-06-03 22:29:43,199 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-03 22:29:43,199 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 231 flow [2024-06-03 22:29:43,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:29:43,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:43,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:43,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:29:43,199 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:29:43,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:43,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1081397346, now seen corresponding path program 1 times [2024-06-03 22:29:43,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:43,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511706029] [2024-06-03 22:29:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:48,743 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:29:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511706029] [2024-06-03 22:29:48,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511706029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:48,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:29:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91008402] [2024-06-03 22:29:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:29:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:29:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:29:48,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:29:48,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:29:48,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:48,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:29:48,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:49,703 INFO L124 PetriNetUnfolderBase]: 1618/2421 cut-off events. [2024-06-03 22:29:49,703 INFO L125 PetriNetUnfolderBase]: For 4508/4518 co-relation queries the response was YES. [2024-06-03 22:29:49,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7698 conditions, 2421 events. 1618/2421 cut-off events. For 4508/4518 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10878 event pairs, 734 based on Foata normal form. 12/2430 useless extension candidates. Maximal degree in co-relation 7674. Up to 2335 conditions per place. [2024-06-03 22:29:49,718 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-03 22:29:49,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 487 flow [2024-06-03 22:29:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:29:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:29:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 22:29:49,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:29:49,720 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 231 flow. Second operand 6 states and 102 transitions. [2024-06-03 22:29:49,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 487 flow [2024-06-03 22:29:49,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 464 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:29:49,726 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 316 flow [2024-06-03 22:29:49,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-06-03 22:29:49,729 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-03 22:29:49,729 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 316 flow [2024-06-03 22:29:49,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:29:49,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:49,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:49,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:29:49,730 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:29:49,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2129436313, now seen corresponding path program 1 times [2024-06-03 22:29:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284639748] [2024-06-03 22:29:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:54,931 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:29:54,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:54,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284639748] [2024-06-03 22:29:54,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284639748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:54,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:54,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:29:54,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862802977] [2024-06-03 22:29:54,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:54,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:29:54,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:54,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:29:54,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:29:55,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:29:55,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:29:55,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:55,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:29:55,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:55,838 INFO L124 PetriNetUnfolderBase]: 1641/2455 cut-off events. [2024-06-03 22:29:55,838 INFO L125 PetriNetUnfolderBase]: For 6463/6463 co-relation queries the response was YES. [2024-06-03 22:29:55,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 2455 events. 1641/2455 cut-off events. For 6463/6463 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11004 event pairs, 758 based on Foata normal form. 2/2455 useless extension candidates. Maximal degree in co-relation 8687. Up to 2411 conditions per place. [2024-06-03 22:29:55,856 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2024-06-03 22:29:55,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 592 flow [2024-06-03 22:29:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:29:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:29:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:29:55,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:29:55,858 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 316 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:29:55,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 592 flow [2024-06-03 22:29:55,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 563 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-03 22:29:55,865 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 397 flow [2024-06-03 22:29:55,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2024-06-03 22:29:55,866 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2024-06-03 22:29:55,867 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 397 flow [2024-06-03 22:29:55,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:29:55,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:55,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:55,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:29:55,867 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:29:55,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash 830700505, now seen corresponding path program 2 times [2024-06-03 22:29:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689302415] [2024-06-03 22:29:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:55,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:01,087 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:30:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689302415] [2024-06-03 22:30:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689302415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:30:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810370959] [2024-06-03 22:30:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:01,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:30:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:01,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:30:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:30:01,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:01,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:30:01,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:01,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:01,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:02,246 INFO L124 PetriNetUnfolderBase]: 1697/2534 cut-off events. [2024-06-03 22:30:02,246 INFO L125 PetriNetUnfolderBase]: For 8260/8260 co-relation queries the response was YES. [2024-06-03 22:30:02,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9283 conditions, 2534 events. 1697/2534 cut-off events. For 8260/8260 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11309 event pairs, 757 based on Foata normal form. 5/2537 useless extension candidates. Maximal degree in co-relation 9254. Up to 2445 conditions per place. [2024-06-03 22:30:02,260 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 67 selfloop transitions, 28 changer transitions 0/98 dead transitions. [2024-06-03 22:30:02,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 737 flow [2024-06-03 22:30:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:30:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:30:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-03 22:30:02,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44308943089430897 [2024-06-03 22:30:02,264 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 397 flow. Second operand 6 states and 109 transitions. [2024-06-03 22:30:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 737 flow [2024-06-03 22:30:02,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 696 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:30:02,270 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 538 flow [2024-06-03 22:30:02,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2024-06-03 22:30:02,271 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-03 22:30:02,271 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 538 flow [2024-06-03 22:30:02,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:30:02,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:02,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:02,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:30:02,272 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:30:02,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash 836414425, now seen corresponding path program 3 times [2024-06-03 22:30:02,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:02,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102778095] [2024-06-03 22:30:02,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:07,904 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:30:07,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:07,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102778095] [2024-06-03 22:30:07,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102778095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:07,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:30:07,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438142589] [2024-06-03 22:30:07,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:07,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:30:07,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:07,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:30:07,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:30:08,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:08,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:30:08,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:08,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:08,842 INFO L124 PetriNetUnfolderBase]: 1684/2517 cut-off events. [2024-06-03 22:30:08,842 INFO L125 PetriNetUnfolderBase]: For 10576/10589 co-relation queries the response was YES. [2024-06-03 22:30:08,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10315 conditions, 2517 events. 1684/2517 cut-off events. For 10576/10589 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11311 event pairs, 762 based on Foata normal form. 14/2527 useless extension candidates. Maximal degree in co-relation 10285. Up to 2407 conditions per place. [2024-06-03 22:30:08,856 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 67 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2024-06-03 22:30:08,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 783 flow [2024-06-03 22:30:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:30:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:30:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-03 22:30:08,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 22:30:08,858 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 538 flow. Second operand 6 states and 100 transitions. [2024-06-03 22:30:08,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 783 flow [2024-06-03 22:30:08,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 94 transitions, 737 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-03 22:30:08,869 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 583 flow [2024-06-03 22:30:08,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=583, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-06-03 22:30:08,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2024-06-03 22:30:08,870 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 583 flow [2024-06-03 22:30:08,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:30:08,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:08,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:08,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:30:08,871 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:30:08,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:08,871 INFO L85 PathProgramCache]: Analyzing trace with hash 836422361, now seen corresponding path program 1 times [2024-06-03 22:30:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:08,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144433062] [2024-06-03 22:30:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:14,500 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:30:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144433062] [2024-06-03 22:30:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144433062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:14,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:30:14,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030764210] [2024-06-03 22:30:14,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:14,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:30:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:14,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:30:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:30:14,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:14,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 583 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:14,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:14,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:14,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:15,432 INFO L124 PetriNetUnfolderBase]: 1690/2526 cut-off events. [2024-06-03 22:30:15,432 INFO L125 PetriNetUnfolderBase]: For 10531/10544 co-relation queries the response was YES. [2024-06-03 22:30:15,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10433 conditions, 2526 events. 1690/2526 cut-off events. For 10531/10544 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11344 event pairs, 726 based on Foata normal form. 14/2536 useless extension candidates. Maximal degree in co-relation 10400. Up to 2398 conditions per place. [2024-06-03 22:30:15,446 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 30 changer transitions 0/102 dead transitions. [2024-06-03 22:30:15,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 865 flow [2024-06-03 22:30:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:30:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:30:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-03 22:30:15,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40069686411149824 [2024-06-03 22:30:15,448 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 583 flow. Second operand 7 states and 115 transitions. [2024-06-03 22:30:15,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 865 flow [2024-06-03 22:30:15,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 829 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 22:30:15,456 INFO L231 Difference]: Finished difference. Result has 75 places, 83 transitions, 650 flow [2024-06-03 22:30:15,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=75, PETRI_TRANSITIONS=83} [2024-06-03 22:30:15,457 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-03 22:30:15,457 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 650 flow [2024-06-03 22:30:15,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:15,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:15,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:15,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:30:15,458 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:30:15,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1102396995, now seen corresponding path program 1 times [2024-06-03 22:30:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899587718] [2024-06-03 22:30:15,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:20,832 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:30:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899587718] [2024-06-03 22:30:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899587718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:30:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582997708] [2024-06-03 22:30:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:20,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:30:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:20,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:30:20,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:30:20,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:20,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 650 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:20,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:20,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:20,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:21,914 INFO L124 PetriNetUnfolderBase]: 1818/2704 cut-off events. [2024-06-03 22:30:21,915 INFO L125 PetriNetUnfolderBase]: For 13879/13879 co-relation queries the response was YES. [2024-06-03 22:30:21,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11903 conditions, 2704 events. 1818/2704 cut-off events. For 13879/13879 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12181 event pairs, 583 based on Foata normal form. 10/2712 useless extension candidates. Maximal degree in co-relation 11869. Up to 2515 conditions per place. [2024-06-03 22:30:21,928 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 93 selfloop transitions, 37 changer transitions 0/133 dead transitions. [2024-06-03 22:30:21,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 133 transitions, 1166 flow [2024-06-03 22:30:21,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:30:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:30:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 22:30:21,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:30:21,929 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 650 flow. Second operand 7 states and 133 transitions. [2024-06-03 22:30:21,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 133 transitions, 1166 flow [2024-06-03 22:30:21,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 1093 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 22:30:21,940 INFO L231 Difference]: Finished difference. Result has 79 places, 101 transitions, 837 flow [2024-06-03 22:30:21,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=837, PETRI_PLACES=79, PETRI_TRANSITIONS=101} [2024-06-03 22:30:21,940 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-03 22:30:21,940 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 101 transitions, 837 flow [2024-06-03 22:30:21,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:21,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:21,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:21,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:30:21,941 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:30:21,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash 739556343, now seen corresponding path program 2 times [2024-06-03 22:30:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005933127] [2024-06-03 22:30:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:27,531 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:30:27,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:27,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005933127] [2024-06-03 22:30:27,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005933127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:27,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:27,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:30:27,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384407526] [2024-06-03 22:30:27,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:27,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:30:27,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:30:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:30:27,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:27,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 101 transitions, 837 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:27,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:27,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:27,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:28,699 INFO L124 PetriNetUnfolderBase]: 1856/2759 cut-off events. [2024-06-03 22:30:28,700 INFO L125 PetriNetUnfolderBase]: For 18320/18320 co-relation queries the response was YES. [2024-06-03 22:30:28,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13650 conditions, 2759 events. 1856/2759 cut-off events. For 18320/18320 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12442 event pairs, 581 based on Foata normal form. 4/2761 useless extension candidates. Maximal degree in co-relation 13613. Up to 2618 conditions per place. [2024-06-03 22:30:28,716 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 104 selfloop transitions, 29 changer transitions 0/136 dead transitions. [2024-06-03 22:30:28,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 136 transitions, 1303 flow [2024-06-03 22:30:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:30:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:30:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-03 22:30:28,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-03 22:30:28,718 INFO L175 Difference]: Start difference. First operand has 79 places, 101 transitions, 837 flow. Second operand 7 states and 120 transitions. [2024-06-03 22:30:28,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 136 transitions, 1303 flow [2024-06-03 22:30:28,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 136 transitions, 1253 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-03 22:30:28,734 INFO L231 Difference]: Finished difference. Result has 85 places, 109 transitions, 954 flow [2024-06-03 22:30:28,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=954, PETRI_PLACES=85, PETRI_TRANSITIONS=109} [2024-06-03 22:30:28,734 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2024-06-03 22:30:28,735 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 109 transitions, 954 flow [2024-06-03 22:30:28,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:28,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:28,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:28,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:30:28,735 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:30:28,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 159044901, now seen corresponding path program 3 times [2024-06-03 22:30:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564065227] [2024-06-03 22:30:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:34,569 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:30:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564065227] [2024-06-03 22:30:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564065227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:34,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:34,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:30:34,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103117006] [2024-06-03 22:30:34,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:34,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:30:34,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:30:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:30:34,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:34,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 109 transitions, 954 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:34,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:34,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:34,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:35,613 INFO L124 PetriNetUnfolderBase]: 1928/2870 cut-off events. [2024-06-03 22:30:35,614 INFO L125 PetriNetUnfolderBase]: For 22923/22927 co-relation queries the response was YES. [2024-06-03 22:30:35,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14682 conditions, 2870 events. 1928/2870 cut-off events. For 22923/22927 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13105 event pairs, 530 based on Foata normal form. 16/2881 useless extension candidates. Maximal degree in co-relation 14642. Up to 2449 conditions per place. [2024-06-03 22:30:35,630 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 103 selfloop transitions, 43 changer transitions 0/149 dead transitions. [2024-06-03 22:30:35,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 149 transitions, 1528 flow [2024-06-03 22:30:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:30:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:30:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 22:30:35,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-03 22:30:35,633 INFO L175 Difference]: Start difference. First operand has 85 places, 109 transitions, 954 flow. Second operand 7 states and 129 transitions. [2024-06-03 22:30:35,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 149 transitions, 1528 flow [2024-06-03 22:30:35,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 149 transitions, 1490 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-03 22:30:35,651 INFO L231 Difference]: Finished difference. Result has 90 places, 121 transitions, 1142 flow [2024-06-03 22:30:35,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1142, PETRI_PLACES=90, PETRI_TRANSITIONS=121} [2024-06-03 22:30:35,652 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-03 22:30:35,652 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 121 transitions, 1142 flow [2024-06-03 22:30:35,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:30:35,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:35,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:35,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:30:35,653 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:30:35,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash 159291165, now seen corresponding path program 1 times [2024-06-03 22:30:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:35,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282225027] [2024-06-03 22:30:35,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:35,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:41,872 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:30:41,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282225027] [2024-06-03 22:30:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282225027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:41,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:41,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:30:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034574448] [2024-06-03 22:30:41,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:41,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:30:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:30:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:30:42,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:42,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 121 transitions, 1142 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:30:42,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:42,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:42,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:43,205 INFO L124 PetriNetUnfolderBase]: 2056/3088 cut-off events. [2024-06-03 22:30:43,206 INFO L125 PetriNetUnfolderBase]: For 29258/29262 co-relation queries the response was YES. [2024-06-03 22:30:43,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16730 conditions, 3088 events. 2056/3088 cut-off events. For 29258/29262 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14483 event pairs, 468 based on Foata normal form. 36/3119 useless extension candidates. Maximal degree in co-relation 16687. Up to 2555 conditions per place. [2024-06-03 22:30:43,223 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 114 selfloop transitions, 51 changer transitions 0/168 dead transitions. [2024-06-03 22:30:43,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 168 transitions, 1820 flow [2024-06-03 22:30:43,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:30:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:30:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-03 22:30:43,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-03 22:30:43,226 INFO L175 Difference]: Start difference. First operand has 90 places, 121 transitions, 1142 flow. Second operand 8 states and 148 transitions. [2024-06-03 22:30:43,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 168 transitions, 1820 flow [2024-06-03 22:30:43,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 168 transitions, 1746 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-06-03 22:30:43,250 INFO L231 Difference]: Finished difference. Result has 99 places, 132 transitions, 1385 flow [2024-06-03 22:30:43,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1385, PETRI_PLACES=99, PETRI_TRANSITIONS=132} [2024-06-03 22:30:43,250 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2024-06-03 22:30:43,251 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 132 transitions, 1385 flow [2024-06-03 22:30:43,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:30:43,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:43,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:43,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:30:43,251 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:30:43,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2131785044, now seen corresponding path program 1 times [2024-06-03 22:30:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831904018] [2024-06-03 22:30:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:49,723 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:30:49,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:49,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831904018] [2024-06-03 22:30:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831904018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:30:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483125314] [2024-06-03 22:30:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:49,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:30:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:30:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:30:49,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:49,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 132 transitions, 1385 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:30:49,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:49,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:49,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:50,961 INFO L124 PetriNetUnfolderBase]: 2113/3171 cut-off events. [2024-06-03 22:30:50,961 INFO L125 PetriNetUnfolderBase]: For 34459/34459 co-relation queries the response was YES. [2024-06-03 22:30:50,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18479 conditions, 3171 events. 2113/3171 cut-off events. For 34459/34459 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14910 event pairs, 548 based on Foata normal form. 2/3171 useless extension candidates. Maximal degree in co-relation 18431. Up to 3053 conditions per place. [2024-06-03 22:30:50,980 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 143 selfloop transitions, 30 changer transitions 0/176 dead transitions. [2024-06-03 22:30:50,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 176 transitions, 1992 flow [2024-06-03 22:30:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:30:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:30:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-03 22:30:50,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-03 22:30:50,983 INFO L175 Difference]: Start difference. First operand has 99 places, 132 transitions, 1385 flow. Second operand 8 states and 134 transitions. [2024-06-03 22:30:50,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 176 transitions, 1992 flow [2024-06-03 22:30:51,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 176 transitions, 1929 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-03 22:30:51,017 INFO L231 Difference]: Finished difference. Result has 106 places, 146 transitions, 1584 flow [2024-06-03 22:30:51,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1584, PETRI_PLACES=106, PETRI_TRANSITIONS=146} [2024-06-03 22:30:51,018 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-03 22:30:51,018 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 146 transitions, 1584 flow [2024-06-03 22:30:51,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:30:51,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:51,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:51,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:30:51,018 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:30:51,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1440543034, now seen corresponding path program 2 times [2024-06-03 22:30:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:51,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160636852] [2024-06-03 22:30:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:57,590 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:30:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160636852] [2024-06-03 22:30:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160636852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:30:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889047533] [2024-06-03 22:30:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:57,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:30:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:57,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:30:57,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:30:57,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:30:57,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 146 transitions, 1584 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:30:57,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:57,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:30:57,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:58,870 INFO L124 PetriNetUnfolderBase]: 2108/3163 cut-off events. [2024-06-03 22:30:58,870 INFO L125 PetriNetUnfolderBase]: For 36962/36962 co-relation queries the response was YES. [2024-06-03 22:30:58,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18658 conditions, 3163 events. 2108/3163 cut-off events. For 36962/36962 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14881 event pairs, 545 based on Foata normal form. 2/3163 useless extension candidates. Maximal degree in co-relation 18607. Up to 3019 conditions per place. [2024-06-03 22:30:58,889 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 33 changer transitions 0/172 dead transitions. [2024-06-03 22:30:58,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 172 transitions, 2020 flow [2024-06-03 22:30:58,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:30:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:30:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:30:58,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-03 22:30:58,891 INFO L175 Difference]: Start difference. First operand has 106 places, 146 transitions, 1584 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:30:58,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 172 transitions, 2020 flow [2024-06-03 22:30:58,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 172 transitions, 1963 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-03 22:30:58,927 INFO L231 Difference]: Finished difference. Result has 110 places, 146 transitions, 1613 flow [2024-06-03 22:30:58,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1613, PETRI_PLACES=110, PETRI_TRANSITIONS=146} [2024-06-03 22:30:58,927 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-03 22:30:58,927 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 146 transitions, 1613 flow [2024-06-03 22:30:58,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:30:58,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:58,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:58,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:30:58,928 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:30:58,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -564402571, now seen corresponding path program 1 times [2024-06-03 22:30:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:58,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155273302] [2024-06-03 22:30:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:05,058 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:31:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155273302] [2024-06-03 22:31:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155273302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:31:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729961416] [2024-06-03 22:31:05,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:05,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:31:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:05,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:31:05,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:31:05,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:05,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 146 transitions, 1613 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:05,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:05,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:05,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:06,274 INFO L124 PetriNetUnfolderBase]: 2130/3200 cut-off events. [2024-06-03 22:31:06,274 INFO L125 PetriNetUnfolderBase]: For 41724/41747 co-relation queries the response was YES. [2024-06-03 22:31:06,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19143 conditions, 3200 events. 2130/3200 cut-off events. For 41724/41747 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15139 event pairs, 549 based on Foata normal form. 22/3216 useless extension candidates. Maximal degree in co-relation 19091. Up to 3036 conditions per place. [2024-06-03 22:31:06,296 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 139 selfloop transitions, 31 changer transitions 0/173 dead transitions. [2024-06-03 22:31:06,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 173 transitions, 2079 flow [2024-06-03 22:31:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 22:31:06,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 22:31:06,297 INFO L175 Difference]: Start difference. First operand has 110 places, 146 transitions, 1613 flow. Second operand 7 states and 117 transitions. [2024-06-03 22:31:06,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 173 transitions, 2079 flow [2024-06-03 22:31:06,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 173 transitions, 2019 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:31:06,336 INFO L231 Difference]: Finished difference. Result has 113 places, 150 transitions, 1684 flow [2024-06-03 22:31:06,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1684, PETRI_PLACES=113, PETRI_TRANSITIONS=150} [2024-06-03 22:31:06,336 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-03 22:31:06,337 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 150 transitions, 1684 flow [2024-06-03 22:31:06,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:06,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:06,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:06,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:31:06,337 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:31:06,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -181710765, now seen corresponding path program 2 times [2024-06-03 22:31:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:06,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163169008] [2024-06-03 22:31:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163169008] [2024-06-03 22:31:12,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163169008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:31:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844983602] [2024-06-03 22:31:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:12,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:31:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:31:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:31:12,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:12,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 150 transitions, 1684 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:12,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:12,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:12,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:13,650 INFO L124 PetriNetUnfolderBase]: 2168/3255 cut-off events. [2024-06-03 22:31:13,650 INFO L125 PetriNetUnfolderBase]: For 43080/43099 co-relation queries the response was YES. [2024-06-03 22:31:13,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19604 conditions, 3255 events. 2168/3255 cut-off events. For 43080/43099 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15375 event pairs, 554 based on Foata normal form. 12/3261 useless extension candidates. Maximal degree in co-relation 19550. Up to 2703 conditions per place. [2024-06-03 22:31:13,673 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 111 selfloop transitions, 68 changer transitions 0/182 dead transitions. [2024-06-03 22:31:13,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 182 transitions, 2342 flow [2024-06-03 22:31:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-03 22:31:13,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:31:13,676 INFO L175 Difference]: Start difference. First operand has 113 places, 150 transitions, 1684 flow. Second operand 7 states and 126 transitions. [2024-06-03 22:31:13,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 182 transitions, 2342 flow [2024-06-03 22:31:13,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 182 transitions, 2302 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-03 22:31:13,716 INFO L231 Difference]: Finished difference. Result has 118 places, 156 transitions, 1875 flow [2024-06-03 22:31:13,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1875, PETRI_PLACES=118, PETRI_TRANSITIONS=156} [2024-06-03 22:31:13,716 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-03 22:31:13,717 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 156 transitions, 1875 flow [2024-06-03 22:31:13,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:13,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:13,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:13,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:31:13,717 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:31:13,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1513260605, now seen corresponding path program 3 times [2024-06-03 22:31:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877253855] [2024-06-03 22:31:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:19,846 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:31:19,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:19,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877253855] [2024-06-03 22:31:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877253855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:19,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:19,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:31:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439696029] [2024-06-03 22:31:19,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:19,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:31:19,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:19,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:31:19,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:31:19,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:19,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 156 transitions, 1875 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:19,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:19,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:19,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:21,054 INFO L124 PetriNetUnfolderBase]: 2141/3214 cut-off events. [2024-06-03 22:31:21,054 INFO L125 PetriNetUnfolderBase]: For 47160/47164 co-relation queries the response was YES. [2024-06-03 22:31:21,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19773 conditions, 3214 events. 2141/3214 cut-off events. For 47160/47164 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15114 event pairs, 544 based on Foata normal form. 12/3220 useless extension candidates. Maximal degree in co-relation 19717. Up to 2680 conditions per place. [2024-06-03 22:31:21,073 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 107 selfloop transitions, 76 changer transitions 0/186 dead transitions. [2024-06-03 22:31:21,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 186 transitions, 2528 flow [2024-06-03 22:31:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:31:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:31:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:31:21,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:31:21,076 INFO L175 Difference]: Start difference. First operand has 118 places, 156 transitions, 1875 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:31:21,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 186 transitions, 2528 flow [2024-06-03 22:31:21,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 186 transitions, 2398 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-03 22:31:21,121 INFO L231 Difference]: Finished difference. Result has 124 places, 158 transitions, 1938 flow [2024-06-03 22:31:21,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1938, PETRI_PLACES=124, PETRI_TRANSITIONS=158} [2024-06-03 22:31:21,121 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2024-06-03 22:31:21,121 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 158 transitions, 1938 flow [2024-06-03 22:31:21,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:21,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:21,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:21,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:31:21,122 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:31:21,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 643050680, now seen corresponding path program 1 times [2024-06-03 22:31:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579763202] [2024-06-03 22:31:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:27,987 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:31:27,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:27,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579763202] [2024-06-03 22:31:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579763202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:31:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456757951] [2024-06-03 22:31:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:27,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:31:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:31:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:31:28,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:28,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 158 transitions, 1938 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:28,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:28,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:28,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:29,229 INFO L124 PetriNetUnfolderBase]: 2152/3230 cut-off events. [2024-06-03 22:31:29,229 INFO L125 PetriNetUnfolderBase]: For 50722/50741 co-relation queries the response was YES. [2024-06-03 22:31:29,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20119 conditions, 3230 events. 2152/3230 cut-off events. For 50722/50741 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15213 event pairs, 553 based on Foata normal form. 10/3234 useless extension candidates. Maximal degree in co-relation 20061. Up to 2732 conditions per place. [2024-06-03 22:31:29,251 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 117 selfloop transitions, 65 changer transitions 0/185 dead transitions. [2024-06-03 22:31:29,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 185 transitions, 2566 flow [2024-06-03 22:31:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:31:29,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:31:29,252 INFO L175 Difference]: Start difference. First operand has 124 places, 158 transitions, 1938 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:31:29,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 185 transitions, 2566 flow [2024-06-03 22:31:29,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 185 transitions, 2398 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:31:29,304 INFO L231 Difference]: Finished difference. Result has 126 places, 161 transitions, 1950 flow [2024-06-03 22:31:29,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1950, PETRI_PLACES=126, PETRI_TRANSITIONS=161} [2024-06-03 22:31:29,305 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2024-06-03 22:31:29,305 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 161 transitions, 1950 flow [2024-06-03 22:31:29,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:29,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:29,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:29,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:31:29,305 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:31:29,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash 642783770, now seen corresponding path program 2 times [2024-06-03 22:31:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718722048] [2024-06-03 22:31:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:35,622 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:31:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:35,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718722048] [2024-06-03 22:31:35,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718722048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:35,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:35,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:31:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144697237] [2024-06-03 22:31:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:35,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:31:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:31:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:31:35,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:35,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 161 transitions, 1950 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:35,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:35,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:35,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:36,874 INFO L124 PetriNetUnfolderBase]: 2131/3199 cut-off events. [2024-06-03 22:31:36,874 INFO L125 PetriNetUnfolderBase]: For 53915/53934 co-relation queries the response was YES. [2024-06-03 22:31:36,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20007 conditions, 3199 events. 2131/3199 cut-off events. For 53915/53934 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15065 event pairs, 554 based on Foata normal form. 14/3207 useless extension candidates. Maximal degree in co-relation 19947. Up to 2786 conditions per place. [2024-06-03 22:31:36,899 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 122 selfloop transitions, 59 changer transitions 0/184 dead transitions. [2024-06-03 22:31:36,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 184 transitions, 2466 flow [2024-06-03 22:31:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:31:36,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:31:36,902 INFO L175 Difference]: Start difference. First operand has 126 places, 161 transitions, 1950 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:31:36,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 184 transitions, 2466 flow [2024-06-03 22:31:36,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 184 transitions, 2320 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-03 22:31:36,959 INFO L231 Difference]: Finished difference. Result has 129 places, 161 transitions, 1932 flow [2024-06-03 22:31:36,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1932, PETRI_PLACES=129, PETRI_TRANSITIONS=161} [2024-06-03 22:31:36,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-03 22:31:36,960 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 161 transitions, 1932 flow [2024-06-03 22:31:36,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:36,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:36,960 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:31:36,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:31:36,961 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:31:36,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash 261312864, now seen corresponding path program 1 times [2024-06-03 22:31:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182305012] [2024-06-03 22:31:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:43,456 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:31:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:43,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182305012] [2024-06-03 22:31:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182305012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:43,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:31:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969763479] [2024-06-03 22:31:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:43,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:31:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:31:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:31:43,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:43,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 161 transitions, 1932 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:43,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:43,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:43,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:44,790 INFO L124 PetriNetUnfolderBase]: 2178/3274 cut-off events. [2024-06-03 22:31:44,790 INFO L125 PetriNetUnfolderBase]: For 58016/58020 co-relation queries the response was YES. [2024-06-03 22:31:44,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20579 conditions, 3274 events. 2178/3274 cut-off events. For 58016/58020 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15505 event pairs, 548 based on Foata normal form. 8/3280 useless extension candidates. Maximal degree in co-relation 20518. Up to 3123 conditions per place. [2024-06-03 22:31:44,813 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 167 selfloop transitions, 33 changer transitions 0/203 dead transitions. [2024-06-03 22:31:44,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 203 transitions, 2546 flow [2024-06-03 22:31:44,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:31:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:31:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-03 22:31:44,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-03 22:31:44,815 INFO L175 Difference]: Start difference. First operand has 129 places, 161 transitions, 1932 flow. Second operand 9 states and 148 transitions. [2024-06-03 22:31:44,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 203 transitions, 2546 flow [2024-06-03 22:31:44,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 203 transitions, 2368 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 22:31:44,869 INFO L231 Difference]: Finished difference. Result has 133 places, 170 transitions, 1961 flow [2024-06-03 22:31:44,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1961, PETRI_PLACES=133, PETRI_TRANSITIONS=170} [2024-06-03 22:31:44,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2024-06-03 22:31:44,870 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 170 transitions, 1961 flow [2024-06-03 22:31:44,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:44,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:44,870 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:31:44,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:31:44,871 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:31:44,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash -319470718, now seen corresponding path program 2 times [2024-06-03 22:31:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873424668] [2024-06-03 22:31:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:44,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:51,055 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:31:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873424668] [2024-06-03 22:31:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873424668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:31:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268380642] [2024-06-03 22:31:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:31:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:31:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:31:51,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:51,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 170 transitions, 1961 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:51,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:51,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:51,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:52,417 INFO L124 PetriNetUnfolderBase]: 2195/3300 cut-off events. [2024-06-03 22:31:52,417 INFO L125 PetriNetUnfolderBase]: For 62913/62919 co-relation queries the response was YES. [2024-06-03 22:31:52,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20980 conditions, 3300 events. 2195/3300 cut-off events. For 62913/62919 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15687 event pairs, 389 based on Foata normal form. 10/3308 useless extension candidates. Maximal degree in co-relation 20916. Up to 3097 conditions per place. [2024-06-03 22:31:52,443 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 164 selfloop transitions, 33 changer transitions 0/200 dead transitions. [2024-06-03 22:31:52,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 200 transitions, 2493 flow [2024-06-03 22:31:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:31:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:31:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:31:52,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:31:52,446 INFO L175 Difference]: Start difference. First operand has 133 places, 170 transitions, 1961 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:31:52,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 200 transitions, 2493 flow [2024-06-03 22:31:52,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 200 transitions, 2410 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-03 22:31:52,501 INFO L231 Difference]: Finished difference. Result has 136 places, 172 transitions, 1994 flow [2024-06-03 22:31:52,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1994, PETRI_PLACES=136, PETRI_TRANSITIONS=172} [2024-06-03 22:31:52,502 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-03 22:31:52,502 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 172 transitions, 1994 flow [2024-06-03 22:31:52,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:52,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:52,502 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:31:52,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:31:52,502 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:31:52,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash -319410268, now seen corresponding path program 3 times [2024-06-03 22:31:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:52,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343252941] [2024-06-03 22:31:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:52,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343252941] [2024-06-03 22:31:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343252941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:59,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:59,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:31:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947649329] [2024-06-03 22:31:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:59,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:31:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:31:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:31:59,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:59,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 172 transitions, 1994 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:59,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:59,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:59,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:00,453 INFO L124 PetriNetUnfolderBase]: 2212/3327 cut-off events. [2024-06-03 22:32:00,453 INFO L125 PetriNetUnfolderBase]: For 68261/68261 co-relation queries the response was YES. [2024-06-03 22:32:00,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21511 conditions, 3327 events. 2212/3327 cut-off events. For 68261/68261 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15816 event pairs, 518 based on Foata normal form. 4/3329 useless extension candidates. Maximal degree in co-relation 21446. Up to 3136 conditions per place. [2024-06-03 22:32:00,474 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 160 selfloop transitions, 39 changer transitions 0/202 dead transitions. [2024-06-03 22:32:00,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 202 transitions, 2536 flow [2024-06-03 22:32:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-03 22:32:00,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-03 22:32:00,477 INFO L175 Difference]: Start difference. First operand has 136 places, 172 transitions, 1994 flow. Second operand 8 states and 132 transitions. [2024-06-03 22:32:00,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 202 transitions, 2536 flow [2024-06-03 22:32:00,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 202 transitions, 2436 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 22:32:00,537 INFO L231 Difference]: Finished difference. Result has 138 places, 174 transitions, 2026 flow [2024-06-03 22:32:00,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2026, PETRI_PLACES=138, PETRI_TRANSITIONS=174} [2024-06-03 22:32:00,538 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-03 22:32:00,538 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 174 transitions, 2026 flow [2024-06-03 22:32:00,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:00,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:00,538 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:32:00,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:32:00,539 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:32:00,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 921671376, now seen corresponding path program 1 times [2024-06-03 22:32:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029324892] [2024-06-03 22:32:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:06,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:06,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029324892] [2024-06-03 22:32:06,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029324892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:06,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:06,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179512018] [2024-06-03 22:32:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:06,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:06,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:06,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 174 transitions, 2026 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:06,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:06,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:06,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:08,062 INFO L124 PetriNetUnfolderBase]: 2192/3289 cut-off events. [2024-06-03 22:32:08,062 INFO L125 PetriNetUnfolderBase]: For 68277/68296 co-relation queries the response was YES. [2024-06-03 22:32:08,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21217 conditions, 3289 events. 2192/3289 cut-off events. For 68277/68296 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15512 event pairs, 515 based on Foata normal form. 16/3301 useless extension candidates. Maximal degree in co-relation 21151. Up to 3082 conditions per place. [2024-06-03 22:32:08,088 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 151 selfloop transitions, 42 changer transitions 0/196 dead transitions. [2024-06-03 22:32:08,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 196 transitions, 2496 flow [2024-06-03 22:32:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:32:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:32:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 22:32:08,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 22:32:08,090 INFO L175 Difference]: Start difference. First operand has 138 places, 174 transitions, 2026 flow. Second operand 7 states and 117 transitions. [2024-06-03 22:32:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 196 transitions, 2496 flow [2024-06-03 22:32:08,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 196 transitions, 2380 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 22:32:08,155 INFO L231 Difference]: Finished difference. Result has 139 places, 174 transitions, 2008 flow [2024-06-03 22:32:08,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2008, PETRI_PLACES=139, PETRI_TRANSITIONS=174} [2024-06-03 22:32:08,155 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-03 22:32:08,155 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 174 transitions, 2008 flow [2024-06-03 22:32:08,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:08,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:08,156 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:32:08,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:32:08,156 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:32:08,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash -333737722, now seen corresponding path program 4 times [2024-06-03 22:32:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581903688] [2024-06-03 22:32:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:14,358 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:32:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581903688] [2024-06-03 22:32:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581903688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936379768] [2024-06-03 22:32:14,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:14,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:14,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:14,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:14,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 174 transitions, 2008 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:14,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:14,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:15,657 INFO L124 PetriNetUnfolderBase]: 2344/3513 cut-off events. [2024-06-03 22:32:15,657 INFO L125 PetriNetUnfolderBase]: For 76023/76023 co-relation queries the response was YES. [2024-06-03 22:32:15,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23222 conditions, 3513 events. 2344/3513 cut-off events. For 76023/76023 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16703 event pairs, 510 based on Foata normal form. 4/3512 useless extension candidates. Maximal degree in co-relation 23155. Up to 3283 conditions per place. [2024-06-03 22:32:15,747 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 174 selfloop transitions, 65 changer transitions 0/242 dead transitions. [2024-06-03 22:32:15,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 242 transitions, 3326 flow [2024-06-03 22:32:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:32:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:32:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-03 22:32:15,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:32:15,750 INFO L175 Difference]: Start difference. First operand has 139 places, 174 transitions, 2008 flow. Second operand 9 states and 144 transitions. [2024-06-03 22:32:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 242 transitions, 3326 flow [2024-06-03 22:32:15,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 242 transitions, 3094 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:32:15,816 INFO L231 Difference]: Finished difference. Result has 144 places, 210 transitions, 2662 flow [2024-06-03 22:32:15,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2662, PETRI_PLACES=144, PETRI_TRANSITIONS=210} [2024-06-03 22:32:15,816 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-03 22:32:15,816 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 210 transitions, 2662 flow [2024-06-03 22:32:15,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:15,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:15,816 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:32:15,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:32:15,817 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:32:15,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash 610310366, now seen corresponding path program 1 times [2024-06-03 22:32:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:15,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878732937] [2024-06-03 22:32:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:25,629 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:32:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:25,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878732937] [2024-06-03 22:32:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878732937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:25,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:32:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950349081] [2024-06-03 22:32:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:25,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:32:25,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:25,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:32:25,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:32:25,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:25,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 210 transitions, 2662 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:32:25,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:25,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:25,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:26,915 INFO L124 PetriNetUnfolderBase]: 2341/3511 cut-off events. [2024-06-03 22:32:26,915 INFO L125 PetriNetUnfolderBase]: For 76065/76069 co-relation queries the response was YES. [2024-06-03 22:32:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23383 conditions, 3511 events. 2341/3511 cut-off events. For 76065/76069 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16804 event pairs, 543 based on Foata normal form. 5/3514 useless extension candidates. Maximal degree in co-relation 23312. Up to 3448 conditions per place. [2024-06-03 22:32:26,941 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 206 selfloop transitions, 22 changer transitions 0/231 dead transitions. [2024-06-03 22:32:26,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 231 transitions, 3300 flow [2024-06-03 22:32:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-03 22:32:26,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-03 22:32:26,947 INFO L175 Difference]: Start difference. First operand has 144 places, 210 transitions, 2662 flow. Second operand 6 states and 98 transitions. [2024-06-03 22:32:26,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 231 transitions, 3300 flow [2024-06-03 22:32:27,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 231 transitions, 3123 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 22:32:27,020 INFO L231 Difference]: Finished difference. Result has 147 places, 217 transitions, 2660 flow [2024-06-03 22:32:27,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2485, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2660, PETRI_PLACES=147, PETRI_TRANSITIONS=217} [2024-06-03 22:32:27,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-03 22:32:27,021 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 2660 flow [2024-06-03 22:32:27,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:32:27,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:27,021 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:32:27,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:32:27,021 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:32:27,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1776623708, now seen corresponding path program 5 times [2024-06-03 22:32:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558548339] [2024-06-03 22:32:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:34,356 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:32:34,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:34,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558548339] [2024-06-03 22:32:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558548339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:34,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:32:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532382173] [2024-06-03 22:32:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:34,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:32:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:32:34,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:32:34,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:34,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 2660 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:34,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:34,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:34,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:35,875 INFO L124 PetriNetUnfolderBase]: 2450/3692 cut-off events. [2024-06-03 22:32:35,875 INFO L125 PetriNetUnfolderBase]: For 89841/89845 co-relation queries the response was YES. [2024-06-03 22:32:35,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24586 conditions, 3692 events. 2450/3692 cut-off events. For 89841/89845 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17900 event pairs, 537 based on Foata normal form. 32/3719 useless extension candidates. Maximal degree in co-relation 24512. Up to 2860 conditions per place. [2024-06-03 22:32:35,903 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 146 selfloop transitions, 101 changer transitions 0/250 dead transitions. [2024-06-03 22:32:35,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 250 transitions, 3328 flow [2024-06-03 22:32:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 22:32:35,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:32:35,906 INFO L175 Difference]: Start difference. First operand has 147 places, 217 transitions, 2660 flow. Second operand 8 states and 144 transitions. [2024-06-03 22:32:35,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 250 transitions, 3328 flow [2024-06-03 22:32:35,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 250 transitions, 3275 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-03 22:32:35,985 INFO L231 Difference]: Finished difference. Result has 153 places, 220 transitions, 2877 flow [2024-06-03 22:32:35,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2877, PETRI_PLACES=153, PETRI_TRANSITIONS=220} [2024-06-03 22:32:35,985 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2024-06-03 22:32:35,986 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 220 transitions, 2877 flow [2024-06-03 22:32:35,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:35,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:35,986 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:32:35,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:32:35,986 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:32:35,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1548537860, now seen corresponding path program 1 times [2024-06-03 22:32:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189142096] [2024-06-03 22:32:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:42,645 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:32:42,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189142096] [2024-06-03 22:32:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189142096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002411616] [2024-06-03 22:32:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:42,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:42,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:42,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:42,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 220 transitions, 2877 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:42,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:42,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:42,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:44,071 INFO L124 PetriNetUnfolderBase]: 2467/3717 cut-off events. [2024-06-03 22:32:44,072 INFO L125 PetriNetUnfolderBase]: For 91798/91806 co-relation queries the response was YES. [2024-06-03 22:32:44,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25679 conditions, 3717 events. 2467/3717 cut-off events. For 91798/91806 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18130 event pairs, 561 based on Foata normal form. 12/3726 useless extension candidates. Maximal degree in co-relation 25603. Up to 3560 conditions per place. [2024-06-03 22:32:44,099 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 211 selfloop transitions, 33 changer transitions 0/247 dead transitions. [2024-06-03 22:32:44,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 247 transitions, 3513 flow [2024-06-03 22:32:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-03 22:32:44,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:32:44,102 INFO L175 Difference]: Start difference. First operand has 153 places, 220 transitions, 2877 flow. Second operand 8 states and 128 transitions. [2024-06-03 22:32:44,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 247 transitions, 3513 flow [2024-06-03 22:32:44,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 247 transitions, 3277 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 22:32:44,184 INFO L231 Difference]: Finished difference. Result has 156 places, 224 transitions, 2786 flow [2024-06-03 22:32:44,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2786, PETRI_PLACES=156, PETRI_TRANSITIONS=224} [2024-06-03 22:32:44,185 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-03 22:32:44,185 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 224 transitions, 2786 flow [2024-06-03 22:32:44,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:44,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:44,186 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:32:44,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:32:44,186 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:32:44,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1540263650, now seen corresponding path program 2 times [2024-06-03 22:32:44,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:44,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957925710] [2024-06-03 22:32:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:51,293 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:32:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957925710] [2024-06-03 22:32:51,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957925710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:51,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:51,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207823213] [2024-06-03 22:32:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:51,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:51,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:51,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 224 transitions, 2786 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:51,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:51,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:51,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:52,755 INFO L124 PetriNetUnfolderBase]: 2484/3744 cut-off events. [2024-06-03 22:32:52,755 INFO L125 PetriNetUnfolderBase]: For 95609/95617 co-relation queries the response was YES. [2024-06-03 22:32:52,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25674 conditions, 3744 events. 2484/3744 cut-off events. For 95609/95617 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18267 event pairs, 566 based on Foata normal form. 12/3753 useless extension candidates. Maximal degree in co-relation 25596. Up to 3542 conditions per place. [2024-06-03 22:32:52,782 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 208 selfloop transitions, 42 changer transitions 0/253 dead transitions. [2024-06-03 22:32:52,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 253 transitions, 3438 flow [2024-06-03 22:32:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:32:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:32:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-03 22:32:52,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875338753387534 [2024-06-03 22:32:52,792 INFO L175 Difference]: Start difference. First operand has 156 places, 224 transitions, 2786 flow. Second operand 9 states and 143 transitions. [2024-06-03 22:32:52,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 253 transitions, 3438 flow [2024-06-03 22:32:52,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 253 transitions, 3339 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-03 22:32:52,874 INFO L231 Difference]: Finished difference. Result has 160 places, 226 transitions, 2833 flow [2024-06-03 22:32:52,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2687, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2833, PETRI_PLACES=160, PETRI_TRANSITIONS=226} [2024-06-03 22:32:52,874 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-03 22:32:52,874 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 226 transitions, 2833 flow [2024-06-03 22:32:52,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:52,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:52,875 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:32:52,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:32:52,875 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:32:52,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1548298850, now seen corresponding path program 3 times [2024-06-03 22:32:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:52,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360488714] [2024-06-03 22:32:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:59,566 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:32:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360488714] [2024-06-03 22:32:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360488714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:59,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492729478] [2024-06-03 22:32:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:59,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:59,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:59,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:59,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:59,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:59,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 226 transitions, 2833 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:32:59,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:59,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:00,939 INFO L124 PetriNetUnfolderBase]: 2476/3732 cut-off events. [2024-06-03 22:33:00,939 INFO L125 PetriNetUnfolderBase]: For 100236/100244 co-relation queries the response was YES. [2024-06-03 22:33:00,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25802 conditions, 3732 events. 2476/3732 cut-off events. For 100236/100244 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18260 event pairs, 515 based on Foata normal form. 12/3741 useless extension candidates. Maximal degree in co-relation 25723. Up to 3471 conditions per place. [2024-06-03 22:33:00,970 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 43 changer transitions 0/253 dead transitions. [2024-06-03 22:33:00,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 253 transitions, 3488 flow [2024-06-03 22:33:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-03 22:33:00,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-03 22:33:00,972 INFO L175 Difference]: Start difference. First operand has 160 places, 226 transitions, 2833 flow. Second operand 8 states and 129 transitions. [2024-06-03 22:33:00,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 253 transitions, 3488 flow [2024-06-03 22:33:01,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 253 transitions, 3358 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-03 22:33:01,060 INFO L231 Difference]: Finished difference. Result has 162 places, 229 transitions, 2877 flow [2024-06-03 22:33:01,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2877, PETRI_PLACES=162, PETRI_TRANSITIONS=229} [2024-06-03 22:33:01,061 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-03 22:33:01,061 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 229 transitions, 2877 flow [2024-06-03 22:33:01,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:33:01,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:01,061 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:33:01,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:33:01,061 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:33:01,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 209633856, now seen corresponding path program 2 times [2024-06-03 22:33:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768092235] [2024-06-03 22:33:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:10,529 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:33:10,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768092235] [2024-06-03 22:33:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768092235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:10,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:10,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:33:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483952615] [2024-06-03 22:33:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:10,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:33:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:10,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:33:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:33:10,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:10,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 229 transitions, 2877 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:33:10,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:10,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:10,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:11,802 INFO L124 PetriNetUnfolderBase]: 2458/3707 cut-off events. [2024-06-03 22:33:11,802 INFO L125 PetriNetUnfolderBase]: For 98037/98041 co-relation queries the response was YES. [2024-06-03 22:33:11,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25523 conditions, 3707 events. 2458/3707 cut-off events. For 98037/98041 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18134 event pairs, 555 based on Foata normal form. 8/3713 useless extension candidates. Maximal degree in co-relation 25442. Up to 3637 conditions per place. [2024-06-03 22:33:11,909 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 214 selfloop transitions, 27 changer transitions 0/244 dead transitions. [2024-06-03 22:33:11,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 244 transitions, 3435 flow [2024-06-03 22:33:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:33:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:33:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-03 22:33:11,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:33:11,910 INFO L175 Difference]: Start difference. First operand has 162 places, 229 transitions, 2877 flow. Second operand 5 states and 90 transitions. [2024-06-03 22:33:11,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 244 transitions, 3435 flow [2024-06-03 22:33:11,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 244 transitions, 3290 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-03 22:33:11,994 INFO L231 Difference]: Finished difference. Result has 162 places, 231 transitions, 2839 flow [2024-06-03 22:33:11,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2732, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2839, PETRI_PLACES=162, PETRI_TRANSITIONS=231} [2024-06-03 22:33:11,994 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-03 22:33:11,994 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 231 transitions, 2839 flow [2024-06-03 22:33:11,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:33:11,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:11,995 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:33:11,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:33:11,995 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:33:11,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 367399234, now seen corresponding path program 6 times [2024-06-03 22:33:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:11,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623679507] [2024-06-03 22:33:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:18,466 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:33:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:18,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623679507] [2024-06-03 22:33:18,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623679507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:18,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:18,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:18,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214803893] [2024-06-03 22:33:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:18,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:18,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:18,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:18,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 231 transitions, 2839 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:33:18,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:18,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:19,856 INFO L124 PetriNetUnfolderBase]: 2510/3783 cut-off events. [2024-06-03 22:33:19,856 INFO L125 PetriNetUnfolderBase]: For 101882/101882 co-relation queries the response was YES. [2024-06-03 22:33:19,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25901 conditions, 3783 events. 2510/3783 cut-off events. For 101882/101882 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18529 event pairs, 536 based on Foata normal form. 4/3785 useless extension candidates. Maximal degree in co-relation 25819. Up to 3479 conditions per place. [2024-06-03 22:33:19,892 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 190 selfloop transitions, 90 changer transitions 0/283 dead transitions. [2024-06-03 22:33:19,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 283 transitions, 3824 flow [2024-06-03 22:33:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:33:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:33:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-03 22:33:19,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037940379403794 [2024-06-03 22:33:19,895 INFO L175 Difference]: Start difference. First operand has 162 places, 231 transitions, 2839 flow. Second operand 9 states and 149 transitions. [2024-06-03 22:33:19,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 283 transitions, 3824 flow [2024-06-03 22:33:20,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 283 transitions, 3779 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 22:33:20,023 INFO L231 Difference]: Finished difference. Result has 171 places, 251 transitions, 3379 flow [2024-06-03 22:33:20,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2794, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3379, PETRI_PLACES=171, PETRI_TRANSITIONS=251} [2024-06-03 22:33:20,023 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-03 22:33:20,024 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 251 transitions, 3379 flow [2024-06-03 22:33:20,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:33:20,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:20,024 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:33:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:33:20,024 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:33:20,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2088220804, now seen corresponding path program 1 times [2024-06-03 22:33:20,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875607480] [2024-06-03 22:33:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:26,556 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:33:26,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:26,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875607480] [2024-06-03 22:33:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875607480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:26,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75047690] [2024-06-03 22:33:26,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:26,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:26,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:26,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:26,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 251 transitions, 3379 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:33:26,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:26,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:26,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:28,130 INFO L124 PetriNetUnfolderBase]: 2527/3813 cut-off events. [2024-06-03 22:33:28,131 INFO L125 PetriNetUnfolderBase]: For 112142/112175 co-relation queries the response was YES. [2024-06-03 22:33:28,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26920 conditions, 3813 events. 2527/3813 cut-off events. For 112142/112175 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18730 event pairs, 371 based on Foata normal form. 30/3839 useless extension candidates. Maximal degree in co-relation 26834. Up to 3516 conditions per place. [2024-06-03 22:33:28,163 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 223 selfloop transitions, 54 changer transitions 0/280 dead transitions. [2024-06-03 22:33:28,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 280 transitions, 4073 flow [2024-06-03 22:33:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-03 22:33:28,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-03 22:33:28,165 INFO L175 Difference]: Start difference. First operand has 171 places, 251 transitions, 3379 flow. Second operand 8 states and 129 transitions. [2024-06-03 22:33:28,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 280 transitions, 4073 flow [2024-06-03 22:33:28,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 280 transitions, 3933 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-03 22:33:28,280 INFO L231 Difference]: Finished difference. Result has 175 places, 253 transitions, 3401 flow [2024-06-03 22:33:28,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3401, PETRI_PLACES=175, PETRI_TRANSITIONS=253} [2024-06-03 22:33:28,281 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places. [2024-06-03 22:33:28,281 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 253 transitions, 3401 flow [2024-06-03 22:33:28,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:33:28,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:28,281 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:33:28,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:33:28,281 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:33:28,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1121680166, now seen corresponding path program 2 times [2024-06-03 22:33:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:28,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392234159] [2024-06-03 22:33:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:35,418 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:33:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392234159] [2024-06-03 22:33:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392234159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957298060] [2024-06-03 22:33:35,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:35,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:35,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:35,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 253 transitions, 3401 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:33:35,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:35,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:35,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:36,970 INFO L124 PetriNetUnfolderBase]: 2544/3837 cut-off events. [2024-06-03 22:33:36,970 INFO L125 PetriNetUnfolderBase]: For 118458/118491 co-relation queries the response was YES. [2024-06-03 22:33:36,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27239 conditions, 3837 events. 2544/3837 cut-off events. For 118458/118491 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18906 event pairs, 501 based on Foata normal form. 30/3863 useless extension candidates. Maximal degree in co-relation 27152. Up to 3473 conditions per place. [2024-06-03 22:33:37,002 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 197 selfloop transitions, 82 changer transitions 0/282 dead transitions. [2024-06-03 22:33:37,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 282 transitions, 4107 flow [2024-06-03 22:33:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:33:37,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:33:37,004 INFO L175 Difference]: Start difference. First operand has 175 places, 253 transitions, 3401 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:33:37,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 282 transitions, 4107 flow [2024-06-03 22:33:37,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 282 transitions, 3965 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-03 22:33:37,125 INFO L231 Difference]: Finished difference. Result has 177 places, 255 transitions, 3481 flow [2024-06-03 22:33:37,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3259, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3481, PETRI_PLACES=177, PETRI_TRANSITIONS=255} [2024-06-03 22:33:37,126 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-03 22:33:37,126 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 255 transitions, 3481 flow [2024-06-03 22:33:37,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:33:37,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:37,126 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:33:37,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:33:37,126 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:33:37,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2108086002, now seen corresponding path program 3 times [2024-06-03 22:33:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:37,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544550491] [2024-06-03 22:33:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:44,171 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:33:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:44,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544550491] [2024-06-03 22:33:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544550491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:44,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354166790] [2024-06-03 22:33:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:44,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:44,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:44,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:44,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 255 transitions, 3481 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:33:44,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:44,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:44,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:45,736 INFO L124 PetriNetUnfolderBase]: 2561/3864 cut-off events. [2024-06-03 22:33:45,736 INFO L125 PetriNetUnfolderBase]: For 127028/127061 co-relation queries the response was YES. [2024-06-03 22:33:45,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27820 conditions, 3864 events. 2561/3864 cut-off events. For 127028/127061 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19081 event pairs, 501 based on Foata normal form. 30/3890 useless extension candidates. Maximal degree in co-relation 27732. Up to 3422 conditions per place. [2024-06-03 22:33:45,768 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 205 selfloop transitions, 76 changer transitions 0/284 dead transitions. [2024-06-03 22:33:45,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 284 transitions, 4193 flow [2024-06-03 22:33:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-03 22:33:45,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-03 22:33:45,770 INFO L175 Difference]: Start difference. First operand has 177 places, 255 transitions, 3481 flow. Second operand 8 states and 132 transitions. [2024-06-03 22:33:45,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 284 transitions, 4193 flow [2024-06-03 22:33:45,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 284 transitions, 3991 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 22:33:45,893 INFO L231 Difference]: Finished difference. Result has 179 places, 257 transitions, 3492 flow [2024-06-03 22:33:45,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3279, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3492, PETRI_PLACES=179, PETRI_TRANSITIONS=257} [2024-06-03 22:33:45,894 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places. [2024-06-03 22:33:45,894 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 257 transitions, 3492 flow [2024-06-03 22:33:45,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:33:45,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:45,894 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:33:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:33:45,894 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:33:45,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash -272460318, now seen corresponding path program 1 times [2024-06-03 22:33:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483195870] [2024-06-03 22:33:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:56,605 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:33:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:56,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483195870] [2024-06-03 22:33:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483195870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:33:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755100203] [2024-06-03 22:33:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:56,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:33:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:33:56,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:33:56,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:56,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 257 transitions, 3492 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:56,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:56,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:56,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:58,118 INFO L124 PetriNetUnfolderBase]: 2571/3882 cut-off events. [2024-06-03 22:33:58,118 INFO L125 PetriNetUnfolderBase]: For 132409/132417 co-relation queries the response was YES. [2024-06-03 22:33:58,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28126 conditions, 3882 events. 2571/3882 cut-off events. For 132409/132417 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19262 event pairs, 508 based on Foata normal form. 10/3890 useless extension candidates. Maximal degree in co-relation 28037. Up to 3677 conditions per place. [2024-06-03 22:33:58,156 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 224 selfloop transitions, 62 changer transitions 0/289 dead transitions. [2024-06-03 22:33:58,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 289 transitions, 4326 flow [2024-06-03 22:33:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:33:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:33:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:33:58,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-03 22:33:58,159 INFO L175 Difference]: Start difference. First operand has 179 places, 257 transitions, 3492 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:33:58,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 289 transitions, 4326 flow [2024-06-03 22:33:58,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 289 transitions, 4131 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-03 22:33:58,335 INFO L231 Difference]: Finished difference. Result has 181 places, 266 transitions, 3604 flow [2024-06-03 22:33:58,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3604, PETRI_PLACES=181, PETRI_TRANSITIONS=266} [2024-06-03 22:33:58,336 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places. [2024-06-03 22:33:58,336 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 266 transitions, 3604 flow [2024-06-03 22:33:58,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:58,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:58,336 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:33:58,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:33:58,337 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:33:58,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1234507668, now seen corresponding path program 1 times [2024-06-03 22:33:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639425531] [2024-06-03 22:33:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:05,432 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:34:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639425531] [2024-06-03 22:34:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639425531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:05,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:34:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34910484] [2024-06-03 22:34:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:05,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:34:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:34:05,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:34:05,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:05,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 266 transitions, 3604 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:05,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:05,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:05,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:07,081 INFO L124 PetriNetUnfolderBase]: 2765/4200 cut-off events. [2024-06-03 22:34:07,081 INFO L125 PetriNetUnfolderBase]: For 165561/165592 co-relation queries the response was YES. [2024-06-03 22:34:07,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31271 conditions, 4200 events. 2765/4200 cut-off events. For 165561/165592 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21333 event pairs, 461 based on Foata normal form. 28/4222 useless extension candidates. Maximal degree in co-relation 31180. Up to 2987 conditions per place. [2024-06-03 22:34:07,122 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 171 selfloop transitions, 130 changer transitions 0/304 dead transitions. [2024-06-03 22:34:07,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 304 transitions, 4568 flow [2024-06-03 22:34:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:34:07,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:34:07,125 INFO L175 Difference]: Start difference. First operand has 181 places, 266 transitions, 3604 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:34:07,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 304 transitions, 4568 flow [2024-06-03 22:34:07,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 304 transitions, 4507 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-03 22:34:07,294 INFO L231 Difference]: Finished difference. Result has 186 places, 268 transitions, 3887 flow [2024-06-03 22:34:07,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3887, PETRI_PLACES=186, PETRI_TRANSITIONS=268} [2024-06-03 22:34:07,295 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2024-06-03 22:34:07,295 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 268 transitions, 3887 flow [2024-06-03 22:34:07,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:07,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:07,295 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:34:07,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:34:07,295 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:34:07,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1475233200, now seen corresponding path program 2 times [2024-06-03 22:34:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:07,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993180664] [2024-06-03 22:34:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:14,527 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:34:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993180664] [2024-06-03 22:34:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993180664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:14,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:14,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:34:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980782356] [2024-06-03 22:34:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:34:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:14,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:34:14,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:34:14,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:14,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 268 transitions, 3887 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:14,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:14,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:14,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:16,217 INFO L124 PetriNetUnfolderBase]: 2807/4274 cut-off events. [2024-06-03 22:34:16,218 INFO L125 PetriNetUnfolderBase]: For 179356/179387 co-relation queries the response was YES. [2024-06-03 22:34:16,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32335 conditions, 4274 events. 2807/4274 cut-off events. For 179356/179387 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21900 event pairs, 566 based on Foata normal form. 36/4304 useless extension candidates. Maximal degree in co-relation 32242. Up to 3413 conditions per place. [2024-06-03 22:34:16,257 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 169 selfloop transitions, 128 changer transitions 0/300 dead transitions. [2024-06-03 22:34:16,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 300 transitions, 4661 flow [2024-06-03 22:34:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-03 22:34:16,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-03 22:34:16,259 INFO L175 Difference]: Start difference. First operand has 186 places, 268 transitions, 3887 flow. Second operand 8 states and 142 transitions. [2024-06-03 22:34:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 300 transitions, 4661 flow [2024-06-03 22:34:16,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 300 transitions, 4470 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 22:34:16,447 INFO L231 Difference]: Finished difference. Result has 190 places, 270 transitions, 4021 flow [2024-06-03 22:34:16,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3696, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4021, PETRI_PLACES=190, PETRI_TRANSITIONS=270} [2024-06-03 22:34:16,448 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places. [2024-06-03 22:34:16,448 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 270 transitions, 4021 flow [2024-06-03 22:34:16,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:16,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:16,449 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:34:16,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:34:16,449 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:34:16,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1469518908, now seen corresponding path program 4 times [2024-06-03 22:34:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308114115] [2024-06-03 22:34:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:23,345 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:34:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308114115] [2024-06-03 22:34:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308114115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:23,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:23,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064718089] [2024-06-03 22:34:23,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:23,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:23,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:23,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:23,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 270 transitions, 4021 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:34:23,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:23,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:23,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:25,133 INFO L124 PetriNetUnfolderBase]: 2799/4262 cut-off events. [2024-06-03 22:34:25,133 INFO L125 PetriNetUnfolderBase]: For 172965/172996 co-relation queries the response was YES. [2024-06-03 22:34:25,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32653 conditions, 4262 events. 2799/4262 cut-off events. For 172965/172996 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21855 event pairs, 564 based on Foata normal form. 16/4272 useless extension candidates. Maximal degree in co-relation 32558. Up to 3521 conditions per place. [2024-06-03 22:34:25,175 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 176 selfloop transitions, 119 changer transitions 0/298 dead transitions. [2024-06-03 22:34:25,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 298 transitions, 4771 flow [2024-06-03 22:34:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:34:25,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:34:25,178 INFO L175 Difference]: Start difference. First operand has 190 places, 270 transitions, 4021 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:34:25,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 298 transitions, 4771 flow [2024-06-03 22:34:25,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 298 transitions, 4478 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 22:34:25,400 INFO L231 Difference]: Finished difference. Result has 192 places, 272 transitions, 4037 flow [2024-06-03 22:34:25,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3728, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4037, PETRI_PLACES=192, PETRI_TRANSITIONS=272} [2024-06-03 22:34:25,401 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2024-06-03 22:34:25,401 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 272 transitions, 4037 flow [2024-06-03 22:34:25,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:34:25,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:25,401 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:34:25,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:34:25,402 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:34:25,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 662514652, now seen corresponding path program 5 times [2024-06-03 22:34:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487646406] [2024-06-03 22:34:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:32,044 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:34:32,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487646406] [2024-06-03 22:34:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487646406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:32,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093134298] [2024-06-03 22:34:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:32,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:32,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:32,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 272 transitions, 4037 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:34:32,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:32,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:33,843 INFO L124 PetriNetUnfolderBase]: 2791/4250 cut-off events. [2024-06-03 22:34:33,844 INFO L125 PetriNetUnfolderBase]: For 174605/174636 co-relation queries the response was YES. [2024-06-03 22:34:33,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32321 conditions, 4250 events. 2791/4250 cut-off events. For 174605/174636 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21733 event pairs, 562 based on Foata normal form. 16/4260 useless extension candidates. Maximal degree in co-relation 32225. Up to 3120 conditions per place. [2024-06-03 22:34:33,884 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 173 selfloop transitions, 128 changer transitions 0/304 dead transitions. [2024-06-03 22:34:33,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 304 transitions, 4821 flow [2024-06-03 22:34:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-03 22:34:33,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-03 22:34:33,885 INFO L175 Difference]: Start difference. First operand has 192 places, 272 transitions, 4037 flow. Second operand 8 states and 140 transitions. [2024-06-03 22:34:33,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 304 transitions, 4821 flow [2024-06-03 22:34:34,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 304 transitions, 4532 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-03 22:34:34,091 INFO L231 Difference]: Finished difference. Result has 194 places, 274 transitions, 4078 flow [2024-06-03 22:34:34,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3748, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4078, PETRI_PLACES=194, PETRI_TRANSITIONS=274} [2024-06-03 22:34:34,091 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2024-06-03 22:34:34,091 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 274 transitions, 4078 flow [2024-06-03 22:34:34,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:34:34,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:34,092 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:34:34,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:34:34,092 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:34:34,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -272161416, now seen corresponding path program 1 times [2024-06-03 22:34:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:34,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088722754] [2024-06-03 22:34:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:44,883 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:34:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:44,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088722754] [2024-06-03 22:34:44,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088722754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:44,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:44,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:34:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499102329] [2024-06-03 22:34:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:44,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:34:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:34:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:34:44,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:44,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 274 transitions, 4078 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:44,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:44,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:44,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:46,517 INFO L124 PetriNetUnfolderBase]: 2801/4259 cut-off events. [2024-06-03 22:34:46,517 INFO L125 PetriNetUnfolderBase]: For 180033/180041 co-relation queries the response was YES. [2024-06-03 22:34:46,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32722 conditions, 4259 events. 2801/4259 cut-off events. For 180033/180041 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21837 event pairs, 594 based on Foata normal form. 10/4267 useless extension candidates. Maximal degree in co-relation 32625. Up to 4167 conditions per place. [2024-06-03 22:34:46,557 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 260 selfloop transitions, 35 changer transitions 0/298 dead transitions. [2024-06-03 22:34:46,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 298 transitions, 4910 flow [2024-06-03 22:34:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:34:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:34:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:34:46,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:34:46,559 INFO L175 Difference]: Start difference. First operand has 194 places, 274 transitions, 4078 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:34:46,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 298 transitions, 4910 flow [2024-06-03 22:34:46,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 298 transitions, 4602 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-03 22:34:46,797 INFO L231 Difference]: Finished difference. Result has 195 places, 280 transitions, 3952 flow [2024-06-03 22:34:46,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3770, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3952, PETRI_PLACES=195, PETRI_TRANSITIONS=280} [2024-06-03 22:34:46,798 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 153 predicate places. [2024-06-03 22:34:46,798 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 280 transitions, 3952 flow [2024-06-03 22:34:46,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:46,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:46,798 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:34:46,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:34:46,799 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:34:46,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2101461564, now seen corresponding path program 2 times [2024-06-03 22:34:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:46,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208925260] [2024-06-03 22:34:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:57,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:34:57,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208925260] [2024-06-03 22:34:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208925260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:34:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351858800] [2024-06-03 22:34:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:57,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:34:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:57,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:34:57,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:34:57,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:57,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 280 transitions, 3952 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:57,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:57,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:57,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:58,995 INFO L124 PetriNetUnfolderBase]: 2795/4252 cut-off events. [2024-06-03 22:34:58,996 INFO L125 PetriNetUnfolderBase]: For 184356/184356 co-relation queries the response was YES. [2024-06-03 22:34:59,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32392 conditions, 4252 events. 2795/4252 cut-off events. For 184356/184356 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21771 event pairs, 575 based on Foata normal form. 2/4252 useless extension candidates. Maximal degree in co-relation 32294. Up to 4054 conditions per place. [2024-06-03 22:34:59,032 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 233 selfloop transitions, 62 changer transitions 0/298 dead transitions. [2024-06-03 22:34:59,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 298 transitions, 4686 flow [2024-06-03 22:34:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:34:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:34:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:34:59,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:34:59,034 INFO L175 Difference]: Start difference. First operand has 195 places, 280 transitions, 3952 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:34:59,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 298 transitions, 4686 flow [2024-06-03 22:34:59,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 298 transitions, 4625 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-03 22:34:59,196 INFO L231 Difference]: Finished difference. Result has 199 places, 280 transitions, 4021 flow [2024-06-03 22:34:59,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4021, PETRI_PLACES=199, PETRI_TRANSITIONS=280} [2024-06-03 22:34:59,197 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-03 22:34:59,197 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 280 transitions, 4021 flow [2024-06-03 22:34:59,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:59,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:59,198 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:34:59,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:34:59,198 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:34:59,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash -494334622, now seen corresponding path program 3 times [2024-06-03 22:34:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:59,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160379438] [2024-06-03 22:34:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:06,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:06,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160379438] [2024-06-03 22:35:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160379438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:06,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:35:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792071502] [2024-06-03 22:35:06,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:06,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:35:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:35:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:35:06,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:06,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 280 transitions, 4021 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:35:06,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:06,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:06,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:08,039 INFO L124 PetriNetUnfolderBase]: 2914/4457 cut-off events. [2024-06-03 22:35:08,039 INFO L125 PetriNetUnfolderBase]: For 217327/217358 co-relation queries the response was YES. [2024-06-03 22:35:08,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34384 conditions, 4457 events. 2914/4457 cut-off events. For 217327/217358 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23188 event pairs, 534 based on Foata normal form. 28/4479 useless extension candidates. Maximal degree in co-relation 34284. Up to 2496 conditions per place. [2024-06-03 22:35:08,089 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 191 selfloop transitions, 123 changer transitions 0/317 dead transitions. [2024-06-03 22:35:08,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 317 transitions, 5021 flow [2024-06-03 22:35:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 22:35:08,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-03 22:35:08,092 INFO L175 Difference]: Start difference. First operand has 199 places, 280 transitions, 4021 flow. Second operand 8 states and 143 transitions. [2024-06-03 22:35:08,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 317 transitions, 5021 flow [2024-06-03 22:35:08,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 317 transitions, 4923 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-03 22:35:08,336 INFO L231 Difference]: Finished difference. Result has 203 places, 282 transitions, 4261 flow [2024-06-03 22:35:08,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3923, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4261, PETRI_PLACES=203, PETRI_TRANSITIONS=282} [2024-06-03 22:35:08,337 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2024-06-03 22:35:08,337 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 282 transitions, 4261 flow [2024-06-03 22:35:08,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:35:08,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:08,337 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:35:08,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:35:08,337 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:35:08,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash -503531392, now seen corresponding path program 4 times [2024-06-03 22:35:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618391819] [2024-06-03 22:35:08,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:15,234 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:35:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618391819] [2024-06-03 22:35:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618391819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:35:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408061034] [2024-06-03 22:35:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:15,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:35:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:15,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:35:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:35:15,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:15,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 282 transitions, 4261 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:35:15,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:15,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:15,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:16,997 INFO L124 PetriNetUnfolderBase]: 3033/4658 cut-off events. [2024-06-03 22:35:16,997 INFO L125 PetriNetUnfolderBase]: For 244032/244063 co-relation queries the response was YES. [2024-06-03 22:35:17,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36769 conditions, 4658 events. 3033/4658 cut-off events. For 244032/244063 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24730 event pairs, 634 based on Foata normal form. 28/4680 useless extension candidates. Maximal degree in co-relation 36668. Up to 3465 conditions per place. [2024-06-03 22:35:17,042 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 201 selfloop transitions, 115 changer transitions 0/319 dead transitions. [2024-06-03 22:35:17,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 319 transitions, 5275 flow [2024-06-03 22:35:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:35:17,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:35:17,045 INFO L175 Difference]: Start difference. First operand has 203 places, 282 transitions, 4261 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:35:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 319 transitions, 5275 flow [2024-06-03 22:35:17,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 319 transitions, 5111 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-03 22:35:17,362 INFO L231 Difference]: Finished difference. Result has 207 places, 284 transitions, 4424 flow [2024-06-03 22:35:17,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4101, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4424, PETRI_PLACES=207, PETRI_TRANSITIONS=284} [2024-06-03 22:35:17,364 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2024-06-03 22:35:17,364 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 284 transitions, 4424 flow [2024-06-03 22:35:17,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:35:17,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:17,364 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:35:17,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:35:17,365 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:35:17,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash -760241152, now seen corresponding path program 5 times [2024-06-03 22:35:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941097328] [2024-06-03 22:35:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:24,467 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:35:24,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:24,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941097328] [2024-06-03 22:35:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941097328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:24,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336956324] [2024-06-03 22:35:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:24,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:24,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:24,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 284 transitions, 4424 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:35:24,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:24,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:24,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:26,434 INFO L124 PetriNetUnfolderBase]: 3058/4705 cut-off events. [2024-06-03 22:35:26,434 INFO L125 PetriNetUnfolderBase]: For 249957/249988 co-relation queries the response was YES. [2024-06-03 22:35:26,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37133 conditions, 4705 events. 3058/4705 cut-off events. For 249957/249988 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25077 event pairs, 650 based on Foata normal form. 32/4731 useless extension candidates. Maximal degree in co-relation 37030. Up to 3706 conditions per place. [2024-06-03 22:35:26,481 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 201 selfloop transitions, 115 changer transitions 0/319 dead transitions. [2024-06-03 22:35:26,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 319 transitions, 5240 flow [2024-06-03 22:35:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:35:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:35:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-03 22:35:26,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-03 22:35:26,495 INFO L175 Difference]: Start difference. First operand has 207 places, 284 transitions, 4424 flow. Second operand 9 states and 157 transitions. [2024-06-03 22:35:26,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 319 transitions, 5240 flow [2024-06-03 22:35:26,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 319 transitions, 5075 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 22:35:26,838 INFO L231 Difference]: Finished difference. Result has 212 places, 285 transitions, 4548 flow [2024-06-03 22:35:26,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4261, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4548, PETRI_PLACES=212, PETRI_TRANSITIONS=285} [2024-06-03 22:35:26,839 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2024-06-03 22:35:26,839 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 285 transitions, 4548 flow [2024-06-03 22:35:26,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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:35:26,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:26,839 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:35:26,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:35:26,839 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:35:26,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 824667898, now seen corresponding path program 3 times [2024-06-03 22:35:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091568963] [2024-06-03 22:35:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:37,223 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:35:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091568963] [2024-06-03 22:35:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091568963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:37,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:37,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:35:37,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096307077] [2024-06-03 22:35:37,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:37,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:35:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:35:37,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:35:37,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:37,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 285 transitions, 4548 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:37,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:37,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:37,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:39,017 INFO L124 PetriNetUnfolderBase]: 3025/4659 cut-off events. [2024-06-03 22:35:39,018 INFO L125 PetriNetUnfolderBase]: For 239309/239317 co-relation queries the response was YES. [2024-06-03 22:35:39,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37043 conditions, 4659 events. 3025/4659 cut-off events. For 239309/239317 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24903 event pairs, 666 based on Foata normal form. 15/4672 useless extension candidates. Maximal degree in co-relation 36938. Up to 4465 conditions per place. [2024-06-03 22:35:39,062 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 234 selfloop transitions, 69 changer transitions 0/306 dead transitions. [2024-06-03 22:35:39,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 306 transitions, 5236 flow [2024-06-03 22:35:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:35:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:35:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-03 22:35:39,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-03 22:35:39,063 INFO L175 Difference]: Start difference. First operand has 212 places, 285 transitions, 4548 flow. Second operand 6 states and 111 transitions. [2024-06-03 22:35:39,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 306 transitions, 5236 flow [2024-06-03 22:35:39,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 306 transitions, 4941 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-03 22:35:39,404 INFO L231 Difference]: Finished difference. Result has 210 places, 285 transitions, 4440 flow [2024-06-03 22:35:39,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4253, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4440, PETRI_PLACES=210, PETRI_TRANSITIONS=285} [2024-06-03 22:35:39,405 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places. [2024-06-03 22:35:39,405 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 285 transitions, 4440 flow [2024-06-03 22:35:39,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:39,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:39,405 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:35:39,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:35:39,405 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:35:39,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2071421620, now seen corresponding path program 2 times [2024-06-03 22:35:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:39,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661067398] [2024-06-03 22:35:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:50,026 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:35:50,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:50,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661067398] [2024-06-03 22:35:50,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661067398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:50,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:50,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:35:50,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148172429] [2024-06-03 22:35:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:50,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:35:50,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:50,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:35:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:35:50,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:50,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 285 transitions, 4440 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:50,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:50,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:50,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:51,770 INFO L124 PetriNetUnfolderBase]: 3019/4646 cut-off events. [2024-06-03 22:35:51,770 INFO L125 PetriNetUnfolderBase]: For 236833/236841 co-relation queries the response was YES. [2024-06-03 22:35:51,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36612 conditions, 4646 events. 3019/4646 cut-off events. For 236833/236841 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 24818 event pairs, 688 based on Foata normal form. 10/4654 useless extension candidates. Maximal degree in co-relation 36507. Up to 4570 conditions per place. [2024-06-03 22:35:51,816 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 267 selfloop transitions, 30 changer transitions 0/300 dead transitions. [2024-06-03 22:35:51,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 300 transitions, 5092 flow [2024-06-03 22:35:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:35:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:35:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 22:35:51,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:35:51,817 INFO L175 Difference]: Start difference. First operand has 210 places, 285 transitions, 4440 flow. Second operand 6 states and 102 transitions. [2024-06-03 22:35:51,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 300 transitions, 5092 flow [2024-06-03 22:35:52,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 300 transitions, 4971 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 22:35:52,127 INFO L231 Difference]: Finished difference. Result has 212 places, 285 transitions, 4385 flow [2024-06-03 22:35:52,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4319, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4385, PETRI_PLACES=212, PETRI_TRANSITIONS=285} [2024-06-03 22:35:52,127 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2024-06-03 22:35:52,127 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 285 transitions, 4385 flow [2024-06-03 22:35:52,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:52,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:52,128 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:35:52,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:35:52,128 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:35:52,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash -846974204, now seen corresponding path program 1 times [2024-06-03 22:35:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530608477] [2024-06-03 22:35:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:00,635 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:36:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530608477] [2024-06-03 22:36:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530608477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:36:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052349776] [2024-06-03 22:36:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:00,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:36:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:36:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:36:00,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:00,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 285 transitions, 4385 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:36:00,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:00,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:00,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:02,287 INFO L124 PetriNetUnfolderBase]: 3037/4671 cut-off events. [2024-06-03 22:36:02,287 INFO L125 PetriNetUnfolderBase]: For 246858/246870 co-relation queries the response was YES. [2024-06-03 22:36:02,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36916 conditions, 4671 events. 3037/4671 cut-off events. For 246858/246870 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24953 event pairs, 690 based on Foata normal form. 14/4682 useless extension candidates. Maximal degree in co-relation 36810. Up to 4480 conditions per place. [2024-06-03 22:36:02,343 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 269 selfloop transitions, 46 changer transitions 0/318 dead transitions. [2024-06-03 22:36:02,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 318 transitions, 5499 flow [2024-06-03 22:36:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:36:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:36:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:36:02,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-03 22:36:02,344 INFO L175 Difference]: Start difference. First operand has 212 places, 285 transitions, 4385 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:36:02,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 318 transitions, 5499 flow [2024-06-03 22:36:02,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 318 transitions, 5402 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 22:36:02,758 INFO L231 Difference]: Finished difference. Result has 215 places, 300 transitions, 4673 flow [2024-06-03 22:36:02,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4288, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4673, PETRI_PLACES=215, PETRI_TRANSITIONS=300} [2024-06-03 22:36:02,759 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-03 22:36:02,759 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 300 transitions, 4673 flow [2024-06-03 22:36:02,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:36:02,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:02,759 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:36:02,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:36:02,759 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:36:02,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -846854234, now seen corresponding path program 2 times [2024-06-03 22:36:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878732509] [2024-06-03 22:36:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:10,313 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:36:10,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878732509] [2024-06-03 22:36:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878732509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:10,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:36:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665018952] [2024-06-03 22:36:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:10,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:36:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:10,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:36:10,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:36:10,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:10,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 300 transitions, 4673 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:10,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:10,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:10,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:12,154 INFO L124 PetriNetUnfolderBase]: 3141/4821 cut-off events. [2024-06-03 22:36:12,155 INFO L125 PetriNetUnfolderBase]: For 270152/270152 co-relation queries the response was YES. [2024-06-03 22:36:12,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39172 conditions, 4821 events. 3141/4821 cut-off events. For 270152/270152 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25795 event pairs, 740 based on Foata normal form. 6/4825 useless extension candidates. Maximal degree in co-relation 39064. Up to 4698 conditions per place. [2024-06-03 22:36:12,204 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 306 selfloop transitions, 37 changer transitions 0/346 dead transitions. [2024-06-03 22:36:12,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 346 transitions, 5964 flow [2024-06-03 22:36:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:36:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:36:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-03 22:36:12,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:36:12,205 INFO L175 Difference]: Start difference. First operand has 215 places, 300 transitions, 4673 flow. Second operand 8 states and 128 transitions. [2024-06-03 22:36:12,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 346 transitions, 5964 flow [2024-06-03 22:36:12,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 346 transitions, 5809 flow, removed 69 selfloop flow, removed 2 redundant places. [2024-06-03 22:36:12,563 INFO L231 Difference]: Finished difference. Result has 223 places, 326 transitions, 5091 flow [2024-06-03 22:36:12,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5091, PETRI_PLACES=223, PETRI_TRANSITIONS=326} [2024-06-03 22:36:12,564 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places. [2024-06-03 22:36:12,564 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 326 transitions, 5091 flow [2024-06-03 22:36:12,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:12,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:12,564 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:36:12,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:36:12,564 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:36:12,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2043900316, now seen corresponding path program 3 times [2024-06-03 22:36:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593396152] [2024-06-03 22:36:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:20,378 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:36:20,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:20,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593396152] [2024-06-03 22:36:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593396152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:36:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466431355] [2024-06-03 22:36:20,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:20,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:36:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:20,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:36:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:36:20,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:20,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 326 transitions, 5091 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:36:20,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:20,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:20,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:22,212 INFO L124 PetriNetUnfolderBase]: 3232/4943 cut-off events. [2024-06-03 22:36:22,213 INFO L125 PetriNetUnfolderBase]: For 288463/288471 co-relation queries the response was YES. [2024-06-03 22:36:22,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41282 conditions, 4943 events. 3232/4943 cut-off events. For 288463/288471 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26468 event pairs, 705 based on Foata normal form. 14/4955 useless extension candidates. Maximal degree in co-relation 41170. Up to 4721 conditions per place. [2024-06-03 22:36:22,270 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 301 selfloop transitions, 68 changer transitions 0/372 dead transitions. [2024-06-03 22:36:22,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 372 transitions, 6418 flow [2024-06-03 22:36:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:36:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:36:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-03 22:36:22,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:36:22,272 INFO L175 Difference]: Start difference. First operand has 223 places, 326 transitions, 5091 flow. Second operand 7 states and 126 transitions. [2024-06-03 22:36:22,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 372 transitions, 6418 flow [2024-06-03 22:36:22,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 372 transitions, 6260 flow, removed 78 selfloop flow, removed 1 redundant places. [2024-06-03 22:36:22,737 INFO L231 Difference]: Finished difference. Result has 231 places, 348 transitions, 5588 flow [2024-06-03 22:36:22,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4933, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5588, PETRI_PLACES=231, PETRI_TRANSITIONS=348} [2024-06-03 22:36:22,738 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places. [2024-06-03 22:36:22,738 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 348 transitions, 5588 flow [2024-06-03 22:36:22,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:36:22,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:22,738 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:36:22,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:36:22,738 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:36:22,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2044146580, now seen corresponding path program 1 times [2024-06-03 22:36:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:22,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245823730] [2024-06-03 22:36:22,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:32,749 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:36:32,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245823730] [2024-06-03 22:36:32,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245823730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:32,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:32,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:36:32,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329618860] [2024-06-03 22:36:32,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:32,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:36:32,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:32,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:36:32,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:36:32,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:32,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 348 transitions, 5588 flow. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:32,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:32,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:34,573 INFO L124 PetriNetUnfolderBase]: 3227/4941 cut-off events. [2024-06-03 22:36:34,573 INFO L125 PetriNetUnfolderBase]: For 296488/296488 co-relation queries the response was YES. [2024-06-03 22:36:34,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41885 conditions, 4941 events. 3227/4941 cut-off events. For 296488/296488 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26373 event pairs, 762 based on Foata normal form. 2/4941 useless extension candidates. Maximal degree in co-relation 41768. Up to 4894 conditions per place. [2024-06-03 22:36:34,627 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 341 selfloop transitions, 14 changer transitions 0/358 dead transitions. [2024-06-03 22:36:34,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 358 transitions, 6362 flow [2024-06-03 22:36:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:36:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:36:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-03 22:36:34,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951219512195122 [2024-06-03 22:36:34,628 INFO L175 Difference]: Start difference. First operand has 231 places, 348 transitions, 5588 flow. Second operand 5 states and 81 transitions. [2024-06-03 22:36:34,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 358 transitions, 6362 flow [2024-06-03 22:36:35,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 358 transitions, 6215 flow, removed 68 selfloop flow, removed 2 redundant places. [2024-06-03 22:36:35,195 INFO L231 Difference]: Finished difference. Result has 234 places, 350 transitions, 5516 flow [2024-06-03 22:36:35,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5441, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5516, PETRI_PLACES=234, PETRI_TRANSITIONS=350} [2024-06-03 22:36:35,196 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-03 22:36:35,196 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 5516 flow [2024-06-03 22:36:35,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:35,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:35,197 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:36:35,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:36:35,197 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:36:35,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:35,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2068627935, now seen corresponding path program 1 times [2024-06-03 22:36:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:35,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822761640] [2024-06-03 22:36:35,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:43,311 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:36:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822761640] [2024-06-03 22:36:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822761640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:36:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960604649] [2024-06-03 22:36:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:43,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:36:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:43,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:36:43,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:36:43,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:43,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 350 transitions, 5516 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:36:43,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:43,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:43,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:45,319 INFO L124 PetriNetUnfolderBase]: 3207/4907 cut-off events. [2024-06-03 22:36:45,319 INFO L125 PetriNetUnfolderBase]: For 303655/303667 co-relation queries the response was YES. [2024-06-03 22:36:45,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41180 conditions, 4907 events. 3207/4907 cut-off events. For 303655/303667 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26096 event pairs, 502 based on Foata normal form. 24/4928 useless extension candidates. Maximal degree in co-relation 41061. Up to 4542 conditions per place. [2024-06-03 22:36:45,378 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 326 selfloop transitions, 55 changer transitions 0/384 dead transitions. [2024-06-03 22:36:45,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 384 transitions, 6402 flow [2024-06-03 22:36:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:36:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:36:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-03 22:36:45,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:36:45,380 INFO L175 Difference]: Start difference. First operand has 234 places, 350 transitions, 5516 flow. Second operand 9 states and 144 transitions. [2024-06-03 22:36:45,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 384 transitions, 6402 flow [2024-06-03 22:36:45,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 384 transitions, 6343 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 22:36:45,832 INFO L231 Difference]: Finished difference. Result has 240 places, 350 transitions, 5573 flow [2024-06-03 22:36:45,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5457, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5573, PETRI_PLACES=240, PETRI_TRANSITIONS=350} [2024-06-03 22:36:45,833 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-03 22:36:45,833 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 350 transitions, 5573 flow [2024-06-03 22:36:45,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:36:45,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:45,833 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:36:45,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:36:45,833 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:36:45,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -10979679, now seen corresponding path program 2 times [2024-06-03 22:36:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:45,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611100538] [2024-06-03 22:36:45,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:53,760 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:36:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611100538] [2024-06-03 22:36:53,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611100538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:53,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:53,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:36:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358984717] [2024-06-03 22:36:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:36:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:53,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:36:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:36:53,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:53,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 350 transitions, 5573 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:36:53,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:53,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:53,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:56,012 INFO L124 PetriNetUnfolderBase]: 3248/4976 cut-off events. [2024-06-03 22:36:56,012 INFO L125 PetriNetUnfolderBase]: For 316503/316545 co-relation queries the response was YES. [2024-06-03 22:36:56,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41983 conditions, 4976 events. 3248/4976 cut-off events. For 316503/316545 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26698 event pairs, 650 based on Foata normal form. 44/5016 useless extension candidates. Maximal degree in co-relation 41863. Up to 4465 conditions per place. [2024-06-03 22:36:56,063 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 305 selfloop transitions, 77 changer transitions 0/385 dead transitions. [2024-06-03 22:36:56,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 385 transitions, 6507 flow [2024-06-03 22:36:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:36:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:36:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-03 22:36:56,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-03 22:36:56,068 INFO L175 Difference]: Start difference. First operand has 240 places, 350 transitions, 5573 flow. Second operand 9 states and 147 transitions. [2024-06-03 22:36:56,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 385 transitions, 6507 flow [2024-06-03 22:36:56,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 385 transitions, 6284 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-03 22:36:56,561 INFO L231 Difference]: Finished difference. Result has 241 places, 351 transitions, 5556 flow [2024-06-03 22:36:56,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5351, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5556, PETRI_PLACES=241, PETRI_TRANSITIONS=351} [2024-06-03 22:36:56,562 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-03 22:36:56,562 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 351 transitions, 5556 flow [2024-06-03 22:36:56,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:36:56,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:56,562 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:36:56,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:36:56,562 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:36:56,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 792304123, now seen corresponding path program 3 times [2024-06-03 22:36:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317854984] [2024-06-03 22:36:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:04,444 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:37:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317854984] [2024-06-03 22:37:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317854984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:04,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:04,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:37:04,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303147394] [2024-06-03 22:37:04,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:04,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:37:04,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:04,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:37:04,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:37:04,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:04,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 351 transitions, 5556 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:37:04,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:04,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:04,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:06,407 INFO L124 PetriNetUnfolderBase]: 3228/4948 cut-off events. [2024-06-03 22:37:06,407 INFO L125 PetriNetUnfolderBase]: For 318423/318455 co-relation queries the response was YES. [2024-06-03 22:37:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40946 conditions, 4948 events. 3228/4948 cut-off events. For 318423/318455 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26443 event pairs, 635 based on Foata normal form. 23/4965 useless extension candidates. Maximal degree in co-relation 40826. Up to 4225 conditions per place. [2024-06-03 22:37:06,458 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 259 selfloop transitions, 118 changer transitions 0/380 dead transitions. [2024-06-03 22:37:06,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 380 transitions, 6431 flow [2024-06-03 22:37:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:37:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:37:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:37:06,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-03 22:37:06,461 INFO L175 Difference]: Start difference. First operand has 241 places, 351 transitions, 5556 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:37:06,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 380 transitions, 6431 flow [2024-06-03 22:37:06,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 380 transitions, 6221 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-03 22:37:06,982 INFO L231 Difference]: Finished difference. Result has 243 places, 352 transitions, 5617 flow [2024-06-03 22:37:06,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5346, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5617, PETRI_PLACES=243, PETRI_TRANSITIONS=352} [2024-06-03 22:37:06,983 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places. [2024-06-03 22:37:06,983 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 352 transitions, 5617 flow [2024-06-03 22:37:06,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:37:06,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:06,983 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:37:06,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:37:06,983 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:37:06,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash 201455432, now seen corresponding path program 1 times [2024-06-03 22:37:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:06,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653571329] [2024-06-03 22:37:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:17,974 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:37:17,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653571329] [2024-06-03 22:37:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653571329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:37:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767748220] [2024-06-03 22:37:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:17,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:37:17,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:17,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:37:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:37:18,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:18,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 352 transitions, 5617 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:37:18,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:18,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:18,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:20,042 INFO L124 PetriNetUnfolderBase]: 3248/4976 cut-off events. [2024-06-03 22:37:20,042 INFO L125 PetriNetUnfolderBase]: For 316735/316743 co-relation queries the response was YES. [2024-06-03 22:37:20,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41319 conditions, 4976 events. 3248/4976 cut-off events. For 316735/316743 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26726 event pairs, 670 based on Foata normal form. 12/4986 useless extension candidates. Maximal degree in co-relation 41197. Up to 4677 conditions per place. [2024-06-03 22:37:20,098 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 296 selfloop transitions, 86 changer transitions 0/385 dead transitions. [2024-06-03 22:37:20,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 385 transitions, 6691 flow [2024-06-03 22:37:20,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:37:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:37:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 22:37:20,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-03 22:37:20,101 INFO L175 Difference]: Start difference. First operand has 243 places, 352 transitions, 5617 flow. Second operand 8 states and 137 transitions. [2024-06-03 22:37:20,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 385 transitions, 6691 flow [2024-06-03 22:37:20,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 385 transitions, 6431 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 22:37:20,604 INFO L231 Difference]: Finished difference. Result has 245 places, 358 transitions, 5641 flow [2024-06-03 22:37:20,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5357, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5641, PETRI_PLACES=245, PETRI_TRANSITIONS=358} [2024-06-03 22:37:20,604 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places. [2024-06-03 22:37:20,605 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 358 transitions, 5641 flow [2024-06-03 22:37:20,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:37:20,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:20,605 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:37:20,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:37:20,605 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:37:20,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -726508483, now seen corresponding path program 1 times [2024-06-03 22:37:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653872995] [2024-06-03 22:37:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:28,706 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:37:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653872995] [2024-06-03 22:37:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653872995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:28,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:37:28,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554487409] [2024-06-03 22:37:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:28,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:37:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:28,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:37:28,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:37:28,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:28,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 358 transitions, 5641 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:37:28,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:28,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:28,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:30,552 INFO L124 PetriNetUnfolderBase]: 3261/4989 cut-off events. [2024-06-03 22:37:30,552 INFO L125 PetriNetUnfolderBase]: For 323969/323977 co-relation queries the response was YES. [2024-06-03 22:37:30,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41720 conditions, 4989 events. 3261/4989 cut-off events. For 323969/323977 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26709 event pairs, 688 based on Foata normal form. 9/4996 useless extension candidates. Maximal degree in co-relation 41597. Up to 4890 conditions per place. [2024-06-03 22:37:30,615 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 340 selfloop transitions, 41 changer transitions 0/384 dead transitions. [2024-06-03 22:37:30,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 384 transitions, 6713 flow [2024-06-03 22:37:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:37:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:37:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-03 22:37:30,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3604336043360434 [2024-06-03 22:37:30,616 INFO L175 Difference]: Start difference. First operand has 245 places, 358 transitions, 5641 flow. Second operand 9 states and 133 transitions. [2024-06-03 22:37:30,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 384 transitions, 6713 flow [2024-06-03 22:37:31,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 384 transitions, 6605 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-03 22:37:31,340 INFO L231 Difference]: Finished difference. Result has 250 places, 364 transitions, 5767 flow [2024-06-03 22:37:31,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5533, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5767, PETRI_PLACES=250, PETRI_TRANSITIONS=364} [2024-06-03 22:37:31,340 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places. [2024-06-03 22:37:31,340 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 364 transitions, 5767 flow [2024-06-03 22:37:31,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:37:31,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:31,340 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:37:31,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:37:31,341 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:37:31,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash -720794563, now seen corresponding path program 2 times [2024-06-03 22:37:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661210927] [2024-06-03 22:37:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:39,195 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:37:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661210927] [2024-06-03 22:37:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661210927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:37:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977015707] [2024-06-03 22:37:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:39,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:37:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:37:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:37:39,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:39,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 364 transitions, 5767 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:37:39,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:39,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:39,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:41,030 INFO L124 PetriNetUnfolderBase]: 3258/4985 cut-off events. [2024-06-03 22:37:41,030 INFO L125 PetriNetUnfolderBase]: For 332170/332178 co-relation queries the response was YES. [2024-06-03 22:37:41,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41768 conditions, 4985 events. 3258/4985 cut-off events. For 332170/332178 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26741 event pairs, 689 based on Foata normal form. 9/4992 useless extension candidates. Maximal degree in co-relation 41643. Up to 4920 conditions per place. [2024-06-03 22:37:41,091 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 350 selfloop transitions, 25 changer transitions 0/378 dead transitions. [2024-06-03 22:37:41,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 378 transitions, 6565 flow [2024-06-03 22:37:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:37:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:37:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-03 22:37:41,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37630662020905925 [2024-06-03 22:37:41,092 INFO L175 Difference]: Start difference. First operand has 250 places, 364 transitions, 5767 flow. Second operand 7 states and 108 transitions. [2024-06-03 22:37:41,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 378 transitions, 6565 flow [2024-06-03 22:37:41,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 378 transitions, 6444 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-06-03 22:37:41,693 INFO L231 Difference]: Finished difference. Result has 254 places, 364 transitions, 5702 flow [2024-06-03 22:37:41,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5702, PETRI_PLACES=254, PETRI_TRANSITIONS=364} [2024-06-03 22:37:41,693 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places. [2024-06-03 22:37:41,693 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 364 transitions, 5702 flow [2024-06-03 22:37:41,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:37:41,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:41,694 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:37:41,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:37:41,694 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:37:41,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash -197424701, now seen corresponding path program 4 times [2024-06-03 22:37:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:41,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549314086] [2024-06-03 22:37:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:49,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:37:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549314086] [2024-06-03 22:37:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549314086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:49,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:49,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:37:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102163918] [2024-06-03 22:37:49,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:49,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:37:49,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:49,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:37:49,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:37:49,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:49,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 364 transitions, 5702 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:49,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:49,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:49,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:51,746 INFO L124 PetriNetUnfolderBase]: 3238/4957 cut-off events. [2024-06-03 22:37:51,746 INFO L125 PetriNetUnfolderBase]: For 343166/343168 co-relation queries the response was YES. [2024-06-03 22:37:51,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41172 conditions, 4957 events. 3238/4957 cut-off events. For 343166/343168 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26491 event pairs, 623 based on Foata normal form. 14/4966 useless extension candidates. Maximal degree in co-relation 41045. Up to 4147 conditions per place. [2024-06-03 22:37:51,796 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 283 selfloop transitions, 112 changer transitions 0/398 dead transitions. [2024-06-03 22:37:51,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 398 transitions, 6633 flow [2024-06-03 22:37:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:37:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:37:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-03 22:37:51,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037940379403794 [2024-06-03 22:37:51,797 INFO L175 Difference]: Start difference. First operand has 254 places, 364 transitions, 5702 flow. Second operand 9 states and 149 transitions. [2024-06-03 22:37:51,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 398 transitions, 6633 flow [2024-06-03 22:37:52,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 398 transitions, 6571 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:37:52,465 INFO L231 Difference]: Finished difference. Result has 259 places, 365 transitions, 5908 flow [2024-06-03 22:37:52,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5640, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5908, PETRI_PLACES=259, PETRI_TRANSITIONS=365} [2024-06-03 22:37:52,465 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2024-06-03 22:37:52,465 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 365 transitions, 5908 flow [2024-06-03 22:37:52,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:52,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:52,466 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:37:52,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:37:52,466 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:37:52,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -633595960, now seen corresponding path program 2 times [2024-06-03 22:37:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519444196] [2024-06-03 22:37:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:04,287 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:38:04,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519444196] [2024-06-03 22:38:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519444196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214788476] [2024-06-03 22:38:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:04,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:04,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:04,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 365 transitions, 5908 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:38:04,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:04,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:04,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:06,360 INFO L124 PetriNetUnfolderBase]: 3290/5026 cut-off events. [2024-06-03 22:38:06,361 INFO L125 PetriNetUnfolderBase]: For 353836/353836 co-relation queries the response was YES. [2024-06-03 22:38:06,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42613 conditions, 5026 events. 3290/5026 cut-off events. For 353836/353836 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 26836 event pairs, 653 based on Foata normal form. 4/5028 useless extension candidates. Maximal degree in co-relation 42484. Up to 4699 conditions per place. [2024-06-03 22:38:06,422 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 305 selfloop transitions, 88 changer transitions 0/396 dead transitions. [2024-06-03 22:38:06,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 396 transitions, 7108 flow [2024-06-03 22:38:06,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:38:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:38:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:38:06,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:38:06,424 INFO L175 Difference]: Start difference. First operand has 259 places, 365 transitions, 5908 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:38:06,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 396 transitions, 7108 flow [2024-06-03 22:38:07,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 396 transitions, 6653 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-03 22:38:07,167 INFO L231 Difference]: Finished difference. Result has 259 places, 371 transitions, 5727 flow [2024-06-03 22:38:07,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5453, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5727, PETRI_PLACES=259, PETRI_TRANSITIONS=371} [2024-06-03 22:38:07,168 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2024-06-03 22:38:07,168 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 371 transitions, 5727 flow [2024-06-03 22:38:07,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:38:07,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:07,168 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:38:07,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:38:07,168 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:38:07,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1902230870, now seen corresponding path program 3 times [2024-06-03 22:38:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779834246] [2024-06-03 22:38:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:18,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:38:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779834246] [2024-06-03 22:38:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779834246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:18,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:18,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537210593] [2024-06-03 22:38:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:18,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:18,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:18,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:18,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 371 transitions, 5727 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:38:18,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:18,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:18,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:20,438 INFO L124 PetriNetUnfolderBase]: 3278/5010 cut-off events. [2024-06-03 22:38:20,439 INFO L125 PetriNetUnfolderBase]: For 354276/354276 co-relation queries the response was YES. [2024-06-03 22:38:20,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41162 conditions, 5010 events. 3278/5010 cut-off events. For 354276/354276 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26779 event pairs, 651 based on Foata normal form. 4/5012 useless extension candidates. Maximal degree in co-relation 41034. Up to 4691 conditions per place. [2024-06-03 22:38:20,502 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 302 selfloop transitions, 89 changer transitions 0/394 dead transitions. [2024-06-03 22:38:20,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 394 transitions, 6713 flow [2024-06-03 22:38:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:38:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:38:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-03 22:38:20,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-03 22:38:20,504 INFO L175 Difference]: Start difference. First operand has 259 places, 371 transitions, 5727 flow. Second operand 8 states and 133 transitions. [2024-06-03 22:38:20,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 394 transitions, 6713 flow [2024-06-03 22:38:21,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 394 transitions, 6551 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-03 22:38:21,136 INFO L231 Difference]: Finished difference. Result has 263 places, 371 transitions, 5749 flow [2024-06-03 22:38:21,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5565, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5749, PETRI_PLACES=263, PETRI_TRANSITIONS=371} [2024-06-03 22:38:21,136 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 221 predicate places. [2024-06-03 22:38:21,137 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 371 transitions, 5749 flow [2024-06-03 22:38:21,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:38:21,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:21,137 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:38:21,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:38:21,137 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:38:21,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash -483070665, now seen corresponding path program 3 times [2024-06-03 22:38:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:21,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092796567] [2024-06-03 22:38:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:21,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:29,380 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:38:29,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092796567] [2024-06-03 22:38:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092796567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415933034] [2024-06-03 22:38:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:29,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:29,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:29,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:29,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 371 transitions, 5749 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:38:29,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:29,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:29,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:31,243 INFO L124 PetriNetUnfolderBase]: 3280/5012 cut-off events. [2024-06-03 22:38:31,243 INFO L125 PetriNetUnfolderBase]: For 361340/361352 co-relation queries the response was YES. [2024-06-03 22:38:31,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41192 conditions, 5012 events. 3280/5012 cut-off events. For 361340/361352 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26785 event pairs, 682 based on Foata normal form. 14/5023 useless extension candidates. Maximal degree in co-relation 41063. Up to 4794 conditions per place. [2024-06-03 22:38:31,299 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 325 selfloop transitions, 67 changer transitions 0/395 dead transitions. [2024-06-03 22:38:31,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 395 transitions, 6934 flow [2024-06-03 22:38:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:38:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:38:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:38:31,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-03 22:38:31,300 INFO L175 Difference]: Start difference. First operand has 263 places, 371 transitions, 5749 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:38:31,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 395 transitions, 6934 flow [2024-06-03 22:38:31,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 395 transitions, 6748 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:38:31,886 INFO L231 Difference]: Finished difference. Result has 264 places, 378 transitions, 5864 flow [2024-06-03 22:38:31,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5563, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5864, PETRI_PLACES=264, PETRI_TRANSITIONS=378} [2024-06-03 22:38:31,887 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-03 22:38:31,887 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 378 transitions, 5864 flow [2024-06-03 22:38:31,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:38:31,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:31,887 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:38:31,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:38:31,887 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:38:31,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1763733503, now seen corresponding path program 4 times [2024-06-03 22:38:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38251477] [2024-06-03 22:38:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:39,830 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:38:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38251477] [2024-06-03 22:38:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38251477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:38:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733757457] [2024-06-03 22:38:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:39,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:38:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:39,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:38:39,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:38:40,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:40,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 378 transitions, 5864 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:38:40,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:40,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:40,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:41,670 INFO L124 PetriNetUnfolderBase]: 3256/4984 cut-off events. [2024-06-03 22:38:41,670 INFO L125 PetriNetUnfolderBase]: For 368620/368620 co-relation queries the response was YES. [2024-06-03 22:38:41,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40833 conditions, 4984 events. 3256/4984 cut-off events. For 368620/368620 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26722 event pairs, 724 based on Foata normal form. 6/4988 useless extension candidates. Maximal degree in co-relation 40702. Up to 4863 conditions per place. [2024-06-03 22:38:41,732 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 346 selfloop transitions, 46 changer transitions 0/395 dead transitions. [2024-06-03 22:38:41,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 395 transitions, 6724 flow [2024-06-03 22:38:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:38:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:38:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-03 22:38:41,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:38:41,733 INFO L175 Difference]: Start difference. First operand has 264 places, 378 transitions, 5864 flow. Second operand 8 states and 128 transitions. [2024-06-03 22:38:41,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 395 transitions, 6724 flow [2024-06-03 22:38:42,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 395 transitions, 6466 flow, removed 97 selfloop flow, removed 3 redundant places. [2024-06-03 22:38:42,431 INFO L231 Difference]: Finished difference. Result has 269 places, 378 transitions, 5712 flow [2024-06-03 22:38:42,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5606, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5712, PETRI_PLACES=269, PETRI_TRANSITIONS=378} [2024-06-03 22:38:42,431 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places. [2024-06-03 22:38:42,432 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 378 transitions, 5712 flow [2024-06-03 22:38:42,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:38:42,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:42,432 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:38:42,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:38:42,432 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:38:42,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1063606881, now seen corresponding path program 5 times [2024-06-03 22:38:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448940459] [2024-06-03 22:38:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:50,086 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:38:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448940459] [2024-06-03 22:38:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448940459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:38:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83597646] [2024-06-03 22:38:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:50,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:38:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:38:50,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:38:50,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:50,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 378 transitions, 5712 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:50,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:50,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:51,901 INFO L124 PetriNetUnfolderBase]: 3232/4946 cut-off events. [2024-06-03 22:38:51,901 INFO L125 PetriNetUnfolderBase]: For 365016/365024 co-relation queries the response was YES. [2024-06-03 22:38:51,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40044 conditions, 4946 events. 3232/4946 cut-off events. For 365016/365024 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26489 event pairs, 674 based on Foata normal form. 14/4958 useless extension candidates. Maximal degree in co-relation 39912. Up to 4736 conditions per place. [2024-06-03 22:38:51,960 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 334 selfloop transitions, 64 changer transitions 0/401 dead transitions. [2024-06-03 22:38:51,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 401 transitions, 6612 flow [2024-06-03 22:38:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:38:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:38:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 22:38:51,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 22:38:51,961 INFO L175 Difference]: Start difference. First operand has 269 places, 378 transitions, 5712 flow. Second operand 7 states and 125 transitions. [2024-06-03 22:38:51,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 401 transitions, 6612 flow [2024-06-03 22:38:52,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 401 transitions, 6424 flow, removed 45 selfloop flow, removed 7 redundant places. [2024-06-03 22:38:52,728 INFO L231 Difference]: Finished difference. Result has 270 places, 379 transitions, 5725 flow [2024-06-03 22:38:52,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5526, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5725, PETRI_PLACES=270, PETRI_TRANSITIONS=379} [2024-06-03 22:38:52,729 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places. [2024-06-03 22:38:52,729 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 379 transitions, 5725 flow [2024-06-03 22:38:52,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:52,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:52,729 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:38:52,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:38:52,730 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:38:52,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2092822025, now seen corresponding path program 5 times [2024-06-03 22:38:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153697410] [2024-06-03 22:38:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153697410] [2024-06-03 22:38:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153697410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:38:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202250136] [2024-06-03 22:38:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:59,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:38:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:38:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:00,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:00,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 379 transitions, 5725 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:39:00,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:00,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:00,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:01,928 INFO L124 PetriNetUnfolderBase]: 3212/4918 cut-off events. [2024-06-03 22:39:01,929 INFO L125 PetriNetUnfolderBase]: For 366800/366802 co-relation queries the response was YES. [2024-06-03 22:39:01,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39502 conditions, 4918 events. 3212/4918 cut-off events. For 366800/366802 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26233 event pairs, 621 based on Foata normal form. 14/4927 useless extension candidates. Maximal degree in co-relation 39368. Up to 4239 conditions per place. [2024-06-03 22:39:01,987 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 304 selfloop transitions, 99 changer transitions 0/406 dead transitions. [2024-06-03 22:39:01,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 406 transitions, 6553 flow [2024-06-03 22:39:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:39:01,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-03 22:39:01,989 INFO L175 Difference]: Start difference. First operand has 270 places, 379 transitions, 5725 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:39:01,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 406 transitions, 6553 flow [2024-06-03 22:39:02,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 406 transitions, 6422 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-03 22:39:02,722 INFO L231 Difference]: Finished difference. Result has 272 places, 378 transitions, 5712 flow [2024-06-03 22:39:02,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5510, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5712, PETRI_PLACES=272, PETRI_TRANSITIONS=378} [2024-06-03 22:39:02,723 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places. [2024-06-03 22:39:02,723 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 378 transitions, 5712 flow [2024-06-03 22:39:02,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:39:02,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:02,723 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:39:02,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:39:02,724 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:39:02,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash -205086924, now seen corresponding path program 4 times [2024-06-03 22:39:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:02,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699760639] [2024-06-03 22:39:02,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:13,363 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:39:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699760639] [2024-06-03 22:39:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699760639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:39:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079388554] [2024-06-03 22:39:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:13,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:39:13,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:13,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:39:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:39:13,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:13,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 378 transitions, 5712 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:39:13,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:13,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:13,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:15,207 INFO L124 PetriNetUnfolderBase]: 3232/4943 cut-off events. [2024-06-03 22:39:15,207 INFO L125 PetriNetUnfolderBase]: For 347003/347003 co-relation queries the response was YES. [2024-06-03 22:39:15,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39509 conditions, 4943 events. 3232/4943 cut-off events. For 347003/347003 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26347 event pairs, 633 based on Foata normal form. 4/4945 useless extension candidates. Maximal degree in co-relation 39375. Up to 4707 conditions per place. [2024-06-03 22:39:15,260 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 323 selfloop transitions, 76 changer transitions 0/402 dead transitions. [2024-06-03 22:39:15,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 402 transitions, 6763 flow [2024-06-03 22:39:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:39:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:39:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:39:15,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:39:15,261 INFO L175 Difference]: Start difference. First operand has 272 places, 378 transitions, 5712 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:39:15,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 402 transitions, 6763 flow [2024-06-03 22:39:15,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 402 transitions, 6543 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:39:15,870 INFO L231 Difference]: Finished difference. Result has 273 places, 381 transitions, 5699 flow [2024-06-03 22:39:15,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5492, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5699, PETRI_PLACES=273, PETRI_TRANSITIONS=381} [2024-06-03 22:39:15,871 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-03 22:39:15,871 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 381 transitions, 5699 flow [2024-06-03 22:39:15,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:39:15,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:15,871 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:39:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:39:15,871 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:39:15,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -210449898, now seen corresponding path program 5 times [2024-06-03 22:39:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809744229] [2024-06-03 22:39:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:27,301 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:39:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809744229] [2024-06-03 22:39:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809744229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:39:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131554751] [2024-06-03 22:39:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:27,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:39:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:39:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:39:27,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:27,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 381 transitions, 5699 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:39:27,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:27,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:27,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:29,153 INFO L124 PetriNetUnfolderBase]: 3220/4931 cut-off events. [2024-06-03 22:39:29,154 INFO L125 PetriNetUnfolderBase]: For 348608/348616 co-relation queries the response was YES. [2024-06-03 22:39:29,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39078 conditions, 4931 events. 3220/4931 cut-off events. For 348608/348616 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 26414 event pairs, 636 based on Foata normal form. 12/4941 useless extension candidates. Maximal degree in co-relation 38943. Up to 4699 conditions per place. [2024-06-03 22:39:29,213 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 321 selfloop transitions, 81 changer transitions 0/405 dead transitions. [2024-06-03 22:39:29,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 405 transitions, 6603 flow [2024-06-03 22:39:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:39:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:39:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 22:39:29,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:39:29,214 INFO L175 Difference]: Start difference. First operand has 273 places, 381 transitions, 5699 flow. Second operand 7 states and 123 transitions. [2024-06-03 22:39:29,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 405 transitions, 6603 flow [2024-06-03 22:39:29,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 405 transitions, 6335 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-03 22:39:29,923 INFO L231 Difference]: Finished difference. Result has 275 places, 381 transitions, 5600 flow [2024-06-03 22:39:29,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5431, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5600, PETRI_PLACES=275, PETRI_TRANSITIONS=381} [2024-06-03 22:39:29,923 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places. [2024-06-03 22:39:29,923 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 381 transitions, 5600 flow [2024-06-03 22:39:29,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:39:29,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:29,924 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:39:29,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:39:29,924 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:39:29,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash -486486059, now seen corresponding path program 1 times [2024-06-03 22:39:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039879521] [2024-06-03 22:39:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:38,585 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:39:38,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039879521] [2024-06-03 22:39:38,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039879521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:38,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:38,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644899430] [2024-06-03 22:39:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:38,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:38,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:38,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:38,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 381 transitions, 5600 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:39:38,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:38,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:38,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:40,454 INFO L124 PetriNetUnfolderBase]: 3238/4952 cut-off events. [2024-06-03 22:39:40,455 INFO L125 PetriNetUnfolderBase]: For 354578/354617 co-relation queries the response was YES. [2024-06-03 22:39:40,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39333 conditions, 4952 events. 3238/4952 cut-off events. For 354578/354617 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 26433 event pairs, 655 based on Foata normal form. 32/4980 useless extension candidates. Maximal degree in co-relation 39197. Up to 4696 conditions per place. [2024-06-03 22:39:40,511 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 321 selfloop transitions, 89 changer transitions 0/413 dead transitions. [2024-06-03 22:39:40,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 413 transitions, 7004 flow [2024-06-03 22:39:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:39:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:39:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-03 22:39:40,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2024-06-03 22:39:40,513 INFO L175 Difference]: Start difference. First operand has 275 places, 381 transitions, 5600 flow. Second operand 10 states and 155 transitions. [2024-06-03 22:39:40,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 413 transitions, 7004 flow [2024-06-03 22:39:40,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 413 transitions, 6775 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 22:39:40,966 INFO L231 Difference]: Finished difference. Result has 278 places, 389 transitions, 5701 flow [2024-06-03 22:39:40,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5371, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5701, PETRI_PLACES=278, PETRI_TRANSITIONS=389} [2024-06-03 22:39:40,966 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 236 predicate places. [2024-06-03 22:39:40,966 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 389 transitions, 5701 flow [2024-06-03 22:39:40,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:39:40,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:40,967 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:39:40,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:39:40,967 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:39:40,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash 477318202, now seen corresponding path program 1 times [2024-06-03 22:39:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286712161] [2024-06-03 22:39:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:49,079 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:39:49,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:49,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286712161] [2024-06-03 22:39:49,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286712161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:49,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:49,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:39:49,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846508278] [2024-06-03 22:39:49,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:49,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:39:49,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:39:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:39:49,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:49,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 389 transitions, 5701 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:39:49,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:49,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:49,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:50,888 INFO L124 PetriNetUnfolderBase]: 3298/5034 cut-off events. [2024-06-03 22:39:50,888 INFO L125 PetriNetUnfolderBase]: For 378827/378839 co-relation queries the response was YES. [2024-06-03 22:39:50,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41131 conditions, 5034 events. 3298/5034 cut-off events. For 378827/378839 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26879 event pairs, 640 based on Foata normal form. 16/5047 useless extension candidates. Maximal degree in co-relation 40994. Up to 4618 conditions per place. [2024-06-03 22:39:50,943 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 316 selfloop transitions, 109 changer transitions 0/428 dead transitions. [2024-06-03 22:39:50,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 428 transitions, 7227 flow [2024-06-03 22:39:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:39:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:39:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-03 22:39:50,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:39:50,944 INFO L175 Difference]: Start difference. First operand has 278 places, 389 transitions, 5701 flow. Second operand 9 states and 144 transitions. [2024-06-03 22:39:50,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 428 transitions, 7227 flow [2024-06-03 22:39:51,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 428 transitions, 7034 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-03 22:39:51,501 INFO L231 Difference]: Finished difference. Result has 283 places, 406 transitions, 6181 flow [2024-06-03 22:39:51,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5508, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6181, PETRI_PLACES=283, PETRI_TRANSITIONS=406} [2024-06-03 22:39:51,501 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places. [2024-06-03 22:39:51,502 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 406 transitions, 6181 flow [2024-06-03 22:39:51,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:39:51,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:51,502 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:39:51,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:39:51,502 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:39:51,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 481037117, now seen corresponding path program 2 times [2024-06-03 22:39:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:51,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652853502] [2024-06-03 22:39:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:00,153 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:40:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:00,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652853502] [2024-06-03 22:40:00,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652853502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:00,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:40:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136435962] [2024-06-03 22:40:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:00,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:40:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:00,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:40:00,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:40:00,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:00,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 406 transitions, 6181 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:00,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:00,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:00,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:02,249 INFO L124 PetriNetUnfolderBase]: 3514/5339 cut-off events. [2024-06-03 22:40:02,249 INFO L125 PetriNetUnfolderBase]: For 449490/449490 co-relation queries the response was YES. [2024-06-03 22:40:02,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45800 conditions, 5339 events. 3514/5339 cut-off events. For 449490/449490 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28543 event pairs, 702 based on Foata normal form. 12/5349 useless extension candidates. Maximal degree in co-relation 45659. Up to 5040 conditions per place. [2024-06-03 22:40:02,307 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 384 selfloop transitions, 62 changer transitions 0/449 dead transitions. [2024-06-03 22:40:02,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 449 transitions, 7791 flow [2024-06-03 22:40:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:40:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:40:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-03 22:40:02,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037940379403794 [2024-06-03 22:40:02,308 INFO L175 Difference]: Start difference. First operand has 283 places, 406 transitions, 6181 flow. Second operand 9 states and 149 transitions. [2024-06-03 22:40:02,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 449 transitions, 7791 flow [2024-06-03 22:40:03,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 449 transitions, 7625 flow, removed 74 selfloop flow, removed 3 redundant places. [2024-06-03 22:40:03,007 INFO L231 Difference]: Finished difference. Result has 290 places, 425 transitions, 6547 flow [2024-06-03 22:40:03,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6029, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6547, PETRI_PLACES=290, PETRI_TRANSITIONS=425} [2024-06-03 22:40:03,007 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places. [2024-06-03 22:40:03,007 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 425 transitions, 6547 flow [2024-06-03 22:40:03,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:03,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:03,007 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:40:03,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:40:03,007 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:40:03,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 481037272, now seen corresponding path program 2 times [2024-06-03 22:40:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880260037] [2024-06-03 22:40:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880260037] [2024-06-03 22:40:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880260037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:11,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:11,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:40:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086897322] [2024-06-03 22:40:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:11,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:40:11,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:11,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:40:11,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:40:11,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:11,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 425 transitions, 6547 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:11,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:11,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:11,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:13,269 INFO L124 PetriNetUnfolderBase]: 3582/5433 cut-off events. [2024-06-03 22:40:13,269 INFO L125 PetriNetUnfolderBase]: For 463048/463048 co-relation queries the response was YES. [2024-06-03 22:40:13,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47942 conditions, 5433 events. 3582/5433 cut-off events. For 463048/463048 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29093 event pairs, 721 based on Foata normal form. 4/5435 useless extension candidates. Maximal degree in co-relation 47798. Up to 5265 conditions per place. [2024-06-03 22:40:13,456 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 397 selfloop transitions, 57 changer transitions 0/457 dead transitions. [2024-06-03 22:40:13,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 457 transitions, 8076 flow [2024-06-03 22:40:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:40:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:40:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-03 22:40:13,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-03 22:40:13,457 INFO L175 Difference]: Start difference. First operand has 290 places, 425 transitions, 6547 flow. Second operand 9 states and 142 transitions. [2024-06-03 22:40:13,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 457 transitions, 8076 flow [2024-06-03 22:40:14,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 457 transitions, 7861 flow, removed 89 selfloop flow, removed 4 redundant places. [2024-06-03 22:40:14,062 INFO L231 Difference]: Finished difference. Result has 296 places, 436 transitions, 6750 flow [2024-06-03 22:40:14,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6332, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6750, PETRI_PLACES=296, PETRI_TRANSITIONS=436} [2024-06-03 22:40:14,063 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places. [2024-06-03 22:40:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 436 transitions, 6750 flow [2024-06-03 22:40:14,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:14,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:14,063 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:40:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:40:14,063 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:40:14,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -38484900, now seen corresponding path program 3 times [2024-06-03 22:40:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883746207] [2024-06-03 22:40:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:21,568 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:40:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883746207] [2024-06-03 22:40:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883746207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:21,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:40:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478586755] [2024-06-03 22:40:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:21,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:40:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:40:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:40:21,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:21,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 436 transitions, 6750 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:40:21,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:21,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:21,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:23,586 INFO L124 PetriNetUnfolderBase]: 3638/5511 cut-off events. [2024-06-03 22:40:23,586 INFO L125 PetriNetUnfolderBase]: For 483212/483212 co-relation queries the response was YES. [2024-06-03 22:40:23,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48957 conditions, 5511 events. 3638/5511 cut-off events. For 483212/483212 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29517 event pairs, 729 based on Foata normal form. 4/5513 useless extension candidates. Maximal degree in co-relation 48810. Up to 5367 conditions per place. [2024-06-03 22:40:23,661 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 416 selfloop transitions, 43 changer transitions 0/462 dead transitions. [2024-06-03 22:40:23,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 462 transitions, 8097 flow [2024-06-03 22:40:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:40:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:40:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-03 22:40:23,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2024-06-03 22:40:23,663 INFO L175 Difference]: Start difference. First operand has 296 places, 436 transitions, 6750 flow. Second operand 8 states and 124 transitions. [2024-06-03 22:40:23,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 462 transitions, 8097 flow [2024-06-03 22:40:24,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 462 transitions, 7954 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-03 22:40:24,719 INFO L231 Difference]: Finished difference. Result has 301 places, 444 transitions, 6948 flow [2024-06-03 22:40:24,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6607, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6948, PETRI_PLACES=301, PETRI_TRANSITIONS=444} [2024-06-03 22:40:24,719 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-03 22:40:24,720 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 444 transitions, 6948 flow [2024-06-03 22:40:24,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:40:24,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:24,720 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:40:24,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:40:24,720 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:40:24,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1063598790, now seen corresponding path program 4 times [2024-06-03 22:40:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:24,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972199975] [2024-06-03 22:40:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:32,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972199975] [2024-06-03 22:40:32,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972199975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:32,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:40:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908065285] [2024-06-03 22:40:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:32,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:40:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:40:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:40:32,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:32,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 444 transitions, 6948 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:40:32,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:32,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:32,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:34,225 INFO L124 PetriNetUnfolderBase]: 3690/5578 cut-off events. [2024-06-03 22:40:34,225 INFO L125 PetriNetUnfolderBase]: For 505429/505437 co-relation queries the response was YES. [2024-06-03 22:40:34,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50322 conditions, 5578 events. 3690/5578 cut-off events. For 505429/505437 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 29833 event pairs, 720 based on Foata normal form. 12/5588 useless extension candidates. Maximal degree in co-relation 50172. Up to 5267 conditions per place. [2024-06-03 22:40:34,291 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 389 selfloop transitions, 89 changer transitions 0/481 dead transitions. [2024-06-03 22:40:34,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 481 transitions, 8571 flow [2024-06-03 22:40:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:40:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:40:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:40:34,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:40:34,292 INFO L175 Difference]: Start difference. First operand has 301 places, 444 transitions, 6948 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:40:34,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 481 transitions, 8571 flow [2024-06-03 22:40:35,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 481 transitions, 8339 flow, removed 64 selfloop flow, removed 5 redundant places. [2024-06-03 22:40:35,395 INFO L231 Difference]: Finished difference. Result has 306 places, 455 transitions, 7282 flow [2024-06-03 22:40:35,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6716, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7282, PETRI_PLACES=306, PETRI_TRANSITIONS=455} [2024-06-03 22:40:35,396 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places. [2024-06-03 22:40:35,396 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 455 transitions, 7282 flow [2024-06-03 22:40:35,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:40:35,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:35,396 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:40:35,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:40:35,396 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:40:35,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1063598945, now seen corresponding path program 3 times [2024-06-03 22:40:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:35,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028750860] [2024-06-03 22:40:35,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:35,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:43,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028750860] [2024-06-03 22:40:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028750860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:43,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:40:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061095790] [2024-06-03 22:40:43,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:43,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:40:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:40:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:40:44,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:44,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 455 transitions, 7282 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:44,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:44,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:44,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:46,171 INFO L124 PetriNetUnfolderBase]: 3734/5640 cut-off events. [2024-06-03 22:40:46,171 INFO L125 PetriNetUnfolderBase]: For 531297/531305 co-relation queries the response was YES. [2024-06-03 22:40:46,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51148 conditions, 5640 events. 3734/5640 cut-off events. For 531297/531305 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30232 event pairs, 723 based on Foata normal form. 16/5654 useless extension candidates. Maximal degree in co-relation 50997. Up to 5356 conditions per place. [2024-06-03 22:40:46,241 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 396 selfloop transitions, 99 changer transitions 0/498 dead transitions. [2024-06-03 22:40:46,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 498 transitions, 8878 flow [2024-06-03 22:40:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:40:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:40:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:40:46,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:40:46,243 INFO L175 Difference]: Start difference. First operand has 306 places, 455 transitions, 7282 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:40:46,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 498 transitions, 8878 flow [2024-06-03 22:40:47,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 498 transitions, 8731 flow, removed 68 selfloop flow, removed 2 redundant places. [2024-06-03 22:40:47,217 INFO L231 Difference]: Finished difference. Result has 314 places, 470 transitions, 7805 flow [2024-06-03 22:40:47,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7135, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7805, PETRI_PLACES=314, PETRI_TRANSITIONS=470} [2024-06-03 22:40:47,217 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 272 predicate places. [2024-06-03 22:40:47,217 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 470 transitions, 7805 flow [2024-06-03 22:40:47,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:47,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:47,218 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:40:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:40:47,218 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:40:47,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1162515711, now seen corresponding path program 1 times [2024-06-03 22:40:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:47,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345360517] [2024-06-03 22:40:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:55,568 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:40:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345360517] [2024-06-03 22:40:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345360517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:40:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103661899] [2024-06-03 22:40:55,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:55,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:40:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:55,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:40:55,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:40:55,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:55,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 470 transitions, 7805 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:55,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:55,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:55,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:57,741 INFO L124 PetriNetUnfolderBase]: 3760/5676 cut-off events. [2024-06-03 22:40:57,741 INFO L125 PetriNetUnfolderBase]: For 554925/554933 co-relation queries the response was YES. [2024-06-03 22:40:57,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52834 conditions, 5676 events. 3760/5676 cut-off events. For 554925/554933 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 30337 event pairs, 683 based on Foata normal form. 10/5684 useless extension candidates. Maximal degree in co-relation 52679. Up to 5367 conditions per place. [2024-06-03 22:40:57,814 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 425 selfloop transitions, 82 changer transitions 0/510 dead transitions. [2024-06-03 22:40:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 510 transitions, 9241 flow [2024-06-03 22:40:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:40:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:40:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-03 22:40:57,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-03 22:40:57,815 INFO L175 Difference]: Start difference. First operand has 314 places, 470 transitions, 7805 flow. Second operand 8 states and 133 transitions. [2024-06-03 22:40:57,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 510 transitions, 9241 flow [2024-06-03 22:40:58,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 510 transitions, 9018 flow, removed 94 selfloop flow, removed 3 redundant places. [2024-06-03 22:40:58,781 INFO L231 Difference]: Finished difference. Result has 321 places, 484 transitions, 8008 flow [2024-06-03 22:40:58,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7582, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8008, PETRI_PLACES=321, PETRI_TRANSITIONS=484} [2024-06-03 22:40:58,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 279 predicate places. [2024-06-03 22:40:58,782 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 484 transitions, 8008 flow [2024-06-03 22:40:58,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:40:58,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:58,782 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:40:58,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:40:58,782 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:40:58,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1156801791, now seen corresponding path program 2 times [2024-06-03 22:40:58,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659545985] [2024-06-03 22:40:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:58,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:06,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:41:06,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:06,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659545985] [2024-06-03 22:41:06,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659545985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:06,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:06,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:41:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698175024] [2024-06-03 22:41:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:06,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:41:06,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:06,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:41:06,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:41:06,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:06,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 484 transitions, 8008 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:41:06,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:06,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:06,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:09,055 INFO L124 PetriNetUnfolderBase]: 3770/5692 cut-off events. [2024-06-03 22:41:09,055 INFO L125 PetriNetUnfolderBase]: For 573365/573373 co-relation queries the response was YES. [2024-06-03 22:41:09,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53939 conditions, 5692 events. 3770/5692 cut-off events. For 573365/573373 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30501 event pairs, 696 based on Foata normal form. 10/5700 useless extension candidates. Maximal degree in co-relation 53780. Up to 5490 conditions per place. [2024-06-03 22:41:09,133 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 439 selfloop transitions, 67 changer transitions 0/509 dead transitions. [2024-06-03 22:41:09,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 509 transitions, 9178 flow [2024-06-03 22:41:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-03 22:41:09,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-03 22:41:09,134 INFO L175 Difference]: Start difference. First operand has 321 places, 484 transitions, 8008 flow. Second operand 8 states and 127 transitions. [2024-06-03 22:41:09,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 509 transitions, 9178 flow [2024-06-03 22:41:10,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 509 transitions, 9053 flow, removed 58 selfloop flow, removed 2 redundant places. [2024-06-03 22:41:10,222 INFO L231 Difference]: Finished difference. Result has 327 places, 488 transitions, 8111 flow [2024-06-03 22:41:10,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7909, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8111, PETRI_PLACES=327, PETRI_TRANSITIONS=488} [2024-06-03 22:41:10,223 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 285 predicate places. [2024-06-03 22:41:10,223 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 488 transitions, 8111 flow [2024-06-03 22:41:10,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:41:10,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:10,223 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:41:10,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:41:10,223 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:41:10,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash 864570977, now seen corresponding path program 1 times [2024-06-03 22:41:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:10,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559351408] [2024-06-03 22:41:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:21,164 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:41:21,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:21,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559351408] [2024-06-03 22:41:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559351408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:21,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:21,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:41:21,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809893179] [2024-06-03 22:41:21,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:21,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:41:21,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:41:21,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:41:21,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:21,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 488 transitions, 8111 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:41:21,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:21,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:21,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:23,466 INFO L124 PetriNetUnfolderBase]: 3778/5707 cut-off events. [2024-06-03 22:41:23,466 INFO L125 PetriNetUnfolderBase]: For 587829/587837 co-relation queries the response was YES. [2024-06-03 22:41:23,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54274 conditions, 5707 events. 3778/5707 cut-off events. For 587829/587837 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30604 event pairs, 576 based on Foata normal form. 10/5715 useless extension candidates. Maximal degree in co-relation 54113. Up to 5410 conditions per place. [2024-06-03 22:41:23,550 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 453 selfloop transitions, 62 changer transitions 0/518 dead transitions. [2024-06-03 22:41:23,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 518 transitions, 9461 flow [2024-06-03 22:41:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:41:23,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:41:23,552 INFO L175 Difference]: Start difference. First operand has 327 places, 488 transitions, 8111 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:41:23,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 518 transitions, 9461 flow [2024-06-03 22:41:24,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 518 transitions, 9305 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 22:41:24,638 INFO L231 Difference]: Finished difference. Result has 330 places, 492 transitions, 8177 flow [2024-06-03 22:41:24,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7955, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8177, PETRI_PLACES=330, PETRI_TRANSITIONS=492} [2024-06-03 22:41:24,638 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 288 predicate places. [2024-06-03 22:41:24,639 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 492 transitions, 8177 flow [2024-06-03 22:41:24,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:41:24,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:24,639 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:41:24,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:41:24,639 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:41:24,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash 864809987, now seen corresponding path program 2 times [2024-06-03 22:41:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484930809] [2024-06-03 22:41:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:36,059 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:41:36,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:36,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484930809] [2024-06-03 22:41:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484930809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:36,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:36,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:41:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071870263] [2024-06-03 22:41:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:36,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:41:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:41:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:41:36,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:36,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 492 transitions, 8177 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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:41:36,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:36,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:36,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:38,341 INFO L124 PetriNetUnfolderBase]: 3786/5719 cut-off events. [2024-06-03 22:41:38,341 INFO L125 PetriNetUnfolderBase]: For 603824/603832 co-relation queries the response was YES. [2024-06-03 22:41:38,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54660 conditions, 5719 events. 3786/5719 cut-off events. For 603824/603832 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30791 event pairs, 704 based on Foata normal form. 10/5727 useless extension candidates. Maximal degree in co-relation 54498. Up to 5514 conditions per place. [2024-06-03 22:41:38,417 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 444 selfloop transitions, 68 changer transitions 0/515 dead transitions. [2024-06-03 22:41:38,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 515 transitions, 9321 flow [2024-06-03 22:41:38,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-03 22:41:38,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-03 22:41:38,419 INFO L175 Difference]: Start difference. First operand has 330 places, 492 transitions, 8177 flow. Second operand 8 states and 127 transitions. [2024-06-03 22:41:38,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 515 transitions, 9321 flow [2024-06-03 22:41:39,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 515 transitions, 9171 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-03 22:41:39,324 INFO L231 Difference]: Finished difference. Result has 334 places, 494 transitions, 8220 flow [2024-06-03 22:41:39,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8051, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8220, PETRI_PLACES=334, PETRI_TRANSITIONS=494} [2024-06-03 22:41:39,325 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places. [2024-06-03 22:41:39,325 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 494 transitions, 8220 flow [2024-06-03 22:41:39,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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:41:39,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:39,325 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:41:39,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:41:39,326 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:41:39,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -210946559, now seen corresponding path program 3 times [2024-06-03 22:41:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124140502] [2024-06-03 22:41:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:47,662 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:41:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124140502] [2024-06-03 22:41:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124140502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:47,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:47,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:41:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858638176] [2024-06-03 22:41:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:47,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:41:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:41:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:41:47,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:47,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 494 transitions, 8220 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:41:47,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:47,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:47,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:49,893 INFO L124 PetriNetUnfolderBase]: 3820/5762 cut-off events. [2024-06-03 22:41:49,893 INFO L125 PetriNetUnfolderBase]: For 628293/628293 co-relation queries the response was YES. [2024-06-03 22:41:49,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55582 conditions, 5762 events. 3820/5762 cut-off events. For 628293/628293 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30906 event pairs, 694 based on Foata normal form. 2/5762 useless extension candidates. Maximal degree in co-relation 55418. Up to 5274 conditions per place. [2024-06-03 22:41:49,977 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 411 selfloop transitions, 115 changer transitions 0/529 dead transitions. [2024-06-03 22:41:49,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 529 transitions, 9886 flow [2024-06-03 22:41:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-03 22:41:49,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-03 22:41:49,978 INFO L175 Difference]: Start difference. First operand has 334 places, 494 transitions, 8220 flow. Second operand 8 states and 134 transitions. [2024-06-03 22:41:49,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 529 transitions, 9886 flow [2024-06-03 22:41:51,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 529 transitions, 9737 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:41:51,307 INFO L231 Difference]: Finished difference. Result has 336 places, 503 transitions, 8537 flow [2024-06-03 22:41:51,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8071, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8537, PETRI_PLACES=336, PETRI_TRANSITIONS=503} [2024-06-03 22:41:51,308 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 294 predicate places. [2024-06-03 22:41:51,308 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 503 transitions, 8537 flow [2024-06-03 22:41:51,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:41:51,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:51,308 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:41:51,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:41:51,308 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:41:51,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 983020799, now seen corresponding path program 1 times [2024-06-03 22:41:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009798638] [2024-06-03 22:41:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:59,326 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:41:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009798638] [2024-06-03 22:41:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009798638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:59,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:41:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199386050] [2024-06-03 22:41:59,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:59,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:41:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:59,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:41:59,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:41:59,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:59,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 503 transitions, 8537 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:41:59,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:59,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:59,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:01,743 INFO L124 PetriNetUnfolderBase]: 3825/5768 cut-off events. [2024-06-03 22:42:01,744 INFO L125 PetriNetUnfolderBase]: For 643854/643862 co-relation queries the response was YES. [2024-06-03 22:42:01,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56380 conditions, 5768 events. 3825/5768 cut-off events. For 643854/643862 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 30969 event pairs, 731 based on Foata normal form. 9/5775 useless extension candidates. Maximal degree in co-relation 56215. Up to 5667 conditions per place. [2024-06-03 22:42:01,827 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 481 selfloop transitions, 40 changer transitions 0/524 dead transitions. [2024-06-03 22:42:01,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 524 transitions, 9718 flow [2024-06-03 22:42:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-03 22:42:01,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719512195121951 [2024-06-03 22:42:01,828 INFO L175 Difference]: Start difference. First operand has 336 places, 503 transitions, 8537 flow. Second operand 8 states and 122 transitions. [2024-06-03 22:42:01,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 524 transitions, 9718 flow [2024-06-03 22:42:03,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 524 transitions, 9536 flow, removed 64 selfloop flow, removed 3 redundant places. [2024-06-03 22:42:03,058 INFO L231 Difference]: Finished difference. Result has 341 places, 506 transitions, 8522 flow [2024-06-03 22:42:03,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8355, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8522, PETRI_PLACES=341, PETRI_TRANSITIONS=506} [2024-06-03 22:42:03,058 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 299 predicate places. [2024-06-03 22:42:03,058 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 506 transitions, 8522 flow [2024-06-03 22:42:03,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:03,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:03,059 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:42:03,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:42:03,059 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:42:03,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2127888347, now seen corresponding path program 1 times [2024-06-03 22:42:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:03,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824476846] [2024-06-03 22:42:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:10,919 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:42:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824476846] [2024-06-03 22:42:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824476846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:10,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:10,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:42:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873270703] [2024-06-03 22:42:10,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:10,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:42:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:42:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:42:11,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:42:11,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 506 transitions, 8522 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:11,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:11,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:42:11,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:13,162 INFO L124 PetriNetUnfolderBase]: 3867/5826 cut-off events. [2024-06-03 22:42:13,162 INFO L125 PetriNetUnfolderBase]: For 671124/671132 co-relation queries the response was YES. [2024-06-03 22:42:13,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57263 conditions, 5826 events. 3867/5826 cut-off events. For 671124/671132 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 31317 event pairs, 733 based on Foata normal form. 10/5834 useless extension candidates. Maximal degree in co-relation 57096. Up to 5656 conditions per place. [2024-06-03 22:42:13,248 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 463 selfloop transitions, 73 changer transitions 0/539 dead transitions. [2024-06-03 22:42:13,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 539 transitions, 10202 flow [2024-06-03 22:42:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-03 22:42:13,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-03 22:42:13,250 INFO L175 Difference]: Start difference. First operand has 341 places, 506 transitions, 8522 flow. Second operand 8 states and 130 transitions. [2024-06-03 22:42:13,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 539 transitions, 10202 flow [2024-06-03 22:42:14,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 539 transitions, 10076 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-03 22:42:14,660 INFO L231 Difference]: Finished difference. Result has 344 places, 518 transitions, 8978 flow [2024-06-03 22:42:14,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8396, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8978, PETRI_PLACES=344, PETRI_TRANSITIONS=518} [2024-06-03 22:42:14,661 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 302 predicate places. [2024-06-03 22:42:14,661 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 518 transitions, 8978 flow [2024-06-03 22:42:14,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:14,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:14,661 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:42:14,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:42:14,661 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:42:14,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1046926011, now seen corresponding path program 4 times [2024-06-03 22:42:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112047946] [2024-06-03 22:42:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:22,474 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:42:22,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112047946] [2024-06-03 22:42:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112047946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:22,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:22,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:42:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786570616] [2024-06-03 22:42:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:22,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:42:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:22,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:42:22,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:42:22,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:42:22,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 518 transitions, 8978 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:22,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:22,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:42:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:24,857 INFO L124 PetriNetUnfolderBase]: 3885/5852 cut-off events. [2024-06-03 22:42:24,857 INFO L125 PetriNetUnfolderBase]: For 695743/695743 co-relation queries the response was YES. [2024-06-03 22:42:24,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58181 conditions, 5852 events. 3885/5852 cut-off events. For 695743/695743 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 31404 event pairs, 691 based on Foata normal form. 2/5852 useless extension candidates. Maximal degree in co-relation 58012. Up to 5358 conditions per place. [2024-06-03 22:42:24,943 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 415 selfloop transitions, 129 changer transitions 0/547 dead transitions. [2024-06-03 22:42:24,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 547 transitions, 10562 flow [2024-06-03 22:42:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:42:24,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:42:24,945 INFO L175 Difference]: Start difference. First operand has 344 places, 518 transitions, 8978 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:42:24,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 547 transitions, 10562 flow [2024-06-03 22:42:26,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 547 transitions, 10379 flow, removed 66 selfloop flow, removed 4 redundant places. [2024-06-03 22:42:26,297 INFO L231 Difference]: Finished difference. Result has 348 places, 524 transitions, 9165 flow [2024-06-03 22:42:26,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8795, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9165, PETRI_PLACES=348, PETRI_TRANSITIONS=524} [2024-06-03 22:42:26,298 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 306 predicate places. [2024-06-03 22:42:26,298 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 524 transitions, 9165 flow [2024-06-03 22:42:26,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:26,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:26,298 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:42:26,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:42:26,298 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:42:26,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1160152505, now seen corresponding path program 2 times [2024-06-03 22:42:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:26,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414194497] [2024-06-03 22:42:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:26,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:34,790 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:42:34,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:34,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414194497] [2024-06-03 22:42:34,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414194497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:34,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:34,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:42:34,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403657229] [2024-06-03 22:42:34,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:34,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:42:34,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:34,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:42:34,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:42:34,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:42:34,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 524 transitions, 9165 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:34,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:34,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:42:34,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:37,059 INFO L124 PetriNetUnfolderBase]: 3903/5876 cut-off events. [2024-06-03 22:42:37,059 INFO L125 PetriNetUnfolderBase]: For 715200/715208 co-relation queries the response was YES. [2024-06-03 22:42:37,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59001 conditions, 5876 events. 3903/5876 cut-off events. For 715200/715208 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 31584 event pairs, 733 based on Foata normal form. 10/5884 useless extension candidates. Maximal degree in co-relation 58830. Up to 5765 conditions per place. [2024-06-03 22:42:37,152 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 491 selfloop transitions, 54 changer transitions 0/548 dead transitions. [2024-06-03 22:42:37,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 548 transitions, 10646 flow [2024-06-03 22:42:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-03 22:42:37,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:42:37,153 INFO L175 Difference]: Start difference. First operand has 348 places, 524 transitions, 9165 flow. Second operand 8 states and 128 transitions. [2024-06-03 22:42:37,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 548 transitions, 10646 flow [2024-06-03 22:42:38,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 548 transitions, 10463 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-03 22:42:38,886 INFO L231 Difference]: Finished difference. Result has 353 places, 530 transitions, 9279 flow [2024-06-03 22:42:38,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8982, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9279, PETRI_PLACES=353, PETRI_TRANSITIONS=530} [2024-06-03 22:42:38,887 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 311 predicate places. [2024-06-03 22:42:38,887 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 530 transitions, 9279 flow [2024-06-03 22:42:38,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:38,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:38,887 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:42:38,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 22:42:38,887 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:42:38,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1160152319, now seen corresponding path program 2 times [2024-06-03 22:42:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226749683] [2024-06-03 22:42:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:46,837 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:42:46,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:46,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226749683] [2024-06-03 22:42:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226749683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:46,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:42:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117743760] [2024-06-03 22:42:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:46,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:42:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:42:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:42:46,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:42:46,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 530 transitions, 9279 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:46,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:46,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:42:46,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:49,253 INFO L124 PetriNetUnfolderBase]: 3908/5883 cut-off events. [2024-06-03 22:42:49,253 INFO L125 PetriNetUnfolderBase]: For 728159/728167 co-relation queries the response was YES. [2024-06-03 22:42:49,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59084 conditions, 5883 events. 3908/5883 cut-off events. For 728159/728167 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31622 event pairs, 730 based on Foata normal form. 9/5890 useless extension candidates. Maximal degree in co-relation 58911. Up to 5815 conditions per place. [2024-06-03 22:42:49,332 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 517 selfloop transitions, 28 changer transitions 0/548 dead transitions. [2024-06-03 22:42:49,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 548 transitions, 10500 flow [2024-06-03 22:42:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:42:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:42:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-03 22:42:49,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3597560975609756 [2024-06-03 22:42:49,334 INFO L175 Difference]: Start difference. First operand has 353 places, 530 transitions, 9279 flow. Second operand 8 states and 118 transitions. [2024-06-03 22:42:49,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 548 transitions, 10500 flow [2024-06-03 22:42:50,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 548 transitions, 10312 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-06-03 22:42:50,849 INFO L231 Difference]: Finished difference. Result has 356 places, 533 transitions, 9240 flow [2024-06-03 22:42:50,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9091, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9240, PETRI_PLACES=356, PETRI_TRANSITIONS=533} [2024-06-03 22:42:50,849 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 314 predicate places. [2024-06-03 22:42:50,849 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 533 transitions, 9240 flow [2024-06-03 22:42:50,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:50,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:50,850 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:42:50,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 22:42:50,850 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:42:50,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1160032163, now seen corresponding path program 5 times [2024-06-03 22:42:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:50,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198970604] [2024-06-03 22:42:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:59,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:42:59,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198970604] [2024-06-03 22:42:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198970604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:59,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:59,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:42:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842250732] [2024-06-03 22:42:59,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:59,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:42:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:59,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:42:59,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:42:59,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:42:59,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 533 transitions, 9240 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:42:59,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:59,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:42:59,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:01,396 INFO L124 PetriNetUnfolderBase]: 3902/5876 cut-off events. [2024-06-03 22:43:01,396 INFO L125 PetriNetUnfolderBase]: For 740091/740091 co-relation queries the response was YES. [2024-06-03 22:43:01,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58841 conditions, 5876 events. 3902/5876 cut-off events. For 740091/740091 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31559 event pairs, 705 based on Foata normal form. 2/5876 useless extension candidates. Maximal degree in co-relation 58667. Up to 5675 conditions per place. [2024-06-03 22:43:01,486 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 476 selfloop transitions, 70 changer transitions 0/549 dead transitions. [2024-06-03 22:43:01,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 549 transitions, 10388 flow [2024-06-03 22:43:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:43:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:43:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-03 22:43:01,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-03 22:43:01,487 INFO L175 Difference]: Start difference. First operand has 356 places, 533 transitions, 9240 flow. Second operand 8 states and 123 transitions. [2024-06-03 22:43:01,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 549 transitions, 10388 flow [2024-06-03 22:43:03,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 549 transitions, 10258 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-03 22:43:03,397 INFO L231 Difference]: Finished difference. Result has 358 places, 533 transitions, 9256 flow [2024-06-03 22:43:03,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9110, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9256, PETRI_PLACES=358, PETRI_TRANSITIONS=533} [2024-06-03 22:43:03,397 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 316 predicate places. [2024-06-03 22:43:03,397 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 533 transitions, 9256 flow [2024-06-03 22:43:03,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:43:03,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:03,398 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:43:03,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 22:43:03,398 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:43:03,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1160152133, now seen corresponding path program 6 times [2024-06-03 22:43:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617798613] [2024-06-03 22:43:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:11,460 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:43:11,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:11,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617798613] [2024-06-03 22:43:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617798613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:43:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224518962] [2024-06-03 22:43:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:11,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:43:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:11,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:43:11,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:43:11,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:43:11,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 533 transitions, 9256 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:43:11,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:11,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:43:11,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15