./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 76401ed0 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-76401ed-m [2024-06-20 19:43:40,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:43:40,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:43:41,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:43:41,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:43:41,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:43:41,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:43:41,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:43:41,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:43:41,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:43:41,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:43:41,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:43:41,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:43:41,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:43:41,030 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:43:41,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:43:41,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:43:41,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:43:41,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:43:41,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:43:41,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:43:41,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:43:41,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:43:41,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:43:41,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:43:41,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:43:41,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:43:41,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:43:41,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:43:41,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:43:41,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:43:41,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:43:41,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:43:41,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:43:41,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:43:41,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:43:41,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:43:41,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:43:41,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:43:41,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:43:41,037 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:43:41,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:43:41,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:43:41,038 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-20 19:43:41,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:43:41,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:43:41,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:43:41,255 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:43:41,256 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:43:41,257 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-20 19:43:41,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:43:41,430 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:43:41,431 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-20 19:43:42,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:43:42,702 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:43:42,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2024-06-20 19:43:42,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5800a62af/4760ac90a6a6442194213ef4c752b603/FLAGf0e4ccab1 [2024-06-20 19:43:42,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5800a62af/4760ac90a6a6442194213ef4c752b603 [2024-06-20 19:43:42,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:43:42,744 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:43:42,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:43:42,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:43:42,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:43:42,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:43:41" (1/2) ... [2024-06-20 19:43:42,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f45556 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:43:42, skipping insertion in model container [2024-06-20 19:43:42,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:43:41" (1/2) ... [2024-06-20 19:43:42,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a46a434 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:43:42, skipping insertion in model container [2024-06-20 19:43:42,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:43:42" (2/2) ... [2024-06-20 19:43:42,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f45556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:42, skipping insertion in model container [2024-06-20 19:43:42,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:43:42" (2/2) ... [2024-06-20 19:43:42,770 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:43:42,835 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:43:42,836 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-20 19:43:42,839 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-20 19:43:42,840 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-20 19:43:42,840 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:43:42,840 INFO L106 edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1; [2024-06-20 19:43:42,879 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:43:43,205 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:43:43,214 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:43:43,478 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:43:43,521 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:43:43,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43 WrapperNode [2024-06-20 19:43:43,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:43:43,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:43:43,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:43:43,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:43:43,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,711 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2024-06-20 19:43:43,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:43:43,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:43:43,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:43:43,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:43:43,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,780 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-20 19:43:43,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:43:43,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:43:43,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:43:43,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:43:43,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (1/1) ... [2024-06-20 19:43:43,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:43:43,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:43:43,885 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-20 19:43:43,902 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-20 19:43:43,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:43:43,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:43:43,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:43:43,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:43:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:43:43,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:43:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 19:43:43,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 19:43:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:43:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:43:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:43:43,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:43:43,917 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:43:44,077 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:43:44,079 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:43:45,048 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:43:45,049 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:43:45,252 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:43:45,253 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:43:45,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:43:45 BoogieIcfgContainer [2024-06-20 19:43:45,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:43:45,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:43:45,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:43:45,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:43:45,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:43:41" (1/4) ... [2024-06-20 19:43:45,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638ca04d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:43:45, skipping insertion in model container [2024-06-20 19:43:45,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:43:42" (2/4) ... [2024-06-20 19:43:45,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638ca04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:43:45, skipping insertion in model container [2024-06-20 19:43:45,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:43:43" (3/4) ... [2024-06-20 19:43:45,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638ca04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:43:45, skipping insertion in model container [2024-06-20 19:43:45,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:43:45" (4/4) ... [2024-06-20 19:43:45,259 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2024-06-20 19:43:45,271 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:43:45,272 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 19:43:45,272 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:43:45,345 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:43:45,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-20 19:43:45,403 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-20 19:43:45,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:43:45,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 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/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:43:45,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-20 19:43:45,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-20 19:43:45,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:43:45,461 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;@11806b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:43:45,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 19:43:45,466 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:43:45,467 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:43:45,467 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:43:45,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:45,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:43:45,468 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-20 19:43:45,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash 368623954, now seen corresponding path program 1 times [2024-06-20 19:43:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952048560] [2024-06-20 19:43:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952048560] [2024-06-20 19:43:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952048560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:49,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:49,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:43:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566916865] [2024-06-20 19:43:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:43:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:49,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:43:49,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:43:49,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-20 19:43:49,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:49,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:49,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-20 19:43:49,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:50,639 INFO L124 PetriNetUnfolderBase]: 1152/1755 cut-off events. [2024-06-20 19:43:50,639 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-06-20 19:43:50,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1755 events. 1152/1755 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8184 event pairs, 794 based on Foata normal form. 2/1710 useless extension candidates. Maximal degree in co-relation 3583. Up to 1738 conditions per place. [2024-06-20 19:43:50,650 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-20 19:43:50,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 171 flow [2024-06-20 19:43:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:43:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:43:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-20 19:43:50,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-20 19:43:50,660 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 72 transitions. [2024-06-20 19:43:50,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 171 flow [2024-06-20 19:43:50,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 19:43:50,664 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow [2024-06-20 19:43:50,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-20 19:43:50,667 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2024-06-20 19:43:50,668 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow [2024-06-20 19:43:50,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:50,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:50,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:43:50,669 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-20 19:43:50,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2060553313, now seen corresponding path program 1 times [2024-06-20 19:43:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142788614] [2024-06-20 19:43:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142788614] [2024-06-20 19:43:53,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142788614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:53,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:53,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:43:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102510973] [2024-06-20 19:43:53,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:53,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:43:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:53,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:43:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:43:53,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:43:53,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:53,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:53,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:43:53,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:54,262 INFO L124 PetriNetUnfolderBase]: 1644/2456 cut-off events. [2024-06-20 19:43:54,262 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2024-06-20 19:43:54,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5637 conditions, 2456 events. 1644/2456 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11062 event pairs, 1035 based on Foata normal form. 3/2457 useless extension candidates. Maximal degree in co-relation 5625. Up to 2429 conditions per place. [2024-06-20 19:43:54,273 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 43 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-20 19:43:54,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 254 flow [2024-06-20 19:43:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:43:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:43:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-20 19:43:54,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-06-20 19:43:54,276 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 86 transitions. [2024-06-20 19:43:54,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 254 flow [2024-06-20 19:43:54,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:43:54,277 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 150 flow [2024-06-20 19:43:54,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-20 19:43:54,278 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-06-20 19:43:54,278 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 150 flow [2024-06-20 19:43:54,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:54,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:54,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:54,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:43:54,279 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-20 19:43:54,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash -547356015, now seen corresponding path program 1 times [2024-06-20 19:43:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:54,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981082002] [2024-06-20 19:43:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:56,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981082002] [2024-06-20 19:43:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981082002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:56,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:43:56,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607334570] [2024-06-20 19:43:56,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:56,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:43:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:56,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:43:56,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:43:57,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:43:57,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:57,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:57,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:43:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:57,793 INFO L124 PetriNetUnfolderBase]: 1632/2438 cut-off events. [2024-06-20 19:43:57,794 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2024-06-20 19:43:57,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6212 conditions, 2438 events. 1632/2438 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10956 event pairs, 743 based on Foata normal form. 6/2442 useless extension candidates. Maximal degree in co-relation 6197. Up to 2381 conditions per place. [2024-06-20 19:43:57,805 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 51 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-20 19:43:57,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 340 flow [2024-06-20 19:43:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:43:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:43:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-20 19:43:57,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-20 19:43:57,808 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 150 flow. Second operand 5 states and 106 transitions. [2024-06-20 19:43:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 340 flow [2024-06-20 19:43:57,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 338 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-20 19:43:57,810 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 196 flow [2024-06-20 19:43:57,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-06-20 19:43:57,811 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-20 19:43:57,811 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 196 flow [2024-06-20 19:43:57,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:57,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:57,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:57,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:43:57,812 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-20 19:43:57,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash -304157824, now seen corresponding path program 1 times [2024-06-20 19:43:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582339103] [2024-06-20 19:43:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:57,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:01,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:01,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582339103] [2024-06-20 19:44:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582339103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:01,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:01,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:44:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755521829] [2024-06-20 19:44:01,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:01,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:44:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:01,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:44:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:44:01,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:44:01,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-20 19:44:01,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:01,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:44:01,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:02,520 INFO L124 PetriNetUnfolderBase]: 1623/2423 cut-off events. [2024-06-20 19:44:02,520 INFO L125 PetriNetUnfolderBase]: For 2223/2223 co-relation queries the response was YES. [2024-06-20 19:44:02,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6779 conditions, 2423 events. 1623/2423 cut-off events. For 2223/2223 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10845 event pairs, 579 based on Foata normal form. 6/2427 useless extension candidates. Maximal degree in co-relation 6761. Up to 2336 conditions per place. [2024-06-20 19:44:02,534 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 55 selfloop transitions, 12 changer transitions 0/71 dead transitions. [2024-06-20 19:44:02,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 404 flow [2024-06-20 19:44:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:44:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:44:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-20 19:44:02,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2024-06-20 19:44:02,540 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 196 flow. Second operand 6 states and 121 transitions. [2024-06-20 19:44:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 404 flow [2024-06-20 19:44:02,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 382 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-20 19:44:02,546 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 215 flow [2024-06-20 19:44:02,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-20 19:44:02,547 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2024-06-20 19:44:02,547 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 215 flow [2024-06-20 19:44:02,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-20 19:44:02,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:02,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:02,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:44:02,548 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-20 19:44:02,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -546325912, now seen corresponding path program 1 times [2024-06-20 19:44:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:02,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128184603] [2024-06-20 19:44:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128184603] [2024-06-20 19:44:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128184603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:07,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:07,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:44:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525315178] [2024-06-20 19:44:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:07,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:44:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:07,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:44:07,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:44:07,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:44:07,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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-20 19:44:07,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:07,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:44:07,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:08,603 INFO L124 PetriNetUnfolderBase]: 1237/1932 cut-off events. [2024-06-20 19:44:08,603 INFO L125 PetriNetUnfolderBase]: For 2895/2931 co-relation queries the response was YES. [2024-06-20 19:44:08,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5690 conditions, 1932 events. 1237/1932 cut-off events. For 2895/2931 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9271 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-20 19:44:08,614 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 41 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2024-06-20 19:44:08,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 359 flow [2024-06-20 19:44:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:44:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:44:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-20 19:44:08,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455 [2024-06-20 19:44:08,615 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 215 flow. Second operand 5 states and 91 transitions. [2024-06-20 19:44:08,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 359 flow [2024-06-20 19:44:08,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 328 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-20 19:44:08,618 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 229 flow [2024-06-20 19:44:08,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-06-20 19:44:08,619 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2024-06-20 19:44:08,619 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 229 flow [2024-06-20 19:44:08,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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-20 19:44:08,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:08,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:08,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:44:08,620 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-20 19:44:08,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 243767570, now seen corresponding path program 1 times [2024-06-20 19:44:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550783564] [2024-06-20 19:44:08,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:14,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550783564] [2024-06-20 19:44:14,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550783564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:14,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:14,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:44:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374955311] [2024-06-20 19:44:14,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:14,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:44:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:14,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:44:14,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:44:14,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:44:14,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:14,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:14,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:44:14,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:15,129 INFO L124 PetriNetUnfolderBase]: 1618/2420 cut-off events. [2024-06-20 19:44:15,129 INFO L125 PetriNetUnfolderBase]: For 4511/4523 co-relation queries the response was YES. [2024-06-20 19:44:15,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 2420 events. 1618/2420 cut-off events. For 4511/4523 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10879 event pairs, 734 based on Foata normal form. 12/2428 useless extension candidates. Maximal degree in co-relation 7674. Up to 2335 conditions per place. [2024-06-20 19:44:15,142 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 55 selfloop transitions, 16 changer transitions 0/74 dead transitions. [2024-06-20 19:44:15,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 483 flow [2024-06-20 19:44:15,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:44:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:44:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-20 19:44:15,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2024-06-20 19:44:15,143 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 229 flow. Second operand 6 states and 101 transitions. [2024-06-20 19:44:15,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 483 flow [2024-06-20 19:44:15,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 460 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-20 19:44:15,146 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 314 flow [2024-06-20 19:44:15,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2024-06-20 19:44:15,147 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2024-06-20 19:44:15,147 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 314 flow [2024-06-20 19:44:15,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:15,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:15,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:15,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:44:15,148 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-20 19:44:15,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash 231276359, now seen corresponding path program 1 times [2024-06-20 19:44:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370577910] [2024-06-20 19:44:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:20,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370577910] [2024-06-20 19:44:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370577910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:20,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:44:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049139943] [2024-06-20 19:44:20,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:20,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:44:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:44:20,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:44:20,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:44:20,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:20,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:20,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:44:20,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:21,463 INFO L124 PetriNetUnfolderBase]: 1641/2454 cut-off events. [2024-06-20 19:44:21,463 INFO L125 PetriNetUnfolderBase]: For 6463/6463 co-relation queries the response was YES. [2024-06-20 19:44:21,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8711 conditions, 2454 events. 1641/2454 cut-off events. For 6463/6463 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11015 event pairs, 758 based on Foata normal form. 2/2454 useless extension candidates. Maximal degree in co-relation 8687. Up to 2411 conditions per place. [2024-06-20 19:44:21,477 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 66 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2024-06-20 19:44:21,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 588 flow [2024-06-20 19:44:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:44:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:44:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-20 19:44:21,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-20 19:44:21,479 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 314 flow. Second operand 7 states and 113 transitions. [2024-06-20 19:44:21,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 588 flow [2024-06-20 19:44:21,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 559 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-20 19:44:21,485 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 395 flow [2024-06-20 19:44:21,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2024-06-20 19:44:21,486 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2024-06-20 19:44:21,486 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 395 flow [2024-06-20 19:44:21,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:21,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:21,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:21,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:44:21,487 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-20 19:44:21,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1038860089, now seen corresponding path program 2 times [2024-06-20 19:44:21,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:21,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986098613] [2024-06-20 19:44:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:27,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:27,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986098613] [2024-06-20 19:44:27,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986098613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:27,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:27,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:44:27,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118882651] [2024-06-20 19:44:27,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:27,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:44:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:27,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:44:27,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:44:27,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:44:27,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:27,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:27,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:44:27,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:28,115 INFO L124 PetriNetUnfolderBase]: 1652/2470 cut-off events. [2024-06-20 19:44:28,115 INFO L125 PetriNetUnfolderBase]: For 7970/7970 co-relation queries the response was YES. [2024-06-20 19:44:28,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9032 conditions, 2470 events. 1652/2470 cut-off events. For 7970/7970 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11083 event pairs, 754 based on Foata normal form. 2/2470 useless extension candidates. Maximal degree in co-relation 9005. Up to 2418 conditions per place. [2024-06-20 19:44:28,128 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 64 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2024-06-20 19:44:28,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 639 flow [2024-06-20 19:44:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:44:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:44:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-20 19:44:28,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-20 19:44:28,130 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 395 flow. Second operand 6 states and 98 transitions. [2024-06-20 19:44:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 639 flow [2024-06-20 19:44:28,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 598 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:44:28,136 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 436 flow [2024-06-20 19:44:28,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2024-06-20 19:44:28,137 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-06-20 19:44:28,137 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 436 flow [2024-06-20 19:44:28,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:28,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:28,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:28,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:44:28,138 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-20 19:44:28,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1033146169, now seen corresponding path program 3 times [2024-06-20 19:44:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357375047] [2024-06-20 19:44:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:33,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357375047] [2024-06-20 19:44:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357375047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:33,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:33,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:44:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715512679] [2024-06-20 19:44:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:33,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:44:33,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:33,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:44:33,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:44:34,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:44:34,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 436 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:34,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:34,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:44:34,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:34,811 INFO L124 PetriNetUnfolderBase]: 1639/2453 cut-off events. [2024-06-20 19:44:34,811 INFO L125 PetriNetUnfolderBase]: For 9661/9673 co-relation queries the response was YES. [2024-06-20 19:44:34,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 2453 events. 1639/2453 cut-off events. For 9661/9673 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11011 event pairs, 759 based on Foata normal form. 12/2459 useless extension candidates. Maximal degree in co-relation 9167. Up to 2344 conditions per place. [2024-06-20 19:44:34,824 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 57 selfloop transitions, 24 changer transitions 0/84 dead transitions. [2024-06-20 19:44:34,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 661 flow [2024-06-20 19:44:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:44:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:44:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-20 19:44:34,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 19:44:34,828 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 436 flow. Second operand 6 states and 99 transitions. [2024-06-20 19:44:34,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 661 flow [2024-06-20 19:44:34,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 605 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-20 19:44:34,836 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 471 flow [2024-06-20 19:44:34,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2024-06-20 19:44:34,837 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-06-20 19:44:34,837 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 471 flow [2024-06-20 19:44:34,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:34,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:34,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:34,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:44:34,838 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-20 19:44:34,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1033138233, now seen corresponding path program 1 times [2024-06-20 19:44:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155997199] [2024-06-20 19:44:34,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:41,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155997199] [2024-06-20 19:44:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155997199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:44:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955694890] [2024-06-20 19:44:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:41,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:44:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:44:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:44:41,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:44:41,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 471 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:41,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:41,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:44:41,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:42,287 INFO L124 PetriNetUnfolderBase]: 1705/2553 cut-off events. [2024-06-20 19:44:42,288 INFO L125 PetriNetUnfolderBase]: For 9963/9969 co-relation queries the response was YES. [2024-06-20 19:44:42,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9560 conditions, 2553 events. 1705/2553 cut-off events. For 9963/9969 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11569 event pairs, 506 based on Foata normal form. 12/2555 useless extension candidates. Maximal degree in co-relation 9531. Up to 2252 conditions per place. [2024-06-20 19:44:42,300 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 70 selfloop transitions, 35 changer transitions 0/108 dead transitions. [2024-06-20 19:44:42,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 885 flow [2024-06-20 19:44:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:44:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:44:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 19:44:42,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-20 19:44:42,303 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 471 flow. Second operand 7 states and 126 transitions. [2024-06-20 19:44:42,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 885 flow [2024-06-20 19:44:42,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 849 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 19:44:42,311 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 614 flow [2024-06-20 19:44:42,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=614, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-06-20 19:44:42,312 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-06-20 19:44:42,312 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 614 flow [2024-06-20 19:44:42,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:42,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:42,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:42,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:44:42,312 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-20 19:44:42,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash -998623833, now seen corresponding path program 1 times [2024-06-20 19:44:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:42,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180790683] [2024-06-20 19:44:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180790683] [2024-06-20 19:44:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180790683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:44:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196303218] [2024-06-20 19:44:47,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:47,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:44:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:44:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:44:47,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:44:47,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 614 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:47,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:47,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:44:47,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:48,300 INFO L124 PetriNetUnfolderBase]: 1739/2600 cut-off events. [2024-06-20 19:44:48,300 INFO L125 PetriNetUnfolderBase]: For 13126/13126 co-relation queries the response was YES. [2024-06-20 19:44:48,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10953 conditions, 2600 events. 1739/2600 cut-off events. For 13126/13126 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11765 event pairs, 503 based on Foata normal form. 4/2602 useless extension candidates. Maximal degree in co-relation 10922. Up to 2499 conditions per place. [2024-06-20 19:44:48,314 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 93 selfloop transitions, 25 changer transitions 0/121 dead transitions. [2024-06-20 19:44:48,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 1003 flow [2024-06-20 19:44:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:44:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:44:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-20 19:44:48,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 19:44:48,316 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 614 flow. Second operand 8 states and 132 transitions. [2024-06-20 19:44:48,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 1003 flow [2024-06-20 19:44:48,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 969 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-20 19:44:48,327 INFO L231 Difference]: Finished difference. Result has 80 places, 92 transitions, 729 flow [2024-06-20 19:44:48,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=729, PETRI_PLACES=80, PETRI_TRANSITIONS=92} [2024-06-20 19:44:48,330 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2024-06-20 19:44:48,330 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 92 transitions, 729 flow [2024-06-20 19:44:48,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:48,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:48,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:48,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:44:48,331 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-20 19:44:48,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -256200543, now seen corresponding path program 2 times [2024-06-20 19:44:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134652638] [2024-06-20 19:44:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134652638] [2024-06-20 19:44:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134652638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:53,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:44:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972618569] [2024-06-20 19:44:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:44:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:44:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:44:53,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:44:53,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 92 transitions, 729 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:53,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:53,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:44:53,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:54,459 INFO L124 PetriNetUnfolderBase]: 1761/2632 cut-off events. [2024-06-20 19:44:54,460 INFO L125 PetriNetUnfolderBase]: For 16023/16023 co-relation queries the response was YES. [2024-06-20 19:44:54,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11833 conditions, 2632 events. 1761/2632 cut-off events. For 16023/16023 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11903 event pairs, 500 based on Foata normal form. 4/2634 useless extension candidates. Maximal degree in co-relation 11798. Up to 2513 conditions per place. [2024-06-20 19:44:54,471 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 91 selfloop transitions, 26 changer transitions 0/120 dead transitions. [2024-06-20 19:44:54,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 120 transitions, 1088 flow [2024-06-20 19:44:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:44:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:44:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-20 19:44:54,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-20 19:44:54,474 INFO L175 Difference]: Start difference. First operand has 80 places, 92 transitions, 729 flow. Second operand 7 states and 117 transitions. [2024-06-20 19:44:54,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 120 transitions, 1088 flow [2024-06-20 19:44:54,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 120 transitions, 1050 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-20 19:44:54,486 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 794 flow [2024-06-20 19:44:54,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=794, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-06-20 19:44:54,487 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2024-06-20 19:44:54,487 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 794 flow [2024-06-20 19:44:54,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:54,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:54,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:54,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:44:54,488 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-20 19:44:54,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2053845513, now seen corresponding path program 3 times [2024-06-20 19:44:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524325908] [2024-06-20 19:44:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524325908] [2024-06-20 19:44:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524325908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:44:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016572509] [2024-06-20 19:44:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:44:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:59,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:44:59,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:00,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:00,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 794 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:00,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:00,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:00,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:01,046 INFO L124 PetriNetUnfolderBase]: 1799/2687 cut-off events. [2024-06-20 19:45:01,047 INFO L125 PetriNetUnfolderBase]: For 19137/19137 co-relation queries the response was YES. [2024-06-20 19:45:01,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12526 conditions, 2687 events. 1799/2687 cut-off events. For 19137/19137 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12176 event pairs, 499 based on Foata normal form. 4/2689 useless extension candidates. Maximal degree in co-relation 12490. Up to 2516 conditions per place. [2024-06-20 19:45:01,061 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 90 selfloop transitions, 34 changer transitions 0/127 dead transitions. [2024-06-20 19:45:01,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 127 transitions, 1260 flow [2024-06-20 19:45:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-20 19:45:01,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:45:01,064 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 794 flow. Second operand 7 states and 119 transitions. [2024-06-20 19:45:01,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 127 transitions, 1260 flow [2024-06-20 19:45:01,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 127 transitions, 1178 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-20 19:45:01,082 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 877 flow [2024-06-20 19:45:01,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=877, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2024-06-20 19:45:01,083 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2024-06-20 19:45:01,083 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 877 flow [2024-06-20 19:45:01,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:01,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:01,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:01,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:45:01,084 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-20 19:45:01,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1962758695, now seen corresponding path program 4 times [2024-06-20 19:45:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:01,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857571879] [2024-06-20 19:45:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:06,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857571879] [2024-06-20 19:45:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857571879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:06,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:45:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673318778] [2024-06-20 19:45:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:06,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:45:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:06,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:45:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:06,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:06,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 877 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:06,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:06,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:06,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:07,578 INFO L124 PetriNetUnfolderBase]: 1839/2753 cut-off events. [2024-06-20 19:45:07,578 INFO L125 PetriNetUnfolderBase]: For 19820/19826 co-relation queries the response was YES. [2024-06-20 19:45:07,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12653 conditions, 2753 events. 1839/2753 cut-off events. For 19820/19826 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12552 event pairs, 506 based on Foata normal form. 16/2757 useless extension candidates. Maximal degree in co-relation 12616. Up to 2276 conditions per place. [2024-06-20 19:45:07,591 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 82 selfloop transitions, 52 changer transitions 0/137 dead transitions. [2024-06-20 19:45:07,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 137 transitions, 1395 flow [2024-06-20 19:45:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-20 19:45:07,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-20 19:45:07,593 INFO L175 Difference]: Start difference. First operand has 86 places, 101 transitions, 877 flow. Second operand 7 states and 128 transitions. [2024-06-20 19:45:07,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 137 transitions, 1395 flow [2024-06-20 19:45:07,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1359 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-20 19:45:07,609 INFO L231 Difference]: Finished difference. Result has 91 places, 111 transitions, 1045 flow [2024-06-20 19:45:07,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1045, PETRI_PLACES=91, PETRI_TRANSITIONS=111} [2024-06-20 19:45:07,610 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2024-06-20 19:45:07,610 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 111 transitions, 1045 flow [2024-06-20 19:45:07,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:07,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:07,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:07,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:45:07,611 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-20 19:45:07,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:07,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1962512431, now seen corresponding path program 1 times [2024-06-20 19:45:07,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:07,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075609702] [2024-06-20 19:45:07,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075609702] [2024-06-20 19:45:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075609702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:45:14,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962417812] [2024-06-20 19:45:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:14,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:45:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:14,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:45:14,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:45:14,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:14,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 111 transitions, 1045 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:14,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:14,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:14,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:15,241 INFO L124 PetriNetUnfolderBase]: 1848/2765 cut-off events. [2024-06-20 19:45:15,241 INFO L125 PetriNetUnfolderBase]: For 23102/23117 co-relation queries the response was YES. [2024-06-20 19:45:15,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13654 conditions, 2765 events. 1848/2765 cut-off events. For 23102/23117 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12708 event pairs, 482 based on Foata normal form. 18/2777 useless extension candidates. Maximal degree in co-relation 13614. Up to 2599 conditions per place. [2024-06-20 19:45:15,258 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 104 selfloop transitions, 33 changer transitions 0/140 dead transitions. [2024-06-20 19:45:15,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 140 transitions, 1449 flow [2024-06-20 19:45:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:45:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:45:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-20 19:45:15,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-20 19:45:15,261 INFO L175 Difference]: Start difference. First operand has 91 places, 111 transitions, 1045 flow. Second operand 8 states and 129 transitions. [2024-06-20 19:45:15,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 140 transitions, 1449 flow [2024-06-20 19:45:15,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 1372 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-20 19:45:15,286 INFO L231 Difference]: Finished difference. Result has 97 places, 116 transitions, 1103 flow [2024-06-20 19:45:15,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1103, PETRI_PLACES=97, PETRI_TRANSITIONS=116} [2024-06-20 19:45:15,287 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2024-06-20 19:45:15,287 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 116 transitions, 1103 flow [2024-06-20 19:45:15,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:15,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:15,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:15,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:45:15,288 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-20 19:45:15,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1556137660, now seen corresponding path program 1 times [2024-06-20 19:45:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121922512] [2024-06-20 19:45:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121922512] [2024-06-20 19:45:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121922512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:45:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147050977] [2024-06-20 19:45:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:21,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:45:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:45:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:45:21,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:21,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 116 transitions, 1103 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:21,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:21,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:21,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:22,264 INFO L124 PetriNetUnfolderBase]: 1843/2755 cut-off events. [2024-06-20 19:45:22,265 INFO L125 PetriNetUnfolderBase]: For 24933/24933 co-relation queries the response was YES. [2024-06-20 19:45:22,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13998 conditions, 2755 events. 1843/2755 cut-off events. For 24933/24933 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12565 event pairs, 501 based on Foata normal form. 2/2755 useless extension candidates. Maximal degree in co-relation 13956. Up to 2627 conditions per place. [2024-06-20 19:45:22,279 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 111 selfloop transitions, 27 changer transitions 0/141 dead transitions. [2024-06-20 19:45:22,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 141 transitions, 1471 flow [2024-06-20 19:45:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-20 19:45:22,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-20 19:45:22,290 INFO L175 Difference]: Start difference. First operand has 97 places, 116 transitions, 1103 flow. Second operand 7 states and 117 transitions. [2024-06-20 19:45:22,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 141 transitions, 1471 flow [2024-06-20 19:45:22,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 141 transitions, 1380 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-20 19:45:22,318 INFO L231 Difference]: Finished difference. Result has 99 places, 116 transitions, 1082 flow [2024-06-20 19:45:22,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1082, PETRI_PLACES=99, PETRI_TRANSITIONS=116} [2024-06-20 19:45:22,318 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2024-06-20 19:45:22,319 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 116 transitions, 1082 flow [2024-06-20 19:45:22,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:22,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:22,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:22,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:45:22,319 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-20 19:45:22,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1915804637, now seen corresponding path program 1 times [2024-06-20 19:45:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959169326] [2024-06-20 19:45:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:27,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:27,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959169326] [2024-06-20 19:45:27,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959169326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:27,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:27,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:45:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346739017] [2024-06-20 19:45:27,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:27,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:45:27,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:27,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:45:27,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:28,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:28,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 116 transitions, 1082 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-20 19:45:28,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:28,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:28,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:28,959 INFO L124 PetriNetUnfolderBase]: 1865/2791 cut-off events. [2024-06-20 19:45:28,959 INFO L125 PetriNetUnfolderBase]: For 28697/28718 co-relation queries the response was YES. [2024-06-20 19:45:28,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14252 conditions, 2791 events. 1865/2791 cut-off events. For 28697/28718 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12785 event pairs, 506 based on Foata normal form. 18/2801 useless extension candidates. Maximal degree in co-relation 14209. Up to 2635 conditions per place. [2024-06-20 19:45:28,975 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 28 changer transitions 0/142 dead transitions. [2024-06-20 19:45:28,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 142 transitions, 1473 flow [2024-06-20 19:45:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-20 19:45:28,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-20 19:45:28,976 INFO L175 Difference]: Start difference. First operand has 99 places, 116 transitions, 1082 flow. Second operand 7 states and 116 transitions. [2024-06-20 19:45:28,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 142 transitions, 1473 flow [2024-06-20 19:45:29,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 142 transitions, 1403 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:45:29,030 INFO L231 Difference]: Finished difference. Result has 100 places, 119 transitions, 1110 flow [2024-06-20 19:45:29,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1110, PETRI_PLACES=100, PETRI_TRANSITIONS=119} [2024-06-20 19:45:29,031 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-06-20 19:45:29,031 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 119 transitions, 1110 flow [2024-06-20 19:45:29,031 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-20 19:45:29,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:29,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:29,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:45:29,032 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-20 19:45:29,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1047673281, now seen corresponding path program 2 times [2024-06-20 19:45:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:29,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188531215] [2024-06-20 19:45:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188531215] [2024-06-20 19:45:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188531215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:45:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596193288] [2024-06-20 19:45:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:35,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:45:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:35,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:45:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:35,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:35,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 119 transitions, 1110 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-20 19:45:35,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:35,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:35,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:36,352 INFO L124 PetriNetUnfolderBase]: 1903/2848 cut-off events. [2024-06-20 19:45:36,352 INFO L125 PetriNetUnfolderBase]: For 29489/29495 co-relation queries the response was YES. [2024-06-20 19:45:36,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14598 conditions, 2848 events. 1903/2848 cut-off events. For 29489/29495 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13108 event pairs, 505 based on Foata normal form. 8/2844 useless extension candidates. Maximal degree in co-relation 14554. Up to 2316 conditions per place. [2024-06-20 19:45:36,366 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 85 selfloop transitions, 63 changer transitions 0/151 dead transitions. [2024-06-20 19:45:36,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 151 transitions, 1678 flow [2024-06-20 19:45:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-20 19:45:36,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-20 19:45:36,368 INFO L175 Difference]: Start difference. First operand has 100 places, 119 transitions, 1110 flow. Second operand 7 states and 125 transitions. [2024-06-20 19:45:36,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 151 transitions, 1678 flow [2024-06-20 19:45:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 151 transitions, 1617 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-20 19:45:36,394 INFO L231 Difference]: Finished difference. Result has 102 places, 125 transitions, 1252 flow [2024-06-20 19:45:36,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1252, PETRI_PLACES=102, PETRI_TRANSITIONS=125} [2024-06-20 19:45:36,395 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2024-06-20 19:45:36,395 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 125 transitions, 1252 flow [2024-06-20 19:45:36,395 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-20 19:45:36,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:36,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:36,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:45:36,396 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-20 19:45:36,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1552322645, now seen corresponding path program 3 times [2024-06-20 19:45:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:36,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197317926] [2024-06-20 19:45:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:41,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-20 19:45:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197317926] [2024-06-20 19:45:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197317926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:45:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000748853] [2024-06-20 19:45:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:41,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:45:41,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:41,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:45:41,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:41,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:41,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 125 transitions, 1252 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-20 19:45:41,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:41,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:41,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:42,916 INFO L124 PetriNetUnfolderBase]: 1880/2815 cut-off events. [2024-06-20 19:45:42,917 INFO L125 PetriNetUnfolderBase]: For 32545/32551 co-relation queries the response was YES. [2024-06-20 19:45:42,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14800 conditions, 2815 events. 1880/2815 cut-off events. For 32545/32551 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12928 event pairs, 502 based on Foata normal form. 12/2815 useless extension candidates. Maximal degree in co-relation 14755. Up to 2301 conditions per place. [2024-06-20 19:45:42,934 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 82 selfloop transitions, 66 changer transitions 0/151 dead transitions. [2024-06-20 19:45:42,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 151 transitions, 1762 flow [2024-06-20 19:45:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-20 19:45:42,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-20 19:45:42,938 INFO L175 Difference]: Start difference. First operand has 102 places, 125 transitions, 1252 flow. Second operand 7 states and 127 transitions. [2024-06-20 19:45:42,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 151 transitions, 1762 flow [2024-06-20 19:45:42,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1659 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-20 19:45:42,970 INFO L231 Difference]: Finished difference. Result has 106 places, 125 transitions, 1293 flow [2024-06-20 19:45:42,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1293, PETRI_PLACES=106, PETRI_TRANSITIONS=125} [2024-06-20 19:45:42,971 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-06-20 19:45:42,971 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 125 transitions, 1293 flow [2024-06-20 19:45:42,971 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-20 19:45:42,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:42,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:42,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:45:42,971 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-20 19:45:42,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash -708618296, now seen corresponding path program 1 times [2024-06-20 19:45:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099296104] [2024-06-20 19:45:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:49,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099296104] [2024-06-20 19:45:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099296104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:49,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:49,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:45:49,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107891168] [2024-06-20 19:45:49,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:49,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:45:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:45:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:49,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:49,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 125 transitions, 1293 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-20 19:45:49,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:49,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:49,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:50,488 INFO L124 PetriNetUnfolderBase]: 1891/2828 cut-off events. [2024-06-20 19:45:50,489 INFO L125 PetriNetUnfolderBase]: For 35638/35653 co-relation queries the response was YES. [2024-06-20 19:45:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15156 conditions, 2828 events. 1891/2828 cut-off events. For 35638/35653 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12989 event pairs, 511 based on Foata normal form. 12/2834 useless extension candidates. Maximal degree in co-relation 15110. Up to 2707 conditions per place. [2024-06-20 19:45:50,503 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 117 selfloop transitions, 27 changer transitions 0/147 dead transitions. [2024-06-20 19:45:50,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 1689 flow [2024-06-20 19:45:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-20 19:45:50,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-20 19:45:50,506 INFO L175 Difference]: Start difference. First operand has 106 places, 125 transitions, 1293 flow. Second operand 7 states and 113 transitions. [2024-06-20 19:45:50,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 1689 flow [2024-06-20 19:45:50,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 147 transitions, 1525 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-20 19:45:50,542 INFO L231 Difference]: Finished difference. Result has 107 places, 128 transitions, 1237 flow [2024-06-20 19:45:50,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1237, PETRI_PLACES=107, PETRI_TRANSITIONS=128} [2024-06-20 19:45:50,543 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-06-20 19:45:50,543 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 128 transitions, 1237 flow [2024-06-20 19:45:50,543 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-20 19:45:50,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:50,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:50,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:45:50,544 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-20 19:45:50,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash -708351386, now seen corresponding path program 2 times [2024-06-20 19:45:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:50,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417938307] [2024-06-20 19:45:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:50,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417938307] [2024-06-20 19:45:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417938307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:45:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173498075] [2024-06-20 19:45:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:56,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:45:56,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:45:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:56,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:45:56,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 128 transitions, 1237 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-20 19:45:56,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:56,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:45:56,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:57,390 INFO L124 PetriNetUnfolderBase]: 1880/2814 cut-off events. [2024-06-20 19:45:57,390 INFO L125 PetriNetUnfolderBase]: For 37737/37743 co-relation queries the response was YES. [2024-06-20 19:45:57,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15042 conditions, 2814 events. 1880/2814 cut-off events. For 37737/37743 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12873 event pairs, 506 based on Foata normal form. 6/2808 useless extension candidates. Maximal degree in co-relation 14995. Up to 2338 conditions per place. [2024-06-20 19:45:57,407 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 91 selfloop transitions, 61 changer transitions 0/155 dead transitions. [2024-06-20 19:45:57,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 155 transitions, 1791 flow [2024-06-20 19:45:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-20 19:45:57,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-20 19:45:57,411 INFO L175 Difference]: Start difference. First operand has 107 places, 128 transitions, 1237 flow. Second operand 7 states and 123 transitions. [2024-06-20 19:45:57,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 155 transitions, 1791 flow [2024-06-20 19:45:57,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 155 transitions, 1725 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:45:57,447 INFO L231 Difference]: Finished difference. Result has 109 places, 130 transitions, 1327 flow [2024-06-20 19:45:57,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1327, PETRI_PLACES=109, PETRI_TRANSITIONS=130} [2024-06-20 19:45:57,448 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2024-06-20 19:45:57,449 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 130 transitions, 1327 flow [2024-06-20 19:45:57,449 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-20 19:45:57,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:57,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:57,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:45:57,450 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-20 19:45:57,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1169067564, now seen corresponding path program 1 times [2024-06-20 19:45:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732310909] [2024-06-20 19:45:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732310909] [2024-06-20 19:46:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732310909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:03,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:46:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075040646] [2024-06-20 19:46:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:03,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:46:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:46:03,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:46:03,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:46:03,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 130 transitions, 1327 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:03,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:03,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:46:03,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:05,005 INFO L124 PetriNetUnfolderBase]: 1927/2886 cut-off events. [2024-06-20 19:46:05,005 INFO L125 PetriNetUnfolderBase]: For 42274/42278 co-relation queries the response was YES. [2024-06-20 19:46:05,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15746 conditions, 2886 events. 1927/2886 cut-off events. For 42274/42278 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13340 event pairs, 503 based on Foata normal form. 8/2892 useless extension candidates. Maximal degree in co-relation 15698. Up to 2750 conditions per place. [2024-06-20 19:46:05,023 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 141 selfloop transitions, 29 changer transitions 0/173 dead transitions. [2024-06-20 19:46:05,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 173 transitions, 1855 flow [2024-06-20 19:46:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:46:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:46:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-20 19:46:05,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-20 19:46:05,026 INFO L175 Difference]: Start difference. First operand has 109 places, 130 transitions, 1327 flow. Second operand 9 states and 147 transitions. [2024-06-20 19:46:05,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 173 transitions, 1855 flow [2024-06-20 19:46:05,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 173 transitions, 1727 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 19:46:05,069 INFO L231 Difference]: Finished difference. Result has 116 places, 139 transitions, 1364 flow [2024-06-20 19:46:05,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1364, PETRI_PLACES=116, PETRI_TRANSITIONS=139} [2024-06-20 19:46:05,069 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-06-20 19:46:05,069 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 139 transitions, 1364 flow [2024-06-20 19:46:05,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:05,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:05,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:05,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:46:05,071 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-20 19:46:05,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1233117188, now seen corresponding path program 2 times [2024-06-20 19:46:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114420819] [2024-06-20 19:46:05,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:05,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:11,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114420819] [2024-06-20 19:46:11,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114420819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:11,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:11,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:46:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532996433] [2024-06-20 19:46:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:46:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:46:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:46:11,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:46:11,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 139 transitions, 1364 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:11,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:11,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:46:11,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:12,793 INFO L124 PetriNetUnfolderBase]: 1944/2913 cut-off events. [2024-06-20 19:46:12,794 INFO L125 PetriNetUnfolderBase]: For 46360/46366 co-relation queries the response was YES. [2024-06-20 19:46:12,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16185 conditions, 2913 events. 1944/2913 cut-off events. For 46360/46366 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13491 event pairs, 344 based on Foata normal form. 10/2921 useless extension candidates. Maximal degree in co-relation 16134. Up to 2724 conditions per place. [2024-06-20 19:46:12,812 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 138 selfloop transitions, 29 changer transitions 0/170 dead transitions. [2024-06-20 19:46:12,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 170 transitions, 1834 flow [2024-06-20 19:46:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:46:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:46:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-20 19:46:12,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 19:46:12,815 INFO L175 Difference]: Start difference. First operand has 116 places, 139 transitions, 1364 flow. Second operand 8 states and 130 transitions. [2024-06-20 19:46:12,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 170 transitions, 1834 flow [2024-06-20 19:46:12,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 170 transitions, 1768 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-20 19:46:12,861 INFO L231 Difference]: Finished difference. Result has 119 places, 141 transitions, 1396 flow [2024-06-20 19:46:12,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1396, PETRI_PLACES=119, PETRI_TRANSITIONS=141} [2024-06-20 19:46:12,861 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2024-06-20 19:46:12,862 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 141 transitions, 1396 flow [2024-06-20 19:46:12,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:12,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:12,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:12,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:46:12,862 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-20 19:46:12,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2054776530, now seen corresponding path program 3 times [2024-06-20 19:46:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713034868] [2024-06-20 19:46:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713034868] [2024-06-20 19:46:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713034868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:19,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:46:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588325916] [2024-06-20 19:46:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:19,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:46:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:46:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:46:19,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:46:19,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 141 transitions, 1396 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:19,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:19,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:46:19,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:20,329 INFO L124 PetriNetUnfolderBase]: 1961/2941 cut-off events. [2024-06-20 19:46:20,329 INFO L125 PetriNetUnfolderBase]: For 51028/51028 co-relation queries the response was YES. [2024-06-20 19:46:20,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16704 conditions, 2941 events. 1961/2941 cut-off events. For 51028/51028 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13674 event pairs, 473 based on Foata normal form. 4/2943 useless extension candidates. Maximal degree in co-relation 16652. Up to 2771 conditions per place. [2024-06-20 19:46:20,346 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 137 selfloop transitions, 32 changer transitions 0/172 dead transitions. [2024-06-20 19:46:20,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 172 transitions, 1878 flow [2024-06-20 19:46:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:46:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:46:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-20 19:46:20,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-20 19:46:20,348 INFO L175 Difference]: Start difference. First operand has 119 places, 141 transitions, 1396 flow. Second operand 8 states and 131 transitions. [2024-06-20 19:46:20,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 172 transitions, 1878 flow [2024-06-20 19:46:20,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 172 transitions, 1796 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-20 19:46:20,393 INFO L231 Difference]: Finished difference. Result has 121 places, 143 transitions, 1421 flow [2024-06-20 19:46:20,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1421, PETRI_PLACES=121, PETRI_TRANSITIONS=143} [2024-06-20 19:46:20,394 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2024-06-20 19:46:20,394 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 143 transitions, 1421 flow [2024-06-20 19:46:20,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:20,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:20,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:46:20,395 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-20 19:46:20,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2057457596, now seen corresponding path program 1 times [2024-06-20 19:46:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002266391] [2024-06-20 19:46:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:26,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:26,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002266391] [2024-06-20 19:46:26,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002266391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:26,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:26,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:46:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228204104] [2024-06-20 19:46:26,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:26,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:46:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:46:26,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:46:26,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:46:26,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 143 transitions, 1421 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-20 19:46:26,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:26,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:46:26,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:27,973 INFO L124 PetriNetUnfolderBase]: 1953/2931 cut-off events. [2024-06-20 19:46:27,974 INFO L125 PetriNetUnfolderBase]: For 50689/50704 co-relation queries the response was YES. [2024-06-20 19:46:27,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16575 conditions, 2931 events. 1953/2931 cut-off events. For 50689/50704 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13593 event pairs, 474 based on Foata normal form. 12/2937 useless extension candidates. Maximal degree in co-relation 16522. Up to 2745 conditions per place. [2024-06-20 19:46:27,995 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 128 selfloop transitions, 35 changer transitions 0/166 dead transitions. [2024-06-20 19:46:27,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 166 transitions, 1843 flow [2024-06-20 19:46:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:46:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:46:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-20 19:46:27,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-20 19:46:27,998 INFO L175 Difference]: Start difference. First operand has 121 places, 143 transitions, 1421 flow. Second operand 7 states and 116 transitions. [2024-06-20 19:46:27,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 166 transitions, 1843 flow [2024-06-20 19:46:28,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 166 transitions, 1756 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:46:28,055 INFO L231 Difference]: Finished difference. Result has 122 places, 143 transitions, 1417 flow [2024-06-20 19:46:28,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1417, PETRI_PLACES=122, PETRI_TRANSITIONS=143} [2024-06-20 19:46:28,056 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2024-06-20 19:46:28,056 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 143 transitions, 1417 flow [2024-06-20 19:46:28,056 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-20 19:46:28,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:28,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:28,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:46:28,057 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-20 19:46:28,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:28,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1881869928, now seen corresponding path program 4 times [2024-06-20 19:46:28,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:28,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894971426] [2024-06-20 19:46:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894971426] [2024-06-20 19:46:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894971426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:34,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:46:34,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831945640] [2024-06-20 19:46:34,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:34,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:46:34,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:46:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:46:34,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:46:34,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 143 transitions, 1417 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:34,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:34,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:46:34,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:35,684 INFO L124 PetriNetUnfolderBase]: 1970/2954 cut-off events. [2024-06-20 19:46:35,684 INFO L125 PetriNetUnfolderBase]: For 55319/55325 co-relation queries the response was YES. [2024-06-20 19:46:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16906 conditions, 2954 events. 1970/2954 cut-off events. For 55319/55325 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13713 event pairs, 455 based on Foata normal form. 10/2962 useless extension candidates. Maximal degree in co-relation 16852. Up to 2755 conditions per place. [2024-06-20 19:46:35,702 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 131 selfloop transitions, 39 changer transitions 0/173 dead transitions. [2024-06-20 19:46:35,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 173 transitions, 1901 flow [2024-06-20 19:46:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:46:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:46:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-20 19:46:35,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-20 19:46:35,704 INFO L175 Difference]: Start difference. First operand has 122 places, 143 transitions, 1417 flow. Second operand 8 states and 131 transitions. [2024-06-20 19:46:35,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 173 transitions, 1901 flow [2024-06-20 19:46:35,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 173 transitions, 1760 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:46:35,746 INFO L231 Difference]: Finished difference. Result has 123 places, 145 transitions, 1395 flow [2024-06-20 19:46:35,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1395, PETRI_PLACES=123, PETRI_TRANSITIONS=145} [2024-06-20 19:46:35,746 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 82 predicate places. [2024-06-20 19:46:35,746 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 145 transitions, 1395 flow [2024-06-20 19:46:35,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:35,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:35,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:35,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:46:35,747 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-20 19:46:35,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1809320432, now seen corresponding path program 1 times [2024-06-20 19:46:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277261519] [2024-06-20 19:46:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277261519] [2024-06-20 19:46:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277261519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:46:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014413530] [2024-06-20 19:46:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:45,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:46:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:46:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:46:45,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:46:45,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 145 transitions, 1395 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:45,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:45,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:46:45,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:46,177 INFO L124 PetriNetUnfolderBase]: 1975/2964 cut-off events. [2024-06-20 19:46:46,178 INFO L125 PetriNetUnfolderBase]: For 54883/54883 co-relation queries the response was YES. [2024-06-20 19:46:46,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16992 conditions, 2964 events. 1975/2964 cut-off events. For 54883/54883 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13793 event pairs, 485 based on Foata normal form. 1/2963 useless extension candidates. Maximal degree in co-relation 16937. Up to 2911 conditions per place. [2024-06-20 19:46:46,194 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 147 selfloop transitions, 19 changer transitions 0/169 dead transitions. [2024-06-20 19:46:46,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 169 transitions, 1889 flow [2024-06-20 19:46:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:46:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:46:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-20 19:46:46,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-20 19:46:46,195 INFO L175 Difference]: Start difference. First operand has 123 places, 145 transitions, 1395 flow. Second operand 6 states and 97 transitions. [2024-06-20 19:46:46,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 169 transitions, 1889 flow [2024-06-20 19:46:46,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 169 transitions, 1788 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:46:46,241 INFO L231 Difference]: Finished difference. Result has 124 places, 154 transitions, 1419 flow [2024-06-20 19:46:46,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1419, PETRI_PLACES=124, PETRI_TRANSITIONS=154} [2024-06-20 19:46:46,242 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2024-06-20 19:46:46,242 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 154 transitions, 1419 flow [2024-06-20 19:46:46,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:46,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:46,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:46,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:46:46,242 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-20 19:46:46,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash -492335734, now seen corresponding path program 1 times [2024-06-20 19:46:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:46,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304486253] [2024-06-20 19:46:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:46,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:52,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:52,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304486253] [2024-06-20 19:46:52,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304486253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:52,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:52,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:46:52,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433264505] [2024-06-20 19:46:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:52,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:46:52,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:46:52,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:46:52,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:46:52,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 154 transitions, 1419 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-20 19:46:52,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:52,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:46:52,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:53,797 INFO L124 PetriNetUnfolderBase]: 1965/2952 cut-off events. [2024-06-20 19:46:53,797 INFO L125 PetriNetUnfolderBase]: For 59230/59248 co-relation queries the response was YES. [2024-06-20 19:46:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17154 conditions, 2952 events. 1965/2952 cut-off events. For 59230/59248 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13624 event pairs, 472 based on Foata normal form. 14/2953 useless extension candidates. Maximal degree in co-relation 17097. Up to 2550 conditions per place. [2024-06-20 19:46:53,820 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 115 selfloop transitions, 58 changer transitions 0/176 dead transitions. [2024-06-20 19:46:53,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 176 transitions, 1861 flow [2024-06-20 19:46:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:46:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:46:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-20 19:46:53,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2024-06-20 19:46:53,823 INFO L175 Difference]: Start difference. First operand has 124 places, 154 transitions, 1419 flow. Second operand 7 states and 121 transitions. [2024-06-20 19:46:53,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 176 transitions, 1861 flow [2024-06-20 19:46:53,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 176 transitions, 1831 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-06-20 19:46:53,890 INFO L231 Difference]: Finished difference. Result has 130 places, 154 transitions, 1517 flow [2024-06-20 19:46:53,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1517, PETRI_PLACES=130, PETRI_TRANSITIONS=154} [2024-06-20 19:46:53,895 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2024-06-20 19:46:53,895 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 154 transitions, 1517 flow [2024-06-20 19:46:53,896 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-20 19:46:53,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:53,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:53,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:46:53,896 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-20 19:46:53,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash -492328976, now seen corresponding path program 1 times [2024-06-20 19:46:53,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:53,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351086456] [2024-06-20 19:46:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:00,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351086456] [2024-06-20 19:47:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351086456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398797608] [2024-06-20 19:47:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:00,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:01,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:47:01,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 154 transitions, 1517 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-20 19:47:01,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:01,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:47:01,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:02,174 INFO L124 PetriNetUnfolderBase]: 2057/3104 cut-off events. [2024-06-20 19:47:02,175 INFO L125 PetriNetUnfolderBase]: For 70621/70639 co-relation queries the response was YES. [2024-06-20 19:47:02,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18339 conditions, 3104 events. 2057/3104 cut-off events. For 70621/70639 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14569 event pairs, 487 based on Foata normal form. 34/3125 useless extension candidates. Maximal degree in co-relation 18279. Up to 2564 conditions per place. [2024-06-20 19:47:02,193 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 124 selfloop transitions, 60 changer transitions 0/187 dead transitions. [2024-06-20 19:47:02,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 187 transitions, 2055 flow [2024-06-20 19:47:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-20 19:47:02,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-20 19:47:02,195 INFO L175 Difference]: Start difference. First operand has 130 places, 154 transitions, 1517 flow. Second operand 8 states and 139 transitions. [2024-06-20 19:47:02,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 187 transitions, 2055 flow [2024-06-20 19:47:02,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 187 transitions, 1879 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:47:02,248 INFO L231 Difference]: Finished difference. Result has 131 places, 156 transitions, 1508 flow [2024-06-20 19:47:02,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1508, PETRI_PLACES=131, PETRI_TRANSITIONS=156} [2024-06-20 19:47:02,249 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 90 predicate places. [2024-06-20 19:47:02,249 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 156 transitions, 1508 flow [2024-06-20 19:47:02,250 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-20 19:47:02,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:02,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:02,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:47:02,250 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-20 19:47:02,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:02,250 INFO L85 PathProgramCache]: Analyzing trace with hash -483758096, now seen corresponding path program 2 times [2024-06-20 19:47:02,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215960746] [2024-06-20 19:47:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215960746] [2024-06-20 19:47:09,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215960746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:09,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:09,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:09,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373489732] [2024-06-20 19:47:09,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:09,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:09,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:09,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:09,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:09,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:47:09,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 156 transitions, 1508 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-20 19:47:09,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:09,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:47:09,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:10,301 INFO L124 PetriNetUnfolderBase]: 2074/3131 cut-off events. [2024-06-20 19:47:10,302 INFO L125 PetriNetUnfolderBase]: For 66731/66749 co-relation queries the response was YES. [2024-06-20 19:47:10,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18622 conditions, 3131 events. 2074/3131 cut-off events. For 66731/66749 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14860 event pairs, 477 based on Foata normal form. 16/3141 useless extension candidates. Maximal degree in co-relation 18561. Up to 2878 conditions per place. [2024-06-20 19:47:10,323 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 146 selfloop transitions, 39 changer transitions 0/188 dead transitions. [2024-06-20 19:47:10,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 188 transitions, 2169 flow [2024-06-20 19:47:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-20 19:47:10,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 19:47:10,326 INFO L175 Difference]: Start difference. First operand has 131 places, 156 transitions, 1508 flow. Second operand 8 states and 130 transitions. [2024-06-20 19:47:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 188 transitions, 2169 flow [2024-06-20 19:47:10,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 188 transitions, 2019 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 19:47:10,391 INFO L231 Difference]: Finished difference. Result has 134 places, 161 transitions, 1558 flow [2024-06-20 19:47:10,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1558, PETRI_PLACES=134, PETRI_TRANSITIONS=161} [2024-06-20 19:47:10,391 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2024-06-20 19:47:10,391 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 161 transitions, 1558 flow [2024-06-20 19:47:10,392 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-20 19:47:10,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:10,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:10,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:47:10,392 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-20 19:47:10,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash -484054766, now seen corresponding path program 3 times [2024-06-20 19:47:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:10,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599763927] [2024-06-20 19:47:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599763927] [2024-06-20 19:47:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599763927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:16,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913592359] [2024-06-20 19:47:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:16,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:17,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:47:17,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 161 transitions, 1558 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-20 19:47:17,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:17,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:47:17,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:18,251 INFO L124 PetriNetUnfolderBase]: 2066/3119 cut-off events. [2024-06-20 19:47:18,251 INFO L125 PetriNetUnfolderBase]: For 70281/70299 co-relation queries the response was YES. [2024-06-20 19:47:18,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18598 conditions, 3119 events. 2066/3119 cut-off events. For 70281/70299 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14728 event pairs, 510 based on Foata normal form. 16/3129 useless extension candidates. Maximal degree in co-relation 18535. Up to 2931 conditions per place. [2024-06-20 19:47:18,271 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 148 selfloop transitions, 38 changer transitions 0/189 dead transitions. [2024-06-20 19:47:18,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 189 transitions, 2042 flow [2024-06-20 19:47:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:47:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:47:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-20 19:47:18,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-20 19:47:18,273 INFO L175 Difference]: Start difference. First operand has 134 places, 161 transitions, 1558 flow. Second operand 9 states and 142 transitions. [2024-06-20 19:47:18,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 189 transitions, 2042 flow [2024-06-20 19:47:18,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 189 transitions, 1938 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-20 19:47:18,341 INFO L231 Difference]: Finished difference. Result has 139 places, 161 transitions, 1540 flow [2024-06-20 19:47:18,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1540, PETRI_PLACES=139, PETRI_TRANSITIONS=161} [2024-06-20 19:47:18,342 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-20 19:47:18,342 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 161 transitions, 1540 flow [2024-06-20 19:47:18,342 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-20 19:47:18,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:18,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:18,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:47:18,342 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:18,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash -720414824, now seen corresponding path program 5 times [2024-06-20 19:47:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946119841] [2024-06-20 19:47:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946119841] [2024-06-20 19:47:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946119841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:24,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:24,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:47:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738549775] [2024-06-20 19:47:24,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:24,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:47:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:47:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:47:24,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:47:24,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 161 transitions, 1540 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:24,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:24,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:47:24,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:26,049 INFO L124 PetriNetUnfolderBase]: 2150/3259 cut-off events. [2024-06-20 19:47:26,050 INFO L125 PetriNetUnfolderBase]: For 81823/81841 co-relation queries the response was YES. [2024-06-20 19:47:26,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19316 conditions, 3259 events. 2150/3259 cut-off events. For 81823/81841 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15650 event pairs, 493 based on Foata normal form. 38/3284 useless extension candidates. Maximal degree in co-relation 19251. Up to 2585 conditions per place. [2024-06-20 19:47:26,074 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 121 selfloop transitions, 71 changer transitions 0/195 dead transitions. [2024-06-20 19:47:26,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 195 transitions, 2104 flow [2024-06-20 19:47:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-20 19:47:26,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446875 [2024-06-20 19:47:26,077 INFO L175 Difference]: Start difference. First operand has 139 places, 161 transitions, 1540 flow. Second operand 8 states and 143 transitions. [2024-06-20 19:47:26,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 195 transitions, 2104 flow [2024-06-20 19:47:26,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 2020 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:47:26,149 INFO L231 Difference]: Finished difference. Result has 139 places, 164 transitions, 1658 flow [2024-06-20 19:47:26,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1658, PETRI_PLACES=139, PETRI_TRANSITIONS=164} [2024-06-20 19:47:26,149 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-20 19:47:26,150 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 164 transitions, 1658 flow [2024-06-20 19:47:26,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:26,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:26,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:26,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:47:26,150 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:26,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1286314222, now seen corresponding path program 2 times [2024-06-20 19:47:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:26,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269332381] [2024-06-20 19:47:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:26,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:35,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269332381] [2024-06-20 19:47:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269332381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:35,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:35,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:47:35,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373975678] [2024-06-20 19:47:35,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:35,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:47:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:35,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:47:35,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:47:35,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:47:35,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 164 transitions, 1658 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:35,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:35,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:47:35,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:36,492 INFO L124 PetriNetUnfolderBase]: 2157/3267 cut-off events. [2024-06-20 19:47:36,492 INFO L125 PetriNetUnfolderBase]: For 79766/79766 co-relation queries the response was YES. [2024-06-20 19:47:36,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19992 conditions, 3267 events. 2157/3267 cut-off events. For 79766/79766 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15694 event pairs, 526 based on Foata normal form. 3/3268 useless extension candidates. Maximal degree in co-relation 19926. Up to 3206 conditions per place. [2024-06-20 19:47:36,520 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 158 selfloop transitions, 21 changer transitions 0/182 dead transitions. [2024-06-20 19:47:36,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 182 transitions, 2108 flow [2024-06-20 19:47:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:47:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:47:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-20 19:47:36,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-06-20 19:47:36,522 INFO L175 Difference]: Start difference. First operand has 139 places, 164 transitions, 1658 flow. Second operand 5 states and 89 transitions. [2024-06-20 19:47:36,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 182 transitions, 2108 flow [2024-06-20 19:47:36,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 182 transitions, 1932 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-20 19:47:36,613 INFO L231 Difference]: Finished difference. Result has 138 places, 167 transitions, 1583 flow [2024-06-20 19:47:36,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1583, PETRI_PLACES=138, PETRI_TRANSITIONS=167} [2024-06-20 19:47:36,613 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places. [2024-06-20 19:47:36,613 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 167 transitions, 1583 flow [2024-06-20 19:47:36,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:36,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:36,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:36,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:47:36,614 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-20 19:47:36,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash 641447828, now seen corresponding path program 1 times [2024-06-20 19:47:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474683850] [2024-06-20 19:47:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474683850] [2024-06-20 19:47:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474683850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:43,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:43,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:47:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194334187] [2024-06-20 19:47:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:43,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:47:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:47:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:47:43,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:47:43,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 167 transitions, 1583 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-20 19:47:43,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:43,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:47:43,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:44,424 INFO L124 PetriNetUnfolderBase]: 2174/3294 cut-off events. [2024-06-20 19:47:44,424 INFO L125 PetriNetUnfolderBase]: For 83310/83337 co-relation queries the response was YES. [2024-06-20 19:47:44,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20048 conditions, 3294 events. 2174/3294 cut-off events. For 83310/83337 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15855 event pairs, 351 based on Foata normal form. 24/3312 useless extension candidates. Maximal degree in co-relation 19981. Up to 3070 conditions per place. [2024-06-20 19:47:44,451 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 164 selfloop transitions, 30 changer transitions 0/197 dead transitions. [2024-06-20 19:47:44,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 197 transitions, 2111 flow [2024-06-20 19:47:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-20 19:47:44,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:47:44,454 INFO L175 Difference]: Start difference. First operand has 138 places, 167 transitions, 1583 flow. Second operand 8 states and 128 transitions. [2024-06-20 19:47:44,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 197 transitions, 2111 flow [2024-06-20 19:47:44,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 197 transitions, 2066 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-20 19:47:44,544 INFO L231 Difference]: Finished difference. Result has 143 places, 169 transitions, 1644 flow [2024-06-20 19:47:44,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1644, PETRI_PLACES=143, PETRI_TRANSITIONS=169} [2024-06-20 19:47:44,549 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2024-06-20 19:47:44,549 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 169 transitions, 1644 flow [2024-06-20 19:47:44,549 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-20 19:47:44,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:44,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:44,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:47:44,550 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-20 19:47:44,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -799619320, now seen corresponding path program 2 times [2024-06-20 19:47:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933965378] [2024-06-20 19:47:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:44,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933965378] [2024-06-20 19:47:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933965378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:47:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287659926] [2024-06-20 19:47:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:51,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:47:51,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:47:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:47:51,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:47:51,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 169 transitions, 1644 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-20 19:47:51,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:51,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:47:51,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:52,899 INFO L124 PetriNetUnfolderBase]: 2191/3322 cut-off events. [2024-06-20 19:47:52,899 INFO L125 PetriNetUnfolderBase]: For 89455/89476 co-relation queries the response was YES. [2024-06-20 19:47:52,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20615 conditions, 3322 events. 2191/3322 cut-off events. For 89455/89476 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16050 event pairs, 483 based on Foata normal form. 18/3334 useless extension candidates. Maximal degree in co-relation 20547. Up to 3113 conditions per place. [2024-06-20 19:47:52,927 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 159 selfloop transitions, 37 changer transitions 0/199 dead transitions. [2024-06-20 19:47:52,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 199 transitions, 2188 flow [2024-06-20 19:47:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-20 19:47:52,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 19:47:52,929 INFO L175 Difference]: Start difference. First operand has 143 places, 169 transitions, 1644 flow. Second operand 8 states and 130 transitions. [2024-06-20 19:47:52,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 199 transitions, 2188 flow [2024-06-20 19:47:53,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 199 transitions, 2102 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-20 19:47:53,034 INFO L231 Difference]: Finished difference. Result has 145 places, 171 transitions, 1682 flow [2024-06-20 19:47:53,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1682, PETRI_PLACES=145, PETRI_TRANSITIONS=171} [2024-06-20 19:47:53,035 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places. [2024-06-20 19:47:53,035 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 171 transitions, 1682 flow [2024-06-20 19:47:53,035 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-20 19:47:53,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:53,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:53,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:47:53,036 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-20 19:47:53,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash -799623040, now seen corresponding path program 3 times [2024-06-20 19:47:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:53,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482600167] [2024-06-20 19:47:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:00,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482600167] [2024-06-20 19:48:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482600167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:00,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:00,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:48:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462182108] [2024-06-20 19:48:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:00,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:48:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:00,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:48:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:48:00,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:48:00,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 171 transitions, 1682 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-20 19:48:00,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:00,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:48:00,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:01,453 INFO L124 PetriNetUnfolderBase]: 2208/3349 cut-off events. [2024-06-20 19:48:01,454 INFO L125 PetriNetUnfolderBase]: For 96600/96621 co-relation queries the response was YES. [2024-06-20 19:48:01,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21104 conditions, 3349 events. 2208/3349 cut-off events. For 96600/96621 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16234 event pairs, 483 based on Foata normal form. 18/3361 useless extension candidates. Maximal degree in co-relation 21035. Up to 3089 conditions per place. [2024-06-20 19:48:01,479 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 160 selfloop transitions, 38 changer transitions 0/201 dead transitions. [2024-06-20 19:48:01,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 201 transitions, 2230 flow [2024-06-20 19:48:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:48:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:48:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-20 19:48:01,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-20 19:48:01,482 INFO L175 Difference]: Start difference. First operand has 145 places, 171 transitions, 1682 flow. Second operand 8 states and 131 transitions. [2024-06-20 19:48:01,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 201 transitions, 2230 flow [2024-06-20 19:48:01,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 201 transitions, 2126 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 19:48:01,611 INFO L231 Difference]: Finished difference. Result has 147 places, 173 transitions, 1707 flow [2024-06-20 19:48:01,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1707, PETRI_PLACES=147, PETRI_TRANSITIONS=173} [2024-06-20 19:48:01,611 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 106 predicate places. [2024-06-20 19:48:01,612 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 173 transitions, 1707 flow [2024-06-20 19:48:01,612 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-20 19:48:01,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:01,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:01,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:48:01,612 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:01,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash -9105484, now seen corresponding path program 1 times [2024-06-20 19:48:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476199520] [2024-06-20 19:48:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476199520] [2024-06-20 19:48:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476199520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:08,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:48:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216829397] [2024-06-20 19:48:08,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:08,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:48:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:08,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:48:08,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:48:09,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:48:09,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 173 transitions, 1707 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-20 19:48:09,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:09,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:48:09,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:10,495 INFO L124 PetriNetUnfolderBase]: 2322/3533 cut-off events. [2024-06-20 19:48:10,496 INFO L125 PetriNetUnfolderBase]: For 111769/111805 co-relation queries the response was YES. [2024-06-20 19:48:10,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22294 conditions, 3533 events. 2322/3533 cut-off events. For 111769/111805 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17421 event pairs, 490 based on Foata normal form. 44/3567 useless extension candidates. Maximal degree in co-relation 22224. Up to 3209 conditions per place. [2024-06-20 19:48:10,523 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 176 selfloop transitions, 37 changer transitions 0/216 dead transitions. [2024-06-20 19:48:10,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 216 transitions, 2357 flow [2024-06-20 19:48:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:48:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:48:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-20 19:48:10,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-20 19:48:10,526 INFO L175 Difference]: Start difference. First operand has 147 places, 173 transitions, 1707 flow. Second operand 9 states and 149 transitions. [2024-06-20 19:48:10,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 216 transitions, 2357 flow [2024-06-20 19:48:10,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 216 transitions, 2242 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-20 19:48:10,623 INFO L231 Difference]: Finished difference. Result has 151 places, 179 transitions, 1758 flow [2024-06-20 19:48:10,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1758, PETRI_PLACES=151, PETRI_TRANSITIONS=179} [2024-06-20 19:48:10,624 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2024-06-20 19:48:10,624 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 179 transitions, 1758 flow [2024-06-20 19:48:10,624 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-20 19:48:10,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:10,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:10,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:48:10,625 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:10,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash -574729820, now seen corresponding path program 1 times [2024-06-20 19:48:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:10,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795191425] [2024-06-20 19:48:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:21,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795191425] [2024-06-20 19:48:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795191425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:21,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:48:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651238420] [2024-06-20 19:48:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:21,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:48:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:48:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:48:21,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:48:21,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 179 transitions, 1758 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:21,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:21,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:48:21,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:22,509 INFO L124 PetriNetUnfolderBase]: 2332/3546 cut-off events. [2024-06-20 19:48:22,509 INFO L125 PetriNetUnfolderBase]: For 109475/109475 co-relation queries the response was YES. [2024-06-20 19:48:22,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22596 conditions, 3546 events. 2332/3546 cut-off events. For 109475/109475 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17509 event pairs, 514 based on Foata normal form. 2/3546 useless extension candidates. Maximal degree in co-relation 22524. Up to 3419 conditions per place. [2024-06-20 19:48:22,538 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 172 selfloop transitions, 33 changer transitions 0/208 dead transitions. [2024-06-20 19:48:22,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 208 transitions, 2372 flow [2024-06-20 19:48:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:48:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:48:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-20 19:48:22,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-20 19:48:22,541 INFO L175 Difference]: Start difference. First operand has 151 places, 179 transitions, 1758 flow. Second operand 7 states and 117 transitions. [2024-06-20 19:48:22,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 208 transitions, 2372 flow [2024-06-20 19:48:22,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 208 transitions, 2282 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:48:22,689 INFO L231 Difference]: Finished difference. Result has 152 places, 185 transitions, 1801 flow [2024-06-20 19:48:22,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1801, PETRI_PLACES=152, PETRI_TRANSITIONS=185} [2024-06-20 19:48:22,690 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 111 predicate places. [2024-06-20 19:48:22,690 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 185 transitions, 1801 flow [2024-06-20 19:48:22,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:22,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:22,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:22,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:48:22,690 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-20 19:48:22,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1054720992, now seen corresponding path program 2 times [2024-06-20 19:48:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280137773] [2024-06-20 19:48:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:30,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:30,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280137773] [2024-06-20 19:48:30,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280137773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:30,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:30,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:48:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341832198] [2024-06-20 19:48:30,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:30,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:48:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:30,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:48:30,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:48:30,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:48:30,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 185 transitions, 1801 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-20 19:48:30,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:30,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:48:30,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:31,655 INFO L124 PetriNetUnfolderBase]: 2526/3866 cut-off events. [2024-06-20 19:48:31,655 INFO L125 PetriNetUnfolderBase]: For 137826/137844 co-relation queries the response was YES. [2024-06-20 19:48:31,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25365 conditions, 3866 events. 2526/3866 cut-off events. For 137826/137844 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19659 event pairs, 453 based on Foata normal form. 26/3879 useless extension candidates. Maximal degree in co-relation 25292. Up to 2807 conditions per place. [2024-06-20 19:48:31,684 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 140 selfloop transitions, 81 changer transitions 0/224 dead transitions. [2024-06-20 19:48:31,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 224 transitions, 2603 flow [2024-06-20 19:48:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:48:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:48:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-20 19:48:31,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-20 19:48:31,687 INFO L175 Difference]: Start difference. First operand has 152 places, 185 transitions, 1801 flow. Second operand 8 states and 145 transitions. [2024-06-20 19:48:31,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 224 transitions, 2603 flow [2024-06-20 19:48:31,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 224 transitions, 2559 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-20 19:48:31,791 INFO L231 Difference]: Finished difference. Result has 157 places, 187 transitions, 1995 flow [2024-06-20 19:48:31,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1757, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1995, PETRI_PLACES=157, PETRI_TRANSITIONS=187} [2024-06-20 19:48:31,793 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 116 predicate places. [2024-06-20 19:48:31,793 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 187 transitions, 1995 flow [2024-06-20 19:48:31,793 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-20 19:48:31,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:31,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:31,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:48:31,793 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-20 19:48:31,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash -934532150, now seen corresponding path program 3 times [2024-06-20 19:48:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855046601] [2024-06-20 19:48:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855046601] [2024-06-20 19:48:38,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855046601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:38,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:38,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:48:38,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458001693] [2024-06-20 19:48:38,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:38,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:48:38,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:38,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:48:38,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:48:38,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:48:38,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 187 transitions, 1995 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-20 19:48:38,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:38,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:48:38,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:40,265 INFO L124 PetriNetUnfolderBase]: 2618/4018 cut-off events. [2024-06-20 19:48:40,265 INFO L125 PetriNetUnfolderBase]: For 154286/154304 co-relation queries the response was YES. [2024-06-20 19:48:40,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26965 conditions, 4018 events. 2618/4018 cut-off events. For 154286/154304 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 20785 event pairs, 550 based on Foata normal form. 34/4039 useless extension candidates. Maximal degree in co-relation 26890. Up to 3349 conditions per place. [2024-06-20 19:48:40,295 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 139 selfloop transitions, 78 changer transitions 0/220 dead transitions. [2024-06-20 19:48:40,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 220 transitions, 2617 flow [2024-06-20 19:48:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:48:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:48:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-20 19:48:40,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2024-06-20 19:48:40,300 INFO L175 Difference]: Start difference. First operand has 157 places, 187 transitions, 1995 flow. Second operand 8 states and 141 transitions. [2024-06-20 19:48:40,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 220 transitions, 2617 flow [2024-06-20 19:48:40,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 220 transitions, 2499 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 19:48:40,440 INFO L231 Difference]: Finished difference. Result has 161 places, 189 transitions, 2096 flow [2024-06-20 19:48:40,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2096, PETRI_PLACES=161, PETRI_TRANSITIONS=189} [2024-06-20 19:48:40,450 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places. [2024-06-20 19:48:40,451 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 189 transitions, 2096 flow [2024-06-20 19:48:40,451 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-20 19:48:40,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:40,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:40,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:48:40,451 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-20 19:48:40,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -940246442, now seen corresponding path program 4 times [2024-06-20 19:48:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:40,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349228670] [2024-06-20 19:48:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:40,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:47,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:47,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349228670] [2024-06-20 19:48:47,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349228670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:47,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:47,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:48:47,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224467235] [2024-06-20 19:48:47,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:47,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:48:47,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:47,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:48:47,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:48:47,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:48:47,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 189 transitions, 2096 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-20 19:48:47,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:47,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:48:47,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:49,389 INFO L124 PetriNetUnfolderBase]: 2610/4006 cut-off events. [2024-06-20 19:48:49,389 INFO L125 PetriNetUnfolderBase]: For 148916/148934 co-relation queries the response was YES. [2024-06-20 19:48:49,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27255 conditions, 4006 events. 2610/4006 cut-off events. For 148916/148934 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 20724 event pairs, 553 based on Foata normal form. 14/4007 useless extension candidates. Maximal degree in co-relation 27178. Up to 3457 conditions per place. [2024-06-20 19:48:49,427 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 139 selfloop transitions, 76 changer transitions 0/218 dead transitions. [2024-06-20 19:48:49,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 218 transitions, 2694 flow [2024-06-20 19:48:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:48:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:48:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-20 19:48:49,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-20 19:48:49,430 INFO L175 Difference]: Start difference. First operand has 161 places, 189 transitions, 2096 flow. Second operand 8 states and 135 transitions. [2024-06-20 19:48:49,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 218 transitions, 2694 flow [2024-06-20 19:48:49,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 218 transitions, 2507 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-20 19:48:49,705 INFO L231 Difference]: Finished difference. Result has 163 places, 191 transitions, 2126 flow [2024-06-20 19:48:49,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2126, PETRI_PLACES=163, PETRI_TRANSITIONS=191} [2024-06-20 19:48:49,706 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 122 predicate places. [2024-06-20 19:48:49,706 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 191 transitions, 2126 flow [2024-06-20 19:48:49,706 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-20 19:48:49,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:49,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:49,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:48:49,707 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:49,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1791576034, now seen corresponding path program 5 times [2024-06-20 19:48:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:49,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879847307] [2024-06-20 19:48:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879847307] [2024-06-20 19:48:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879847307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:48:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596352253] [2024-06-20 19:48:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:56,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:48:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:56,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:48:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:48:57,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:48:57,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 191 transitions, 2126 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-20 19:48:57,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:57,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:48:57,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:58,501 INFO L124 PetriNetUnfolderBase]: 2602/3994 cut-off events. [2024-06-20 19:48:58,502 INFO L125 PetriNetUnfolderBase]: For 151584/151602 co-relation queries the response was YES. [2024-06-20 19:48:58,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27030 conditions, 3994 events. 2602/3994 cut-off events. For 151584/151602 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20634 event pairs, 551 based on Foata normal form. 14/3995 useless extension candidates. Maximal degree in co-relation 26952. Up to 3100 conditions per place. [2024-06-20 19:48:58,543 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 138 selfloop transitions, 83 changer transitions 0/224 dead transitions. [2024-06-20 19:48:58,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 224 transitions, 2756 flow [2024-06-20 19:48:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:48:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:48:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-20 19:48:58,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-20 19:48:58,546 INFO L175 Difference]: Start difference. First operand has 163 places, 191 transitions, 2126 flow. Second operand 8 states and 139 transitions. [2024-06-20 19:48:58,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 224 transitions, 2756 flow [2024-06-20 19:48:58,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 224 transitions, 2559 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-20 19:48:58,754 INFO L231 Difference]: Finished difference. Result has 165 places, 193 transitions, 2161 flow [2024-06-20 19:48:58,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2161, PETRI_PLACES=165, PETRI_TRANSITIONS=193} [2024-06-20 19:48:58,755 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2024-06-20 19:48:58,755 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 193 transitions, 2161 flow [2024-06-20 19:48:58,755 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-20 19:48:58,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:58,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:58,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:48:58,756 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:58,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1791729856, now seen corresponding path program 4 times [2024-06-20 19:48:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:58,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929587683] [2024-06-20 19:48:58,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929587683] [2024-06-20 19:49:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929587683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:49:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085109207] [2024-06-20 19:49:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:05,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:49:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:49:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:49:05,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:49:05,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 193 transitions, 2161 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-20 19:49:05,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:05,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:49:05,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:07,367 INFO L124 PetriNetUnfolderBase]: 2627/4041 cut-off events. [2024-06-20 19:49:07,368 INFO L125 PetriNetUnfolderBase]: For 165970/165988 co-relation queries the response was YES. [2024-06-20 19:49:07,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27331 conditions, 4041 events. 2627/4041 cut-off events. For 165970/165988 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21003 event pairs, 480 based on Foata normal form. 30/4058 useless extension candidates. Maximal degree in co-relation 27252. Up to 3316 conditions per place. [2024-06-20 19:49:07,400 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 149 selfloop transitions, 73 changer transitions 0/225 dead transitions. [2024-06-20 19:49:07,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 225 transitions, 2783 flow [2024-06-20 19:49:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:49:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:49:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-20 19:49:07,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2024-06-20 19:49:07,407 INFO L175 Difference]: Start difference. First operand has 165 places, 193 transitions, 2161 flow. Second operand 8 states and 141 transitions. [2024-06-20 19:49:07,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 225 transitions, 2783 flow [2024-06-20 19:49:07,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 225 transitions, 2567 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-20 19:49:07,578 INFO L231 Difference]: Finished difference. Result has 167 places, 194 transitions, 2147 flow [2024-06-20 19:49:07,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2147, PETRI_PLACES=167, PETRI_TRANSITIONS=194} [2024-06-20 19:49:07,579 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2024-06-20 19:49:07,579 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 194 transitions, 2147 flow [2024-06-20 19:49:07,579 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-20 19:49:07,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:07,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:07,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:49:07,580 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:07,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 598088050, now seen corresponding path program 2 times [2024-06-20 19:49:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206027299] [2024-06-20 19:49:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:18,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206027299] [2024-06-20 19:49:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206027299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856055946] [2024-06-20 19:49:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:18,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:18,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:18,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:49:18,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 194 transitions, 2147 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:18,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:18,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:49:18,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:19,786 INFO L124 PetriNetUnfolderBase]: 2637/4050 cut-off events. [2024-06-20 19:49:19,787 INFO L125 PetriNetUnfolderBase]: For 160774/160780 co-relation queries the response was YES. [2024-06-20 19:49:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27463 conditions, 4050 events. 2637/4050 cut-off events. For 160774/160780 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21097 event pairs, 591 based on Foata normal form. 8/4056 useless extension candidates. Maximal degree in co-relation 27383. Up to 3922 conditions per place. [2024-06-20 19:49:19,821 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 178 selfloop transitions, 35 changer transitions 0/216 dead transitions. [2024-06-20 19:49:19,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 216 transitions, 2751 flow [2024-06-20 19:49:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:49:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:49:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-20 19:49:19,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-20 19:49:19,824 INFO L175 Difference]: Start difference. First operand has 167 places, 194 transitions, 2147 flow. Second operand 7 states and 113 transitions. [2024-06-20 19:49:19,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 216 transitions, 2751 flow [2024-06-20 19:49:20,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 216 transitions, 2591 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 19:49:20,026 INFO L231 Difference]: Finished difference. Result has 168 places, 197 transitions, 2091 flow [2024-06-20 19:49:20,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2091, PETRI_PLACES=168, PETRI_TRANSITIONS=197} [2024-06-20 19:49:20,027 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2024-06-20 19:49:20,027 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 197 transitions, 2091 flow [2024-06-20 19:49:20,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:20,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:20,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:20,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:49:20,028 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:20,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1231211354, now seen corresponding path program 1 times [2024-06-20 19:49:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866447874] [2024-06-20 19:49:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:30,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866447874] [2024-06-20 19:49:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866447874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:30,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:30,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345055901] [2024-06-20 19:49:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:30,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:30,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:30,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:49:30,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 197 transitions, 2091 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:30,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:30,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:49:30,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:31,766 INFO L124 PetriNetUnfolderBase]: 2647/4067 cut-off events. [2024-06-20 19:49:31,767 INFO L125 PetriNetUnfolderBase]: For 165558/165558 co-relation queries the response was YES. [2024-06-20 19:49:31,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27261 conditions, 4067 events. 2647/4067 cut-off events. For 165558/165558 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21218 event pairs, 610 based on Foata normal form. 2/4067 useless extension candidates. Maximal degree in co-relation 27180. Up to 3986 conditions per place. [2024-06-20 19:49:31,800 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 190 selfloop transitions, 29 changer transitions 0/222 dead transitions. [2024-06-20 19:49:31,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 222 transitions, 2757 flow [2024-06-20 19:49:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:49:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:49:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-20 19:49:31,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-20 19:49:31,802 INFO L175 Difference]: Start difference. First operand has 168 places, 197 transitions, 2091 flow. Second operand 7 states and 113 transitions. [2024-06-20 19:49:31,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 222 transitions, 2757 flow [2024-06-20 19:49:31,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 222 transitions, 2696 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 19:49:31,984 INFO L231 Difference]: Finished difference. Result has 171 places, 203 transitions, 2188 flow [2024-06-20 19:49:31,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2188, PETRI_PLACES=171, PETRI_TRANSITIONS=203} [2024-06-20 19:49:31,985 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 130 predicate places. [2024-06-20 19:49:31,985 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 203 transitions, 2188 flow [2024-06-20 19:49:31,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:31,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:31,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:31,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:49:31,985 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-20 19:49:31,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1055733122, now seen corresponding path program 5 times [2024-06-20 19:49:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:31,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266421130] [2024-06-20 19:49:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266421130] [2024-06-20 19:49:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266421130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:38,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:49:38,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324025754] [2024-06-20 19:49:38,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:38,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:49:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:49:38,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:49:38,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:49:38,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 203 transitions, 2188 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-20 19:49:38,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:38,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:49:38,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:39,904 INFO L124 PetriNetUnfolderBase]: 2766/4270 cut-off events. [2024-06-20 19:49:39,904 INFO L125 PetriNetUnfolderBase]: For 196373/196391 co-relation queries the response was YES. [2024-06-20 19:49:39,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29285 conditions, 4270 events. 2766/4270 cut-off events. For 196373/196391 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 22558 event pairs, 593 based on Foata normal form. 26/4283 useless extension candidates. Maximal degree in co-relation 29203. Up to 3230 conditions per place. [2024-06-20 19:49:39,936 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 162 selfloop transitions, 76 changer transitions 0/241 dead transitions. [2024-06-20 19:49:39,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 241 transitions, 3042 flow [2024-06-20 19:49:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:49:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:49:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-20 19:49:39,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-20 19:49:39,939 INFO L175 Difference]: Start difference. First operand has 171 places, 203 transitions, 2188 flow. Second operand 8 states and 145 transitions. [2024-06-20 19:49:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 241 transitions, 3042 flow [2024-06-20 19:49:40,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 241 transitions, 2987 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-20 19:49:40,132 INFO L231 Difference]: Finished difference. Result has 176 places, 205 transitions, 2370 flow [2024-06-20 19:49:40,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2370, PETRI_PLACES=176, PETRI_TRANSITIONS=205} [2024-06-20 19:49:40,133 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places. [2024-06-20 19:49:40,133 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 205 transitions, 2370 flow [2024-06-20 19:49:40,133 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-20 19:49:40,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:40,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:40,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:49:40,134 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:40,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2111597616, now seen corresponding path program 6 times [2024-06-20 19:49:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877654674] [2024-06-20 19:49:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:45,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877654674] [2024-06-20 19:49:45,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877654674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:45,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:49:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770418655] [2024-06-20 19:49:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:45,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:49:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:49:45,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:49:45,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:49:45,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 205 transitions, 2370 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-20 19:49:45,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:45,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:49:45,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:47,289 INFO L124 PetriNetUnfolderBase]: 2835/4393 cut-off events. [2024-06-20 19:49:47,290 INFO L125 PetriNetUnfolderBase]: For 213945/213963 co-relation queries the response was YES. [2024-06-20 19:49:47,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30773 conditions, 4393 events. 2835/4393 cut-off events. For 213945/213963 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23490 event pairs, 559 based on Foata normal form. 26/4406 useless extension candidates. Maximal degree in co-relation 30690. Up to 2346 conditions per place. [2024-06-20 19:49:47,328 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 154 selfloop transitions, 85 changer transitions 0/243 dead transitions. [2024-06-20 19:49:47,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 243 transitions, 3230 flow [2024-06-20 19:49:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:49:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:49:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-20 19:49:47,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-20 19:49:47,340 INFO L175 Difference]: Start difference. First operand has 176 places, 205 transitions, 2370 flow. Second operand 7 states and 148 transitions. [2024-06-20 19:49:47,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 243 transitions, 3230 flow [2024-06-20 19:49:47,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 243 transitions, 3116 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-20 19:49:47,588 INFO L231 Difference]: Finished difference. Result has 179 places, 207 transitions, 2514 flow [2024-06-20 19:49:47,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2514, PETRI_PLACES=179, PETRI_TRANSITIONS=207} [2024-06-20 19:49:47,596 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 138 predicate places. [2024-06-20 19:49:47,596 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 207 transitions, 2514 flow [2024-06-20 19:49:47,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-20 19:49:47,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:47,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:47,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:49:47,599 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-20 19:49:47,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash -876948314, now seen corresponding path program 2 times [2024-06-20 19:49:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885629017] [2024-06-20 19:49:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:58,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885629017] [2024-06-20 19:49:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885629017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901797124] [2024-06-20 19:49:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:58,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:58,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:49:58,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 207 transitions, 2514 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:58,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:58,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:49:58,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:59,989 INFO L124 PetriNetUnfolderBase]: 2829/4383 cut-off events. [2024-06-20 19:49:59,990 INFO L125 PetriNetUnfolderBase]: For 209055/209055 co-relation queries the response was YES. [2024-06-20 19:50:00,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31119 conditions, 4383 events. 2829/4383 cut-off events. For 209055/209055 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23578 event pairs, 689 based on Foata normal form. 2/4383 useless extension candidates. Maximal degree in co-relation 31034. Up to 4316 conditions per place. [2024-06-20 19:50:00,032 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 197 selfloop transitions, 24 changer transitions 0/224 dead transitions. [2024-06-20 19:50:00,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 224 transitions, 3016 flow [2024-06-20 19:50:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:50:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:50:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-20 19:50:00,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2024-06-20 19:50:00,033 INFO L175 Difference]: Start difference. First operand has 179 places, 207 transitions, 2514 flow. Second operand 6 states and 101 transitions. [2024-06-20 19:50:00,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 224 transitions, 3016 flow [2024-06-20 19:50:00,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 224 transitions, 2891 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-20 19:50:00,323 INFO L231 Difference]: Finished difference. Result has 182 places, 207 transitions, 2443 flow [2024-06-20 19:50:00,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2389, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2443, PETRI_PLACES=182, PETRI_TRANSITIONS=207} [2024-06-20 19:50:00,323 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2024-06-20 19:50:00,323 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 207 transitions, 2443 flow [2024-06-20 19:50:00,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:00,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:00,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:00,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:50:00,324 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-20 19:50:00,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1381001840, now seen corresponding path program 3 times [2024-06-20 19:50:00,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:00,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408458514] [2024-06-20 19:50:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:10,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:10,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408458514] [2024-06-20 19:50:10,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408458514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:10,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:10,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:50:10,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708808728] [2024-06-20 19:50:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:10,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:50:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:10,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:50:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:50:10,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:50:10,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 207 transitions, 2443 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:10,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:10,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:50:10,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:12,177 INFO L124 PetriNetUnfolderBase]: 2843/4403 cut-off events. [2024-06-20 19:50:12,177 INFO L125 PetriNetUnfolderBase]: For 214546/214546 co-relation queries the response was YES. [2024-06-20 19:50:12,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31065 conditions, 4403 events. 2843/4403 cut-off events. For 214546/214546 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23637 event pairs, 680 based on Foata normal form. 6/4407 useless extension candidates. Maximal degree in co-relation 30977. Up to 4268 conditions per place. [2024-06-20 19:50:12,218 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 193 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2024-06-20 19:50:12,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 233 transitions, 3027 flow [2024-06-20 19:50:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:50:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:50:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-20 19:50:12,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-20 19:50:12,220 INFO L175 Difference]: Start difference. First operand has 182 places, 207 transitions, 2443 flow. Second operand 6 states and 110 transitions. [2024-06-20 19:50:12,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 233 transitions, 3027 flow [2024-06-20 19:50:12,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 233 transitions, 2938 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-20 19:50:12,484 INFO L231 Difference]: Finished difference. Result has 183 places, 210 transitions, 2494 flow [2024-06-20 19:50:12,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2354, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2494, PETRI_PLACES=183, PETRI_TRANSITIONS=210} [2024-06-20 19:50:12,485 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 142 predicate places. [2024-06-20 19:50:12,485 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 210 transitions, 2494 flow [2024-06-20 19:50:12,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:12,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:12,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:12,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:50:12,485 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-20 19:50:12,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:12,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1054015478, now seen corresponding path program 1 times [2024-06-20 19:50:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163922632] [2024-06-20 19:50:12,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163922632] [2024-06-20 19:50:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163922632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:20,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:20,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:50:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600983759] [2024-06-20 19:50:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:20,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:50:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:20,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:50:20,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:50:20,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:50:20,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 210 transitions, 2494 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-20 19:50:20,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:20,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:50:20,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:21,755 INFO L124 PetriNetUnfolderBase]: 2861/4430 cut-off events. [2024-06-20 19:50:21,756 INFO L125 PetriNetUnfolderBase]: For 220839/220860 co-relation queries the response was YES. [2024-06-20 19:50:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31883 conditions, 4430 events. 2861/4430 cut-off events. For 220839/220860 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23817 event pairs, 696 based on Foata normal form. 16/4440 useless extension candidates. Maximal degree in co-relation 31794. Up to 4260 conditions per place. [2024-06-20 19:50:21,794 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 199 selfloop transitions, 40 changer transitions 0/242 dead transitions. [2024-06-20 19:50:21,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 242 transitions, 3408 flow [2024-06-20 19:50:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:50:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:50:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-20 19:50:21,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-20 19:50:21,796 INFO L175 Difference]: Start difference. First operand has 183 places, 210 transitions, 2494 flow. Second operand 7 states and 115 transitions. [2024-06-20 19:50:21,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 242 transitions, 3408 flow [2024-06-20 19:50:22,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 242 transitions, 3334 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-20 19:50:22,077 INFO L231 Difference]: Finished difference. Result has 187 places, 223 transitions, 2731 flow [2024-06-20 19:50:22,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2731, PETRI_PLACES=187, PETRI_TRANSITIONS=223} [2024-06-20 19:50:22,077 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places. [2024-06-20 19:50:22,078 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 223 transitions, 2731 flow [2024-06-20 19:50:22,078 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-20 19:50:22,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:22,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:22,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:50:22,078 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-20 19:50:22,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1053895508, now seen corresponding path program 2 times [2024-06-20 19:50:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:22,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717456144] [2024-06-20 19:50:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:22,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:30,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:30,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717456144] [2024-06-20 19:50:30,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717456144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:30,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:30,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:50:30,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274552170] [2024-06-20 19:50:30,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:30,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:50:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:30,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:50:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:50:30,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:50:30,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 223 transitions, 2731 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-20 19:50:30,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:30,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:50:30,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:31,845 INFO L124 PetriNetUnfolderBase]: 2960/4566 cut-off events. [2024-06-20 19:50:31,845 INFO L125 PetriNetUnfolderBase]: For 241792/241792 co-relation queries the response was YES. [2024-06-20 19:50:31,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33866 conditions, 4566 events. 2960/4566 cut-off events. For 241792/241792 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24543 event pairs, 690 based on Foata normal form. 6/4570 useless extension candidates. Maximal degree in co-relation 33775. Up to 4449 conditions per place. [2024-06-20 19:50:31,883 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 226 selfloop transitions, 36 changer transitions 0/265 dead transitions. [2024-06-20 19:50:31,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 265 transitions, 3745 flow [2024-06-20 19:50:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:50:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:50:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-20 19:50:31,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:50:31,885 INFO L175 Difference]: Start difference. First operand has 187 places, 223 transitions, 2731 flow. Second operand 8 states and 128 transitions. [2024-06-20 19:50:31,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 265 transitions, 3745 flow [2024-06-20 19:50:32,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 265 transitions, 3625 flow, removed 52 selfloop flow, removed 2 redundant places. [2024-06-20 19:50:32,264 INFO L231 Difference]: Finished difference. Result has 194 places, 243 transitions, 3062 flow [2024-06-20 19:50:32,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3062, PETRI_PLACES=194, PETRI_TRANSITIONS=243} [2024-06-20 19:50:32,265 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places. [2024-06-20 19:50:32,265 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 243 transitions, 3062 flow [2024-06-20 19:50:32,265 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-20 19:50:32,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:32,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:32,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:50:32,266 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-20 19:50:32,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1347749132, now seen corresponding path program 3 times [2024-06-20 19:50:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:32,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464249663] [2024-06-20 19:50:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:39,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:39,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464249663] [2024-06-20 19:50:39,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464249663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:39,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:39,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:50:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624361633] [2024-06-20 19:50:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:50:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:39,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:50:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:50:40,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:50:40,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 243 transitions, 3062 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-20 19:50:40,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:40,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:50:40,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:41,616 INFO L124 PetriNetUnfolderBase]: 3051/4693 cut-off events. [2024-06-20 19:50:41,616 INFO L125 PetriNetUnfolderBase]: For 259039/259039 co-relation queries the response was YES. [2024-06-20 19:50:41,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35758 conditions, 4693 events. 3051/4693 cut-off events. For 259039/259039 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 25230 event pairs, 698 based on Foata normal form. 6/4697 useless extension candidates. Maximal degree in co-relation 35664. Up to 4488 conditions per place. [2024-06-20 19:50:41,665 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 230 selfloop transitions, 57 changer transitions 0/290 dead transitions. [2024-06-20 19:50:41,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 290 transitions, 4159 flow [2024-06-20 19:50:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:50:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:50:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-20 19:50:41,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-20 19:50:41,666 INFO L175 Difference]: Start difference. First operand has 194 places, 243 transitions, 3062 flow. Second operand 7 states and 127 transitions. [2024-06-20 19:50:41,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 290 transitions, 4159 flow [2024-06-20 19:50:41,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 290 transitions, 3995 flow, removed 69 selfloop flow, removed 3 redundant places. [2024-06-20 19:50:41,985 INFO L231 Difference]: Finished difference. Result has 200 places, 264 transitions, 3453 flow [2024-06-20 19:50:41,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2901, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3453, PETRI_PLACES=200, PETRI_TRANSITIONS=264} [2024-06-20 19:50:41,986 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places. [2024-06-20 19:50:41,986 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 264 transitions, 3453 flow [2024-06-20 19:50:41,986 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-20 19:50:41,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:41,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:41,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:50:41,987 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:50:41,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1380570878, now seen corresponding path program 1 times [2024-06-20 19:50:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550185555] [2024-06-20 19:50:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:52,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-20 19:50:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550185555] [2024-06-20 19:50:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550185555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:52,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:50:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690459169] [2024-06-20 19:50:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:52,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:50:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:50:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:50:52,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:50:52,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 264 transitions, 3453 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-20 19:50:52,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:52,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:50:52,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:53,766 INFO L124 PetriNetUnfolderBase]: 3046/4686 cut-off events. [2024-06-20 19:50:53,767 INFO L125 PetriNetUnfolderBase]: For 265130/265130 co-relation queries the response was YES. [2024-06-20 19:50:53,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36477 conditions, 4686 events. 3046/4686 cut-off events. For 265130/265130 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 25082 event pairs, 700 based on Foata normal form. 2/4686 useless extension candidates. Maximal degree in co-relation 36379. Up to 4650 conditions per place. [2024-06-20 19:50:53,815 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 262 selfloop transitions, 11 changer transitions 0/276 dead transitions. [2024-06-20 19:50:53,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 276 transitions, 4075 flow [2024-06-20 19:50:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:50:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:50:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-20 19:50:53,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:50:53,816 INFO L175 Difference]: Start difference. First operand has 200 places, 264 transitions, 3453 flow. Second operand 5 states and 80 transitions. [2024-06-20 19:50:53,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 276 transitions, 4075 flow [2024-06-20 19:50:54,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 276 transitions, 3951 flow, removed 57 selfloop flow, removed 2 redundant places. [2024-06-20 19:50:54,376 INFO L231 Difference]: Finished difference. Result has 203 places, 266 transitions, 3398 flow [2024-06-20 19:50:54,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3398, PETRI_PLACES=203, PETRI_TRANSITIONS=266} [2024-06-20 19:50:54,377 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2024-06-20 19:50:54,377 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 266 transitions, 3398 flow [2024-06-20 19:50:54,377 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-20 19:50:54,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:54,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:54,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:50:54,378 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-20 19:50:54,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash 963796505, now seen corresponding path program 1 times [2024-06-20 19:50:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422226113] [2024-06-20 19:50:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422226113] [2024-06-20 19:51:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422226113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:00,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:51:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092158909] [2024-06-20 19:51:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:00,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:51:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:51:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:51:00,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:51:00,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 266 transitions, 3398 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-20 19:51:00,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:00,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:51:00,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:02,584 INFO L124 PetriNetUnfolderBase]: 3038/4676 cut-off events. [2024-06-20 19:51:02,584 INFO L125 PetriNetUnfolderBase]: For 272822/272840 co-relation queries the response was YES. [2024-06-20 19:51:02,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36300 conditions, 4676 events. 3038/4676 cut-off events. For 272822/272840 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24999 event pairs, 544 based on Foata normal form. 14/4677 useless extension candidates. Maximal degree in co-relation 36200. Up to 4427 conditions per place. [2024-06-20 19:51:02,633 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 262 selfloop transitions, 30 changer transitions 0/295 dead transitions. [2024-06-20 19:51:02,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 295 transitions, 4128 flow [2024-06-20 19:51:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:51:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:51:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-20 19:51:02,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 19:51:02,636 INFO L175 Difference]: Start difference. First operand has 203 places, 266 transitions, 3398 flow. Second operand 8 states and 126 transitions. [2024-06-20 19:51:02,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 295 transitions, 4128 flow [2024-06-20 19:51:03,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 295 transitions, 4075 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-20 19:51:03,122 INFO L231 Difference]: Finished difference. Result has 208 places, 268 transitions, 3460 flow [2024-06-20 19:51:03,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3345, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3460, PETRI_PLACES=208, PETRI_TRANSITIONS=268} [2024-06-20 19:51:03,123 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places. [2024-06-20 19:51:03,123 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 268 transitions, 3460 flow [2024-06-20 19:51:03,123 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-20 19:51:03,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:03,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:03,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:51:03,123 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-20 19:51:03,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2096175503, now seen corresponding path program 2 times [2024-06-20 19:51:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514302239] [2024-06-20 19:51:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:11,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:11,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514302239] [2024-06-20 19:51:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514302239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:11,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:51:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572032606] [2024-06-20 19:51:11,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:11,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:51:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:51:11,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:51:11,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:51:11,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 268 transitions, 3460 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-20 19:51:11,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:11,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:51:11,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:13,317 INFO L124 PetriNetUnfolderBase]: 3018/4644 cut-off events. [2024-06-20 19:51:13,318 INFO L125 PetriNetUnfolderBase]: For 279129/279147 co-relation queries the response was YES. [2024-06-20 19:51:13,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36072 conditions, 4644 events. 3018/4644 cut-off events. For 279129/279147 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 24914 event pairs, 599 based on Foata normal form. 22/4653 useless extension candidates. Maximal degree in co-relation 35971. Up to 4103 conditions per place. [2024-06-20 19:51:13,359 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 228 selfloop transitions, 67 changer transitions 0/298 dead transitions. [2024-06-20 19:51:13,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 298 transitions, 4184 flow [2024-06-20 19:51:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:51:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:51:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-20 19:51:13,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-20 19:51:13,362 INFO L175 Difference]: Start difference. First operand has 208 places, 268 transitions, 3460 flow. Second operand 8 states and 134 transitions. [2024-06-20 19:51:13,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 298 transitions, 4184 flow [2024-06-20 19:51:13,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 298 transitions, 4071 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-20 19:51:13,817 INFO L231 Difference]: Finished difference. Result has 211 places, 269 transitions, 3518 flow [2024-06-20 19:51:13,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3518, PETRI_PLACES=211, PETRI_TRANSITIONS=269} [2024-06-20 19:51:13,818 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2024-06-20 19:51:13,818 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 269 transitions, 3518 flow [2024-06-20 19:51:13,818 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-20 19:51:13,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:13,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:13,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:51:13,819 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:13,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash 891411001, now seen corresponding path program 3 times [2024-06-20 19:51:13,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:13,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090903921] [2024-06-20 19:51:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:22,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:22,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090903921] [2024-06-20 19:51:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090903921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:22,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:22,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:51:22,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268900938] [2024-06-20 19:51:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:22,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:51:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:22,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:51:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:51:22,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:51:22,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 269 transitions, 3518 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:22,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:22,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:51:22,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:24,283 INFO L124 PetriNetUnfolderBase]: 3059/4714 cut-off events. [2024-06-20 19:51:24,283 INFO L125 PetriNetUnfolderBase]: For 291535/291559 co-relation queries the response was YES. [2024-06-20 19:51:24,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36838 conditions, 4714 events. 3059/4714 cut-off events. For 291535/291559 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25448 event pairs, 628 based on Foata normal form. 28/4736 useless extension candidates. Maximal degree in co-relation 36735. Up to 4372 conditions per place. [2024-06-20 19:51:24,327 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 261 selfloop transitions, 41 changer transitions 0/305 dead transitions. [2024-06-20 19:51:24,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 305 transitions, 4300 flow [2024-06-20 19:51:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:51:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:51:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-20 19:51:24,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2024-06-20 19:51:24,331 INFO L175 Difference]: Start difference. First operand has 211 places, 269 transitions, 3518 flow. Second operand 9 states and 146 transitions. [2024-06-20 19:51:24,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 305 transitions, 4300 flow [2024-06-20 19:51:24,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 305 transitions, 4135 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:51:24,788 INFO L231 Difference]: Finished difference. Result has 214 places, 270 transitions, 3483 flow [2024-06-20 19:51:24,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3353, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3483, PETRI_PLACES=214, PETRI_TRANSITIONS=270} [2024-06-20 19:51:24,789 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2024-06-20 19:51:24,789 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 270 transitions, 3483 flow [2024-06-20 19:51:24,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:24,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:24,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:24,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:51:24,790 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-20 19:51:24,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1351606790, now seen corresponding path program 1 times [2024-06-20 19:51:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480225744] [2024-06-20 19:51:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:35,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-20 19:51:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480225744] [2024-06-20 19:51:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480225744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:51:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619350420] [2024-06-20 19:51:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:35,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:51:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:51:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:51:35,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:51:35,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 270 transitions, 3483 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-20 19:51:35,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:35,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:51:35,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:37,159 INFO L124 PetriNetUnfolderBase]: 3079/4741 cut-off events. [2024-06-20 19:51:37,160 INFO L125 PetriNetUnfolderBase]: For 294260/294260 co-relation queries the response was YES. [2024-06-20 19:51:37,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36970 conditions, 4741 events. 3079/4741 cut-off events. For 294260/294260 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25556 event pairs, 650 based on Foata normal form. 4/4743 useless extension candidates. Maximal degree in co-relation 36866. Up to 4516 conditions per place. [2024-06-20 19:51:37,204 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 247 selfloop transitions, 55 changer transitions 0/305 dead transitions. [2024-06-20 19:51:37,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 305 transitions, 4401 flow [2024-06-20 19:51:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:51:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:51:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-20 19:51:37,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:51:37,207 INFO L175 Difference]: Start difference. First operand has 214 places, 270 transitions, 3483 flow. Second operand 8 states and 136 transitions. [2024-06-20 19:51:37,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 305 transitions, 4401 flow [2024-06-20 19:51:37,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 305 transitions, 4287 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-20 19:51:37,716 INFO L231 Difference]: Finished difference. Result has 215 places, 276 transitions, 3591 flow [2024-06-20 19:51:37,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3369, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3591, PETRI_PLACES=215, PETRI_TRANSITIONS=276} [2024-06-20 19:51:37,717 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places. [2024-06-20 19:51:37,717 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 276 transitions, 3591 flow [2024-06-20 19:51:37,717 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-20 19:51:37,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:37,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:37,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:51:37,717 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-20 19:51:37,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash 481432719, now seen corresponding path program 1 times [2024-06-20 19:51:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314159616] [2024-06-20 19:51:37,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314159616] [2024-06-20 19:51:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314159616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:46,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:51:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925146963] [2024-06-20 19:51:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:46,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:51:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:51:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:51:46,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:51:46,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 276 transitions, 3591 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-20 19:51:46,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:46,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:51:46,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:47,734 INFO L124 PetriNetUnfolderBase]: 3100/4770 cut-off events. [2024-06-20 19:51:47,735 INFO L125 PetriNetUnfolderBase]: For 302640/302640 co-relation queries the response was YES. [2024-06-20 19:51:47,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37675 conditions, 4770 events. 3100/4770 cut-off events. For 302640/302640 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25765 event pairs, 677 based on Foata normal form. 1/4769 useless extension candidates. Maximal degree in co-relation 37570. Up to 4687 conditions per place. [2024-06-20 19:51:47,780 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 269 selfloop transitions, 32 changer transitions 0/304 dead transitions. [2024-06-20 19:51:47,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 304 transitions, 4532 flow [2024-06-20 19:51:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:51:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:51:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-20 19:51:47,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:51:47,781 INFO L175 Difference]: Start difference. First operand has 215 places, 276 transitions, 3591 flow. Second operand 7 states and 112 transitions. [2024-06-20 19:51:47,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 304 transitions, 4532 flow [2024-06-20 19:51:48,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 304 transitions, 4438 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-20 19:51:48,210 INFO L231 Difference]: Finished difference. Result has 219 places, 285 transitions, 3761 flow [2024-06-20 19:51:48,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3497, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3761, PETRI_PLACES=219, PETRI_TRANSITIONS=285} [2024-06-20 19:51:48,210 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2024-06-20 19:51:48,210 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 285 transitions, 3761 flow [2024-06-20 19:51:48,211 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-20 19:51:48,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:48,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:48,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:51:48,211 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:48,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash 487146639, now seen corresponding path program 2 times [2024-06-20 19:51:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022620931] [2024-06-20 19:51:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022620931] [2024-06-20 19:51:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022620931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:55,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:55,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:51:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166005406] [2024-06-20 19:51:55,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:55,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:51:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:55,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:51:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:51:55,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:51:55,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 285 transitions, 3761 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-20 19:51:55,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:55,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:51:55,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:57,188 INFO L124 PetriNetUnfolderBase]: 3097/4766 cut-off events. [2024-06-20 19:51:57,189 INFO L125 PetriNetUnfolderBase]: For 311093/311093 co-relation queries the response was YES. [2024-06-20 19:51:57,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37776 conditions, 4766 events. 3097/4766 cut-off events. For 311093/311093 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25777 event pairs, 677 based on Foata normal form. 1/4765 useless extension candidates. Maximal degree in co-relation 37668. Up to 4711 conditions per place. [2024-06-20 19:51:57,240 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 275 selfloop transitions, 22 changer transitions 0/300 dead transitions. [2024-06-20 19:51:57,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 300 transitions, 4411 flow [2024-06-20 19:51:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:51:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:51:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-20 19:51:57,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2024-06-20 19:51:57,241 INFO L175 Difference]: Start difference. First operand has 219 places, 285 transitions, 3761 flow. Second operand 7 states and 107 transitions. [2024-06-20 19:51:57,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 300 transitions, 4411 flow [2024-06-20 19:51:57,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 300 transitions, 4341 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-20 19:51:57,798 INFO L231 Difference]: Finished difference. Result has 223 places, 285 transitions, 3741 flow [2024-06-20 19:51:57,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3741, PETRI_PLACES=223, PETRI_TRANSITIONS=285} [2024-06-20 19:51:57,799 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places. [2024-06-20 19:51:57,799 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 285 transitions, 3741 flow [2024-06-20 19:51:57,799 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-20 19:51:57,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:57,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:57,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:51:57,800 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:57,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1485900293, now seen corresponding path program 4 times [2024-06-20 19:51:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:57,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440450207] [2024-06-20 19:51:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:05,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440450207] [2024-06-20 19:52:05,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440450207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:05,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:05,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:52:05,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853280270] [2024-06-20 19:52:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:05,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:52:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:52:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:52:05,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:52:05,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 285 transitions, 3741 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:05,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:05,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:52:05,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:07,613 INFO L124 PetriNetUnfolderBase]: 3077/4736 cut-off events. [2024-06-20 19:52:07,613 INFO L125 PetriNetUnfolderBase]: For 321098/321116 co-relation queries the response was YES. [2024-06-20 19:52:07,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37238 conditions, 4736 events. 3077/4736 cut-off events. For 321098/321116 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 25528 event pairs, 602 based on Foata normal form. 22/4745 useless extension candidates. Maximal degree in co-relation 37128. Up to 4174 conditions per place. [2024-06-20 19:52:07,663 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 253 selfloop transitions, 64 changer transitions 0/320 dead transitions. [2024-06-20 19:52:07,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 320 transitions, 4527 flow [2024-06-20 19:52:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:52:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:52:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-20 19:52:07,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-20 19:52:07,665 INFO L175 Difference]: Start difference. First operand has 223 places, 285 transitions, 3741 flow. Second operand 9 states and 148 transitions. [2024-06-20 19:52:07,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 320 transitions, 4527 flow [2024-06-20 19:52:08,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 320 transitions, 4455 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-20 19:52:08,106 INFO L231 Difference]: Finished difference. Result has 228 places, 286 transitions, 3832 flow [2024-06-20 19:52:08,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3669, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3832, PETRI_PLACES=228, PETRI_TRANSITIONS=286} [2024-06-20 19:52:08,107 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places. [2024-06-20 19:52:08,107 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 286 transitions, 3832 flow [2024-06-20 19:52:08,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:08,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:08,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:08,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:52:08,108 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-20 19:52:08,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:08,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1360872380, now seen corresponding path program 2 times [2024-06-20 19:52:08,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:08,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987842701] [2024-06-20 19:52:08,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:08,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:18,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:18,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987842701] [2024-06-20 19:52:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987842701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:18,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:52:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380245255] [2024-06-20 19:52:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:18,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:52:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:52:18,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:52:18,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:52:18,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 286 transitions, 3832 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-20 19:52:18,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:18,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:52:18,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:20,701 INFO L124 PetriNetUnfolderBase]: 3129/4803 cut-off events. [2024-06-20 19:52:20,701 INFO L125 PetriNetUnfolderBase]: For 331219/331225 co-relation queries the response was YES. [2024-06-20 19:52:20,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38466 conditions, 4803 events. 3129/4803 cut-off events. For 331219/331225 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25876 event pairs, 630 based on Foata normal form. 10/4811 useless extension candidates. Maximal degree in co-relation 38354. Up to 4549 conditions per place. [2024-06-20 19:52:20,755 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 257 selfloop transitions, 58 changer transitions 0/318 dead transitions. [2024-06-20 19:52:20,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 318 transitions, 4872 flow [2024-06-20 19:52:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:52:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:52:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-20 19:52:20,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 19:52:20,757 INFO L175 Difference]: Start difference. First operand has 228 places, 286 transitions, 3832 flow. Second operand 8 states and 133 transitions. [2024-06-20 19:52:20,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 318 transitions, 4872 flow [2024-06-20 19:52:21,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 318 transitions, 4575 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-20 19:52:21,229 INFO L231 Difference]: Finished difference. Result has 228 places, 292 transitions, 3749 flow [2024-06-20 19:52:21,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3535, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3749, PETRI_PLACES=228, PETRI_TRANSITIONS=292} [2024-06-20 19:52:21,230 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places. [2024-06-20 19:52:21,231 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 292 transitions, 3749 flow [2024-06-20 19:52:21,231 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-20 19:52:21,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:21,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:21,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:52:21,231 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-20 19:52:21,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash -704803932, now seen corresponding path program 3 times [2024-06-20 19:52:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:21,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260139863] [2024-06-20 19:52:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260139863] [2024-06-20 19:52:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260139863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:52:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204324284] [2024-06-20 19:52:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:32,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:52:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:52:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:52:32,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:52:32,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 292 transitions, 3749 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-20 19:52:32,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:32,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:52:32,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:34,572 INFO L124 PetriNetUnfolderBase]: 3117/4787 cut-off events. [2024-06-20 19:52:34,573 INFO L125 PetriNetUnfolderBase]: For 332589/332595 co-relation queries the response was YES. [2024-06-20 19:52:34,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37310 conditions, 4787 events. 3117/4787 cut-off events. For 332589/332595 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 25748 event pairs, 628 based on Foata normal form. 10/4795 useless extension candidates. Maximal degree in co-relation 37199. Up to 4541 conditions per place. [2024-06-20 19:52:34,618 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 258 selfloop transitions, 57 changer transitions 0/318 dead transitions. [2024-06-20 19:52:34,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 318 transitions, 4593 flow [2024-06-20 19:52:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:52:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:52:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-20 19:52:34,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-20 19:52:34,644 INFO L175 Difference]: Start difference. First operand has 228 places, 292 transitions, 3749 flow. Second operand 8 states and 134 transitions. [2024-06-20 19:52:34,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 318 transitions, 4593 flow [2024-06-20 19:52:35,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 318 transitions, 4457 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-20 19:52:35,240 INFO L231 Difference]: Finished difference. Result has 232 places, 292 transitions, 3733 flow [2024-06-20 19:52:35,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3613, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3733, PETRI_PLACES=232, PETRI_TRANSITIONS=292} [2024-06-20 19:52:35,241 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places. [2024-06-20 19:52:35,241 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 292 transitions, 3733 flow [2024-06-20 19:52:35,241 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-20 19:52:35,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:35,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:35,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:52:35,241 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-20 19:52:35,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash 808872925, now seen corresponding path program 3 times [2024-06-20 19:52:35,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:35,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123746824] [2024-06-20 19:52:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123746824] [2024-06-20 19:52:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123746824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:42,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:52:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771036437] [2024-06-20 19:52:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:42,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:52:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:52:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:52:43,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:52:43,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 292 transitions, 3733 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-20 19:52:43,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:43,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:52:43,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:44,702 INFO L124 PetriNetUnfolderBase]: 3119/4795 cut-off events. [2024-06-20 19:52:44,702 INFO L125 PetriNetUnfolderBase]: For 339342/339366 co-relation queries the response was YES. [2024-06-20 19:52:44,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37329 conditions, 4795 events. 3119/4795 cut-off events. For 339342/339366 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 25919 event pairs, 678 based on Foata normal form. 18/4807 useless extension candidates. Maximal degree in co-relation 37217. Up to 4593 conditions per place. [2024-06-20 19:52:44,748 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 249 selfloop transitions, 65 changer transitions 0/317 dead transitions. [2024-06-20 19:52:44,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 317 transitions, 4752 flow [2024-06-20 19:52:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:52:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:52:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-20 19:52:44,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-20 19:52:44,751 INFO L175 Difference]: Start difference. First operand has 232 places, 292 transitions, 3733 flow. Second operand 7 states and 115 transitions. [2024-06-20 19:52:44,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 317 transitions, 4752 flow [2024-06-20 19:52:45,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 317 transitions, 4630 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-20 19:52:45,250 INFO L231 Difference]: Finished difference. Result has 233 places, 299 transitions, 3892 flow [2024-06-20 19:52:45,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3611, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3892, PETRI_PLACES=233, PETRI_TRANSITIONS=299} [2024-06-20 19:52:45,251 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places. [2024-06-20 19:52:45,251 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 299 transitions, 3892 flow [2024-06-20 19:52:45,252 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-20 19:52:45,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:45,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:45,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:52:45,252 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-20 19:52:45,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:45,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1844647749, now seen corresponding path program 4 times [2024-06-20 19:52:45,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:45,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264559939] [2024-06-20 19:52:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264559939] [2024-06-20 19:52:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264559939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:52:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046941015] [2024-06-20 19:52:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:53,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:52:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:52:53,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:52:53,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:52:53,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 299 transitions, 3892 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-20 19:52:53,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:53,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:52:53,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:55,074 INFO L124 PetriNetUnfolderBase]: 3193/4898 cut-off events. [2024-06-20 19:52:55,075 INFO L125 PetriNetUnfolderBase]: For 364925/364925 co-relation queries the response was YES. [2024-06-20 19:52:55,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38360 conditions, 4898 events. 3193/4898 cut-off events. For 364925/364925 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 26439 event pairs, 647 based on Foata normal form. 16/4912 useless extension candidates. Maximal degree in co-relation 38246. Up to 4673 conditions per place. [2024-06-20 19:52:55,130 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 276 selfloop transitions, 71 changer transitions 0/350 dead transitions. [2024-06-20 19:52:55,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 350 transitions, 5255 flow [2024-06-20 19:52:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:52:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:52:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-20 19:52:55,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-20 19:52:55,132 INFO L175 Difference]: Start difference. First operand has 233 places, 299 transitions, 3892 flow. Second operand 7 states and 122 transitions. [2024-06-20 19:52:55,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 350 transitions, 5255 flow [2024-06-20 19:52:55,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 350 transitions, 5028 flow, removed 80 selfloop flow, removed 3 redundant places. [2024-06-20 19:52:55,782 INFO L231 Difference]: Finished difference. Result has 240 places, 327 transitions, 4418 flow [2024-06-20 19:52:55,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3672, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4418, PETRI_PLACES=240, PETRI_TRANSITIONS=327} [2024-06-20 19:52:55,783 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places. [2024-06-20 19:52:55,783 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 327 transitions, 4418 flow [2024-06-20 19:52:55,783 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-20 19:52:55,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:55,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:52:55,784 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:52:55,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 138620401, now seen corresponding path program 5 times [2024-06-20 19:52:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99227048] [2024-06-20 19:52:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99227048] [2024-06-20 19:53:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99227048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:03,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:03,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524616394] [2024-06-20 19:53:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:03,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:03,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:03,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:04,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:53:04,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 327 transitions, 4418 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-20 19:53:04,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:04,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:53:04,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:05,744 INFO L124 PetriNetUnfolderBase]: 3188/4891 cut-off events. [2024-06-20 19:53:05,745 INFO L125 PetriNetUnfolderBase]: For 355565/355565 co-relation queries the response was YES. [2024-06-20 19:53:05,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39168 conditions, 4891 events. 3188/4891 cut-off events. For 355565/355565 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26399 event pairs, 674 based on Foata normal form. 3/4892 useless extension candidates. Maximal degree in co-relation 39050. Up to 4803 conditions per place. [2024-06-20 19:53:05,812 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 309 selfloop transitions, 36 changer transitions 0/348 dead transitions. [2024-06-20 19:53:05,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 348 transitions, 5248 flow [2024-06-20 19:53:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:53:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:53:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-20 19:53:05,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-20 19:53:05,813 INFO L175 Difference]: Start difference. First operand has 240 places, 327 transitions, 4418 flow. Second operand 6 states and 106 transitions. [2024-06-20 19:53:05,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 348 transitions, 5248 flow [2024-06-20 19:53:06,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 348 transitions, 5084 flow, removed 81 selfloop flow, removed 1 redundant places. [2024-06-20 19:53:06,603 INFO L231 Difference]: Finished difference. Result has 245 places, 330 transitions, 4416 flow [2024-06-20 19:53:06,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4254, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4416, PETRI_PLACES=245, PETRI_TRANSITIONS=330} [2024-06-20 19:53:06,603 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2024-06-20 19:53:06,603 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 330 transitions, 4416 flow [2024-06-20 19:53:06,604 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-20 19:53:06,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:06,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:06,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:53:06,604 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:53:06,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash -688367317, now seen corresponding path program 5 times [2024-06-20 19:53:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778864021] [2024-06-20 19:53:06,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:06,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778864021] [2024-06-20 19:53:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778864021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:53:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016011618] [2024-06-20 19:53:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:14,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:53:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:53:14,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:53:14,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:53:14,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 330 transitions, 4416 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:14,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:14,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:53:14,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:16,513 INFO L124 PetriNetUnfolderBase]: 3168/4861 cut-off events. [2024-06-20 19:53:16,514 INFO L125 PetriNetUnfolderBase]: For 361187/361205 co-relation queries the response was YES. [2024-06-20 19:53:16,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38385 conditions, 4861 events. 3168/4861 cut-off events. For 361187/361205 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 26115 event pairs, 590 based on Foata normal form. 22/4870 useless extension candidates. Maximal degree in co-relation 38264. Up to 4091 conditions per place. [2024-06-20 19:53:16,589 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 288 selfloop transitions, 77 changer transitions 0/368 dead transitions. [2024-06-20 19:53:16,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 368 transitions, 5318 flow [2024-06-20 19:53:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:53:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:53:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-20 19:53:16,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-20 19:53:16,592 INFO L175 Difference]: Start difference. First operand has 245 places, 330 transitions, 4416 flow. Second operand 9 states and 158 transitions. [2024-06-20 19:53:16,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 368 transitions, 5318 flow [2024-06-20 19:53:17,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 368 transitions, 5202 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-20 19:53:17,345 INFO L231 Difference]: Finished difference. Result has 250 places, 330 transitions, 4460 flow [2024-06-20 19:53:17,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4300, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4460, PETRI_PLACES=250, PETRI_TRANSITIONS=330} [2024-06-20 19:53:17,345 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places. [2024-06-20 19:53:17,345 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 330 transitions, 4460 flow [2024-06-20 19:53:17,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:17,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:17,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:17,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:53:17,346 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-20 19:53:17,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1415604636, now seen corresponding path program 4 times [2024-06-20 19:53:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697794479] [2024-06-20 19:53:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697794479] [2024-06-20 19:53:27,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697794479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:27,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:27,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:27,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966972773] [2024-06-20 19:53:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:27,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:27,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:27,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:28,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:53:28,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 330 transitions, 4460 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-20 19:53:28,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:28,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:53:28,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:29,957 INFO L124 PetriNetUnfolderBase]: 3188/4887 cut-off events. [2024-06-20 19:53:29,957 INFO L125 PetriNetUnfolderBase]: For 362557/362557 co-relation queries the response was YES. [2024-06-20 19:53:30,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38887 conditions, 4887 events. 3188/4887 cut-off events. For 362557/362557 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26370 event pairs, 644 based on Foata normal form. 4/4889 useless extension candidates. Maximal degree in co-relation 38765. Up to 4703 conditions per place. [2024-06-20 19:53:30,023 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 306 selfloop transitions, 50 changer transitions 0/359 dead transitions. [2024-06-20 19:53:30,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 359 transitions, 5449 flow [2024-06-20 19:53:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:53:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:53:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-20 19:53:30,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-20 19:53:30,025 INFO L175 Difference]: Start difference. First operand has 250 places, 330 transitions, 4460 flow. Second operand 7 states and 124 transitions. [2024-06-20 19:53:30,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 359 transitions, 5449 flow [2024-06-20 19:53:30,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 359 transitions, 5271 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:53:30,845 INFO L231 Difference]: Finished difference. Result has 249 places, 333 transitions, 4437 flow [2024-06-20 19:53:30,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4282, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4437, PETRI_PLACES=249, PETRI_TRANSITIONS=333} [2024-06-20 19:53:30,846 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 208 predicate places. [2024-06-20 19:53:30,846 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 333 transitions, 4437 flow [2024-06-20 19:53:30,846 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-20 19:53:30,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:30,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:30,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:53:30,846 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-20 19:53:30,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash 138627934, now seen corresponding path program 5 times [2024-06-20 19:53:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:30,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117311519] [2024-06-20 19:53:30,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:41,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117311519] [2024-06-20 19:53:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117311519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170374579] [2024-06-20 19:53:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:41,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:41,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:42,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:53:42,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 333 transitions, 4437 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-20 19:53:42,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:42,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:53:42,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:43,698 INFO L124 PetriNetUnfolderBase]: 3176/4868 cut-off events. [2024-06-20 19:53:43,698 INFO L125 PetriNetUnfolderBase]: For 364910/364916 co-relation queries the response was YES. [2024-06-20 19:53:43,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38412 conditions, 4868 events. 3176/4868 cut-off events. For 364910/364916 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 26194 event pairs, 630 based on Foata normal form. 10/4876 useless extension candidates. Maximal degree in co-relation 38289. Up to 4695 conditions per place. [2024-06-20 19:53:43,746 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 305 selfloop transitions, 46 changer transitions 0/354 dead transitions. [2024-06-20 19:53:43,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 354 transitions, 5231 flow [2024-06-20 19:53:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:53:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:53:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-20 19:53:43,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-20 19:53:43,748 INFO L175 Difference]: Start difference. First operand has 249 places, 333 transitions, 4437 flow. Second operand 7 states and 118 transitions. [2024-06-20 19:53:43,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 354 transitions, 5231 flow [2024-06-20 19:53:44,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 354 transitions, 5037 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-20 19:53:44,344 INFO L231 Difference]: Finished difference. Result has 250 places, 333 transitions, 4341 flow [2024-06-20 19:53:44,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4243, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4341, PETRI_PLACES=250, PETRI_TRANSITIONS=333} [2024-06-20 19:53:44,344 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places. [2024-06-20 19:53:44,344 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 333 transitions, 4341 flow [2024-06-20 19:53:44,345 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-20 19:53:44,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:44,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:44,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:53:44,345 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-20 19:53:44,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1685169039, now seen corresponding path program 1 times [2024-06-20 19:53:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195973077] [2024-06-20 19:53:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195973077] [2024-06-20 19:53:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195973077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:53,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348606681] [2024-06-20 19:53:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:53,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:53,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:53,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:53:53,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 333 transitions, 4341 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-20 19:53:53,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:53,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:53:53,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:55,561 INFO L124 PetriNetUnfolderBase]: 3194/4898 cut-off events. [2024-06-20 19:53:55,561 INFO L125 PetriNetUnfolderBase]: For 372642/372666 co-relation queries the response was YES. [2024-06-20 19:53:55,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38662 conditions, 4898 events. 3194/4898 cut-off events. For 372642/372666 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26452 event pairs, 661 based on Foata normal form. 18/4910 useless extension candidates. Maximal degree in co-relation 38538. Up to 4647 conditions per place. [2024-06-20 19:53:55,619 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 274 selfloop transitions, 88 changer transitions 0/365 dead transitions. [2024-06-20 19:53:55,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 365 transitions, 5661 flow [2024-06-20 19:53:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:53:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:53:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-20 19:53:55,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:53:55,622 INFO L175 Difference]: Start difference. First operand has 250 places, 333 transitions, 4341 flow. Second operand 9 states and 144 transitions. [2024-06-20 19:53:55,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 365 transitions, 5661 flow [2024-06-20 19:53:56,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 365 transitions, 5530 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:53:56,380 INFO L231 Difference]: Finished difference. Result has 253 places, 341 transitions, 4538 flow [2024-06-20 19:53:56,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4210, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4538, PETRI_PLACES=253, PETRI_TRANSITIONS=341} [2024-06-20 19:53:56,381 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places. [2024-06-20 19:53:56,381 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 341 transitions, 4538 flow [2024-06-20 19:53:56,381 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-20 19:53:56,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:56,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:56,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:53:56,382 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-20 19:53:56,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash 711042404, now seen corresponding path program 1 times [2024-06-20 19:53:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702276694] [2024-06-20 19:53:56,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702276694] [2024-06-20 19:54:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702276694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:54:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674880265] [2024-06-20 19:54:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:54:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:04,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:54:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:54:05,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:54:05,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 341 transitions, 4538 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-20 19:54:05,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:05,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:54:05,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:06,756 INFO L124 PetriNetUnfolderBase]: 3230/4948 cut-off events. [2024-06-20 19:54:06,756 INFO L125 PetriNetUnfolderBase]: For 393816/393840 co-relation queries the response was YES. [2024-06-20 19:54:06,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39987 conditions, 4948 events. 3230/4948 cut-off events. For 393816/393840 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 26698 event pairs, 645 based on Foata normal form. 20/4962 useless extension candidates. Maximal degree in co-relation 39862. Up to 4464 conditions per place. [2024-06-20 19:54:06,810 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 243 selfloop transitions, 130 changer transitions 0/376 dead transitions. [2024-06-20 19:54:06,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 376 transitions, 5940 flow [2024-06-20 19:54:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:54:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:54:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-20 19:54:06,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-20 19:54:06,812 INFO L175 Difference]: Start difference. First operand has 253 places, 341 transitions, 4538 flow. Second operand 8 states and 134 transitions. [2024-06-20 19:54:06,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 376 transitions, 5940 flow [2024-06-20 19:54:07,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 376 transitions, 5753 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-20 19:54:07,554 INFO L231 Difference]: Finished difference. Result has 257 places, 353 transitions, 5018 flow [2024-06-20 19:54:07,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4351, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5018, PETRI_PLACES=257, PETRI_TRANSITIONS=353} [2024-06-20 19:54:07,555 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places. [2024-06-20 19:54:07,555 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 353 transitions, 5018 flow [2024-06-20 19:54:07,555 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-20 19:54:07,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:07,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:07,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:54:07,556 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-20 19:54:07,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 714761474, now seen corresponding path program 2 times [2024-06-20 19:54:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:07,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732978025] [2024-06-20 19:54:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:16,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:16,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732978025] [2024-06-20 19:54:16,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732978025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:16,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:16,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:54:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270126424] [2024-06-20 19:54:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:16,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:54:16,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:16,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:54:16,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:54:16,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:54:16,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 353 transitions, 5018 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-20 19:54:16,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:16,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:54:16,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:18,009 INFO L124 PetriNetUnfolderBase]: 3298/5040 cut-off events. [2024-06-20 19:54:18,010 INFO L125 PetriNetUnfolderBase]: For 426342/426342 co-relation queries the response was YES. [2024-06-20 19:54:18,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42604 conditions, 5040 events. 3298/5040 cut-off events. For 426342/426342 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 27217 event pairs, 649 based on Foata normal form. 4/5042 useless extension candidates. Maximal degree in co-relation 42476. Up to 4883 conditions per place. [2024-06-20 19:54:18,063 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 328 selfloop transitions, 55 changer transitions 0/386 dead transitions. [2024-06-20 19:54:18,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 386 transitions, 6441 flow [2024-06-20 19:54:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:54:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:54:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-20 19:54:18,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-20 19:54:18,067 INFO L175 Difference]: Start difference. First operand has 257 places, 353 transitions, 5018 flow. Second operand 9 states and 142 transitions. [2024-06-20 19:54:18,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 386 transitions, 6441 flow [2024-06-20 19:54:18,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 386 transitions, 6239 flow, removed 84 selfloop flow, removed 3 redundant places. [2024-06-20 19:54:18,902 INFO L231 Difference]: Finished difference. Result has 264 places, 364 transitions, 5278 flow [2024-06-20 19:54:18,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4844, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5278, PETRI_PLACES=264, PETRI_TRANSITIONS=364} [2024-06-20 19:54:18,902 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 223 predicate places. [2024-06-20 19:54:18,902 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 364 transitions, 5278 flow [2024-06-20 19:54:18,903 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-20 19:54:18,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:18,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:18,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:54:18,903 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-20 19:54:18,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1688978319, now seen corresponding path program 2 times [2024-06-20 19:54:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711444090] [2024-06-20 19:54:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711444090] [2024-06-20 19:54:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711444090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:54:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199726707] [2024-06-20 19:54:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:27,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:54:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:54:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:54:27,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:54:27,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 364 transitions, 5278 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-20 19:54:27,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:27,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:54:27,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:29,423 INFO L124 PetriNetUnfolderBase]: 3514/5340 cut-off events. [2024-06-20 19:54:29,423 INFO L125 PetriNetUnfolderBase]: For 481493/481493 co-relation queries the response was YES. [2024-06-20 19:54:29,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45009 conditions, 5340 events. 3514/5340 cut-off events. For 481493/481493 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 28819 event pairs, 663 based on Foata normal form. 12/5350 useless extension candidates. Maximal degree in co-relation 44878. Up to 5052 conditions per place. [2024-06-20 19:54:29,483 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 345 selfloop transitions, 60 changer transitions 0/408 dead transitions. [2024-06-20 19:54:29,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 408 transitions, 6752 flow [2024-06-20 19:54:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:54:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:54:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-20 19:54:29,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-20 19:54:29,485 INFO L175 Difference]: Start difference. First operand has 264 places, 364 transitions, 5278 flow. Second operand 9 states and 149 transitions. [2024-06-20 19:54:29,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 408 transitions, 6752 flow [2024-06-20 19:54:30,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 408 transitions, 6597 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-20 19:54:30,384 INFO L231 Difference]: Finished difference. Result has 270 places, 383 transitions, 5595 flow [2024-06-20 19:54:30,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5123, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5595, PETRI_PLACES=270, PETRI_TRANSITIONS=383} [2024-06-20 19:54:30,385 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places. [2024-06-20 19:54:30,385 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 383 transitions, 5595 flow [2024-06-20 19:54:30,385 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-20 19:54:30,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:30,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:30,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:54:30,385 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-20 19:54:30,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash 144342257, now seen corresponding path program 3 times [2024-06-20 19:54:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53562054] [2024-06-20 19:54:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:30,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:38,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:38,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53562054] [2024-06-20 19:54:38,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53562054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:38,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:38,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:54:38,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168455440] [2024-06-20 19:54:38,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:38,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:54:38,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:38,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:54:38,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:54:38,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:54:38,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 383 transitions, 5595 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-20 19:54:38,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:38,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:54:38,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:41,001 INFO L124 PetriNetUnfolderBase]: 3740/5651 cut-off events. [2024-06-20 19:54:41,002 INFO L125 PetriNetUnfolderBase]: For 542577/542583 co-relation queries the response was YES. [2024-06-20 19:54:41,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49821 conditions, 5651 events. 3740/5651 cut-off events. For 542577/542583 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30532 event pairs, 665 based on Foata normal form. 18/5667 useless extension candidates. Maximal degree in co-relation 49687. Up to 4820 conditions per place. [2024-06-20 19:54:41,063 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 298 selfloop transitions, 142 changer transitions 0/443 dead transitions. [2024-06-20 19:54:41,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 443 transitions, 7382 flow [2024-06-20 19:54:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:54:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:54:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-20 19:54:41,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-06-20 19:54:41,064 INFO L175 Difference]: Start difference. First operand has 270 places, 383 transitions, 5595 flow. Second operand 8 states and 154 transitions. [2024-06-20 19:54:41,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 443 transitions, 7382 flow [2024-06-20 19:54:42,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 443 transitions, 7188 flow, removed 79 selfloop flow, removed 4 redundant places. [2024-06-20 19:54:42,033 INFO L231 Difference]: Finished difference. Result has 276 places, 405 transitions, 6287 flow [2024-06-20 19:54:42,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5402, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6287, PETRI_PLACES=276, PETRI_TRANSITIONS=405} [2024-06-20 19:54:42,034 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-06-20 19:54:42,034 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 405 transitions, 6287 flow [2024-06-20 19:54:42,034 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-20 19:54:42,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:42,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:42,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:54:42,034 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-20 19:54:42,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 354598850, now seen corresponding path program 3 times [2024-06-20 19:54:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:42,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861098968] [2024-06-20 19:54:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:50,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:50,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861098968] [2024-06-20 19:54:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861098968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:50,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:54:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461023552] [2024-06-20 19:54:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:50,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:54:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:54:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:54:50,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:54:50,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 405 transitions, 6287 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-20 19:54:50,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:50,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:54:50,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:52,363 INFO L124 PetriNetUnfolderBase]: 3792/5726 cut-off events. [2024-06-20 19:54:52,363 INFO L125 PetriNetUnfolderBase]: For 558656/558656 co-relation queries the response was YES. [2024-06-20 19:54:52,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52697 conditions, 5726 events. 3792/5726 cut-off events. For 558656/558656 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30990 event pairs, 743 based on Foata normal form. 4/5728 useless extension candidates. Maximal degree in co-relation 52559. Up to 5395 conditions per place. [2024-06-20 19:54:52,434 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 340 selfloop transitions, 102 changer transitions 0/445 dead transitions. [2024-06-20 19:54:52,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 445 transitions, 7859 flow [2024-06-20 19:54:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:54:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:54:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-20 19:54:52,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2024-06-20 19:54:52,436 INFO L175 Difference]: Start difference. First operand has 276 places, 405 transitions, 6287 flow. Second operand 8 states and 141 transitions. [2024-06-20 19:54:52,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 445 transitions, 7859 flow [2024-06-20 19:54:53,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 445 transitions, 7669 flow, removed 74 selfloop flow, removed 3 redundant places. [2024-06-20 19:54:53,606 INFO L231 Difference]: Finished difference. Result has 283 places, 418 transitions, 6718 flow [2024-06-20 19:54:53,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6097, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6718, PETRI_PLACES=283, PETRI_TRANSITIONS=418} [2024-06-20 19:54:53,607 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 242 predicate places. [2024-06-20 19:54:53,607 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 418 transitions, 6718 flow [2024-06-20 19:54:53,607 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-20 19:54:53,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:53,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:53,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:54:53,607 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-20 19:54:53,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 144347992, now seen corresponding path program 4 times [2024-06-20 19:54:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154577414] [2024-06-20 19:54:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154577414] [2024-06-20 19:55:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154577414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:01,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:55:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659526157] [2024-06-20 19:55:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:55:01,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:55:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:55:01,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:55:01,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 418 transitions, 6718 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-20 19:55:01,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:01,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:55:01,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:03,946 INFO L124 PetriNetUnfolderBase]: 3776/5704 cut-off events. [2024-06-20 19:55:03,946 INFO L125 PetriNetUnfolderBase]: For 565817/565817 co-relation queries the response was YES. [2024-06-20 19:55:03,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52840 conditions, 5704 events. 3776/5704 cut-off events. For 565817/565817 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 30878 event pairs, 734 based on Foata normal form. 4/5706 useless extension candidates. Maximal degree in co-relation 52698. Up to 5574 conditions per place. [2024-06-20 19:55:04,015 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 387 selfloop transitions, 47 changer transitions 0/437 dead transitions. [2024-06-20 19:55:04,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 437 transitions, 7683 flow [2024-06-20 19:55:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:55:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:55:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-20 19:55:04,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-20 19:55:04,016 INFO L175 Difference]: Start difference. First operand has 283 places, 418 transitions, 6718 flow. Second operand 8 states and 124 transitions. [2024-06-20 19:55:04,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 437 transitions, 7683 flow [2024-06-20 19:55:05,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 437 transitions, 7499 flow, removed 86 selfloop flow, removed 2 redundant places. [2024-06-20 19:55:05,638 INFO L231 Difference]: Finished difference. Result has 289 places, 419 transitions, 6655 flow [2024-06-20 19:55:05,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6534, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6655, PETRI_PLACES=289, PETRI_TRANSITIONS=419} [2024-06-20 19:55:05,639 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 248 predicate places. [2024-06-20 19:55:05,639 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 419 transitions, 6655 flow [2024-06-20 19:55:05,639 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-20 19:55:05,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:05,639 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-20 19:55:05,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:55:05,640 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:55:05,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash 885468163, now seen corresponding path program 1 times [2024-06-20 19:55:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188475171] [2024-06-20 19:55:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188475171] [2024-06-20 19:55:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188475171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:13,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:13,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:55:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720019545] [2024-06-20 19:55:13,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:13,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:55:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:55:13,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:55:14,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:55:14,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 419 transitions, 6655 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-20 19:55:14,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:14,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:55:14,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:16,270 INFO L124 PetriNetUnfolderBase]: 3764/5686 cut-off events. [2024-06-20 19:55:16,271 INFO L125 PetriNetUnfolderBase]: For 572238/572256 co-relation queries the response was YES. [2024-06-20 19:55:16,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52255 conditions, 5686 events. 3764/5686 cut-off events. For 572238/572256 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 30519 event pairs, 604 based on Foata normal form. 18/5691 useless extension candidates. Maximal degree in co-relation 52111. Up to 5391 conditions per place. [2024-06-20 19:55:16,351 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 417 selfloop transitions, 31 changer transitions 0/451 dead transitions. [2024-06-20 19:55:16,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 451 transitions, 7589 flow [2024-06-20 19:55:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:55:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:55:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-20 19:55:16,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2024-06-20 19:55:16,354 INFO L175 Difference]: Start difference. First operand has 289 places, 419 transitions, 6655 flow. Second operand 9 states and 139 transitions. [2024-06-20 19:55:16,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 451 transitions, 7589 flow [2024-06-20 19:55:17,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 451 transitions, 7380 flow, removed 56 selfloop flow, removed 7 redundant places. [2024-06-20 19:55:17,758 INFO L231 Difference]: Finished difference. Result has 290 places, 418 transitions, 6428 flow [2024-06-20 19:55:17,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6362, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6428, PETRI_PLACES=290, PETRI_TRANSITIONS=418} [2024-06-20 19:55:17,759 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 249 predicate places. [2024-06-20 19:55:17,759 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 418 transitions, 6428 flow [2024-06-20 19:55:17,759 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-20 19:55:17,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:17,759 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-20 19:55:17,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:55:17,760 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-20 19:55:17,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash 167757603, now seen corresponding path program 1 times [2024-06-20 19:55:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056045854] [2024-06-20 19:55:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056045854] [2024-06-20 19:55:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056045854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:28,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:28,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:55:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213334398] [2024-06-20 19:55:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:28,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:55:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:28,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:55:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:55:28,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:55:28,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 418 transitions, 6428 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-20 19:55:28,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:28,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:55:28,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:30,615 INFO L124 PetriNetUnfolderBase]: 3772/5696 cut-off events. [2024-06-20 19:55:30,615 INFO L125 PetriNetUnfolderBase]: For 514457/514461 co-relation queries the response was YES. [2024-06-20 19:55:30,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51154 conditions, 5696 events. 3772/5696 cut-off events. For 514457/514461 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30634 event pairs, 600 based on Foata normal form. 6/5700 useless extension candidates. Maximal degree in co-relation 51013. Up to 5491 conditions per place. [2024-06-20 19:55:30,695 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 407 selfloop transitions, 40 changer transitions 0/450 dead transitions. [2024-06-20 19:55:30,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 450 transitions, 7630 flow [2024-06-20 19:55:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:55:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:55:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-20 19:55:30,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 19:55:30,696 INFO L175 Difference]: Start difference. First operand has 290 places, 418 transitions, 6428 flow. Second operand 8 states and 130 transitions. [2024-06-20 19:55:30,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 450 transitions, 7630 flow [2024-06-20 19:55:32,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 450 transitions, 7456 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-20 19:55:32,146 INFO L231 Difference]: Finished difference. Result has 290 places, 422 transitions, 6416 flow [2024-06-20 19:55:32,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6254, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6416, PETRI_PLACES=290, PETRI_TRANSITIONS=422} [2024-06-20 19:55:32,146 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 249 predicate places. [2024-06-20 19:55:32,147 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 422 transitions, 6416 flow [2024-06-20 19:55:32,147 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-20 19:55:32,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:32,147 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-20 19:55:32,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:55:32,147 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-20 19:55:32,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1921302257, now seen corresponding path program 2 times [2024-06-20 19:55:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310033866] [2024-06-20 19:55:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55: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-20 19:55:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:43,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310033866] [2024-06-20 19:55:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310033866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:43,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:55:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451514182] [2024-06-20 19:55:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:43,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:55:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:55:43,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:55:43,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:55:43,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 422 transitions, 6416 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-20 19:55:43,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:43,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:55:43,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:45,703 INFO L124 PetriNetUnfolderBase]: 3780/5708 cut-off events. [2024-06-20 19:55:45,703 INFO L125 PetriNetUnfolderBase]: For 531381/531381 co-relation queries the response was YES. [2024-06-20 19:55:45,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50993 conditions, 5708 events. 3780/5708 cut-off events. For 531381/531381 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30819 event pairs, 724 based on Foata normal form. 2/5708 useless extension candidates. Maximal degree in co-relation 50852. Up to 5574 conditions per place. [2024-06-20 19:55:45,774 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 407 selfloop transitions, 38 changer transitions 0/448 dead transitions. [2024-06-20 19:55:45,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 448 transitions, 7438 flow [2024-06-20 19:55:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:55:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:55:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-20 19:55:45,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 19:55:45,776 INFO L175 Difference]: Start difference. First operand has 290 places, 422 transitions, 6416 flow. Second operand 8 states and 126 transitions. [2024-06-20 19:55:45,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 448 transitions, 7438 flow [2024-06-20 19:55:47,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 448 transitions, 7319 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-20 19:55:47,181 INFO L231 Difference]: Finished difference. Result has 294 places, 424 transitions, 6422 flow [2024-06-20 19:55:47,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6317, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6422, PETRI_PLACES=294, PETRI_TRANSITIONS=424} [2024-06-20 19:55:47,185 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places. [2024-06-20 19:55:47,185 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 424 transitions, 6422 flow [2024-06-20 19:55:47,185 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-20 19:55:47,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:47,186 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-20 19:55:47,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:55:47,186 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-20 19:55:47,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1923923183, now seen corresponding path program 1 times [2024-06-20 19:55:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777549824] [2024-06-20 19:55:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777549824] [2024-06-20 19:55:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777549824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:55,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:55:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120698846] [2024-06-20 19:55:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:55,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:55:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:55,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:55:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:55:56,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:55:56,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 424 transitions, 6422 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-20 19:55:56,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:56,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:55:56,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:58,273 INFO L124 PetriNetUnfolderBase]: 3822/5763 cut-off events. [2024-06-20 19:55:58,274 INFO L125 PetriNetUnfolderBase]: For 554295/554299 co-relation queries the response was YES. [2024-06-20 19:55:58,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51713 conditions, 5763 events. 3822/5763 cut-off events. For 554295/554299 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 31167 event pairs, 681 based on Foata normal form. 6/5767 useless extension candidates. Maximal degree in co-relation 51570. Up to 5570 conditions per place. [2024-06-20 19:55:58,345 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 408 selfloop transitions, 56 changer transitions 0/467 dead transitions. [2024-06-20 19:55:58,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 467 transitions, 7822 flow [2024-06-20 19:55:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:55:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:55:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-20 19:55:58,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 19:55:58,346 INFO L175 Difference]: Start difference. First operand has 294 places, 424 transitions, 6422 flow. Second operand 8 states and 132 transitions. [2024-06-20 19:55:58,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 467 transitions, 7822 flow [2024-06-20 19:55:59,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 467 transitions, 7725 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:55:59,965 INFO L231 Difference]: Finished difference. Result has 298 places, 440 transitions, 6720 flow [2024-06-20 19:55:59,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6337, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6720, PETRI_PLACES=298, PETRI_TRANSITIONS=440} [2024-06-20 19:55:59,966 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places. [2024-06-20 19:55:59,966 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 440 transitions, 6720 flow [2024-06-20 19:55:59,966 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-20 19:55:59,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:59,966 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-20 19:55:59,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:55:59,967 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-20 19:55:59,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 848674395, now seen corresponding path program 2 times [2024-06-20 19:55:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340246168] [2024-06-20 19:55:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:07,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:07,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340246168] [2024-06-20 19:56:07,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340246168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:07,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:07,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:56:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102086522] [2024-06-20 19:56:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:07,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:56:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:07,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:56:07,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:56:08,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:56:08,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 440 transitions, 6720 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-20 19:56:08,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:08,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:56:08,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:10,089 INFO L124 PetriNetUnfolderBase]: 3832/5778 cut-off events. [2024-06-20 19:56:10,089 INFO L125 PetriNetUnfolderBase]: For 571555/571559 co-relation queries the response was YES. [2024-06-20 19:56:10,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52935 conditions, 5778 events. 3832/5778 cut-off events. For 571555/571559 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31284 event pairs, 722 based on Foata normal form. 6/5782 useless extension candidates. Maximal degree in co-relation 52789. Up to 5646 conditions per place. [2024-06-20 19:56:10,165 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 416 selfloop transitions, 47 changer transitions 0/466 dead transitions. [2024-06-20 19:56:10,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 466 transitions, 7804 flow [2024-06-20 19:56:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-20 19:56:10,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 19:56:10,166 INFO L175 Difference]: Start difference. First operand has 298 places, 440 transitions, 6720 flow. Second operand 8 states and 126 transitions. [2024-06-20 19:56:10,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 466 transitions, 7804 flow [2024-06-20 19:56:11,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 466 transitions, 7690 flow, removed 53 selfloop flow, removed 2 redundant places. [2024-06-20 19:56:11,582 INFO L231 Difference]: Finished difference. Result has 304 places, 444 transitions, 6786 flow [2024-06-20 19:56:11,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6630, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6786, PETRI_PLACES=304, PETRI_TRANSITIONS=444} [2024-06-20 19:56:11,582 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 263 predicate places. [2024-06-20 19:56:11,583 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 444 transitions, 6786 flow [2024-06-20 19:56:11,583 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-20 19:56:11,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:11,583 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-20 19:56:11,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 19:56:11,583 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-20 19:56:11,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash 958251645, now seen corresponding path program 3 times [2024-06-20 19:56:11,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:11,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621807499] [2024-06-20 19:56:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:11,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621807499] [2024-06-20 19:56:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621807499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:20,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:20,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:56:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230938950] [2024-06-20 19:56:20,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:20,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:56:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:20,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:56:20,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:56:20,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:56:20,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 444 transitions, 6786 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-20 19:56:20,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:20,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:56:20,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:22,434 INFO L124 PetriNetUnfolderBase]: 3890/5857 cut-off events. [2024-06-20 19:56:22,435 INFO L125 PetriNetUnfolderBase]: For 603141/603145 co-relation queries the response was YES. [2024-06-20 19:56:22,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53901 conditions, 5857 events. 3890/5857 cut-off events. For 603141/603145 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 31728 event pairs, 682 based on Foata normal form. 6/5861 useless extension candidates. Maximal degree in co-relation 53753. Up to 5554 conditions per place. [2024-06-20 19:56:22,511 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 400 selfloop transitions, 83 changer transitions 0/486 dead transitions. [2024-06-20 19:56:22,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 486 transitions, 8428 flow [2024-06-20 19:56:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-20 19:56:22,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 19:56:22,514 INFO L175 Difference]: Start difference. First operand has 304 places, 444 transitions, 6786 flow. Second operand 8 states and 133 transitions. [2024-06-20 19:56:22,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 486 transitions, 8428 flow [2024-06-20 19:56:23,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 486 transitions, 8312 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-20 19:56:23,910 INFO L231 Difference]: Finished difference. Result has 307 places, 459 transitions, 7142 flow [2024-06-20 19:56:23,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6670, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7142, PETRI_PLACES=307, PETRI_TRANSITIONS=459} [2024-06-20 19:56:23,910 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 266 predicate places. [2024-06-20 19:56:23,910 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 459 transitions, 7142 flow [2024-06-20 19:56:23,911 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-20 19:56:23,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:23,911 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-20 19:56:23,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 19:56:23,911 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-20 19:56:23,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2039513255, now seen corresponding path program 1 times [2024-06-20 19:56:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:23,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739737485] [2024-06-20 19:56:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739737485] [2024-06-20 19:56:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739737485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:56:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796205916] [2024-06-20 19:56:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:56:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:56:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:56:31,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:56:31,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 459 transitions, 7142 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-20 19:56:31,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:31,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:56:31,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:33,986 INFO L124 PetriNetUnfolderBase]: 3932/5918 cut-off events. [2024-06-20 19:56:33,986 INFO L125 PetriNetUnfolderBase]: For 634025/634025 co-relation queries the response was YES. [2024-06-20 19:56:34,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55602 conditions, 5918 events. 3932/5918 cut-off events. For 634025/634025 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32093 event pairs, 740 based on Foata normal form. 2/5918 useless extension candidates. Maximal degree in co-relation 55453. Up to 5766 conditions per place. [2024-06-20 19:56:34,061 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 428 selfloop transitions, 60 changer transitions 0/491 dead transitions. [2024-06-20 19:56:34,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 491 transitions, 8614 flow [2024-06-20 19:56:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-20 19:56:34,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-20 19:56:34,067 INFO L175 Difference]: Start difference. First operand has 307 places, 459 transitions, 7142 flow. Second operand 8 states and 129 transitions. [2024-06-20 19:56:34,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 491 transitions, 8614 flow [2024-06-20 19:56:35,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 491 transitions, 8447 flow, removed 65 selfloop flow, removed 3 redundant places. [2024-06-20 19:56:35,709 INFO L231 Difference]: Finished difference. Result has 313 places, 468 transitions, 7399 flow [2024-06-20 19:56:35,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6975, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7399, PETRI_PLACES=313, PETRI_TRANSITIONS=468} [2024-06-20 19:56:35,710 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2024-06-20 19:56:35,710 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 468 transitions, 7399 flow [2024-06-20 19:56:35,710 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-20 19:56:35,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:35,710 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-20 19:56:35,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 19:56:35,711 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-20 19:56:35,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -551103827, now seen corresponding path program 1 times [2024-06-20 19:56:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432017658] [2024-06-20 19:56:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:43,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432017658] [2024-06-20 19:56:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432017658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:56:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497829429] [2024-06-20 19:56:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:43,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:56:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:56:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:56:44,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:56:44,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 468 transitions, 7399 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-20 19:56:44,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:44,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:56:44,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:46,105 INFO L124 PetriNetUnfolderBase]: 3937/5925 cut-off events. [2024-06-20 19:56:46,105 INFO L125 PetriNetUnfolderBase]: For 646903/646903 co-relation queries the response was YES. [2024-06-20 19:56:46,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55642 conditions, 5925 events. 3937/5925 cut-off events. For 646903/646903 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32121 event pairs, 732 based on Foata normal form. 1/5924 useless extension candidates. Maximal degree in co-relation 55490. Up to 5841 conditions per place. [2024-06-20 19:56:46,184 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 452 selfloop transitions, 35 changer transitions 0/490 dead transitions. [2024-06-20 19:56:46,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 490 transitions, 8512 flow [2024-06-20 19:56:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-20 19:56:46,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-20 19:56:46,186 INFO L175 Difference]: Start difference. First operand has 313 places, 468 transitions, 7399 flow. Second operand 8 states and 121 transitions. [2024-06-20 19:56:46,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 490 transitions, 8512 flow [2024-06-20 19:56:47,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 490 transitions, 8361 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-20 19:56:47,818 INFO L231 Difference]: Finished difference. Result has 317 places, 471 transitions, 7397 flow [2024-06-20 19:56:47,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7248, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7397, PETRI_PLACES=317, PETRI_TRANSITIONS=471} [2024-06-20 19:56:47,818 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places. [2024-06-20 19:56:47,818 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 471 transitions, 7397 flow [2024-06-20 19:56:47,819 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-20 19:56:47,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:47,819 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-20 19:56:47,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 19:56:47,819 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-20 19:56:47,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2039512883, now seen corresponding path program 4 times [2024-06-20 19:56:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:47,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133796802] [2024-06-20 19:56:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:55,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:55,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133796802] [2024-06-20 19:56:55,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133796802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:55,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:56:55,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919436201] [2024-06-20 19:56:55,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:55,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:56:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:56:55,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:56:55,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:56:55,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 471 transitions, 7397 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-20 19:56:55,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:55,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:56:55,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:57,916 INFO L124 PetriNetUnfolderBase]: 3955/5947 cut-off events. [2024-06-20 19:56:57,916 INFO L125 PetriNetUnfolderBase]: For 667130/667134 co-relation queries the response was YES. [2024-06-20 19:56:57,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55997 conditions, 5947 events. 3955/5947 cut-off events. For 667130/667134 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32205 event pairs, 678 based on Foata normal form. 6/5951 useless extension candidates. Maximal degree in co-relation 55843. Up to 5638 conditions per place. [2024-06-20 19:56:57,997 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 408 selfloop transitions, 90 changer transitions 0/501 dead transitions. [2024-06-20 19:56:57,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 501 transitions, 8867 flow [2024-06-20 19:56:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-20 19:56:58,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 19:56:58,000 INFO L175 Difference]: Start difference. First operand has 317 places, 471 transitions, 7397 flow. Second operand 8 states and 130 transitions. [2024-06-20 19:56:58,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 501 transitions, 8867 flow [2024-06-20 19:56:59,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 501 transitions, 8775 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-20 19:56:59,883 INFO L231 Difference]: Finished difference. Result has 320 places, 477 transitions, 7579 flow [2024-06-20 19:56:59,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7305, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7579, PETRI_PLACES=320, PETRI_TRANSITIONS=477} [2024-06-20 19:56:59,884 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 279 predicate places. [2024-06-20 19:56:59,884 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 477 transitions, 7579 flow [2024-06-20 19:56:59,885 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-20 19:56:59,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:59,885 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-20 19:56:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 19:56:59,886 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-20 19:56:59,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1550490729, now seen corresponding path program 5 times [2024-06-20 19:56:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:59,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820590841] [2024-06-20 19:56:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:57:07,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:07,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820590841] [2024-06-20 19:57:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820590841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:07,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:07,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:57:07,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214031532] [2024-06-20 19:57:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:07,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:57:07,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:57:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:57:07,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:57:07,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 477 transitions, 7579 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-20 19:57:07,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:07,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:57:07,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:57:09,549 INFO L124 PetriNetUnfolderBase]: 3949/5939 cut-off events. [2024-06-20 19:57:09,550 INFO L125 PetriNetUnfolderBase]: For 680637/680641 co-relation queries the response was YES. [2024-06-20 19:57:09,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56236 conditions, 5939 events. 3949/5939 cut-off events. For 680637/680641 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32171 event pairs, 711 based on Foata normal form. 6/5943 useless extension candidates. Maximal degree in co-relation 56081. Up to 5784 conditions per place. [2024-06-20 19:57:09,627 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 439 selfloop transitions, 55 changer transitions 0/497 dead transitions. [2024-06-20 19:57:09,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 497 transitions, 8796 flow [2024-06-20 19:57:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:57:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:57:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-20 19:57:09,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-20 19:57:09,629 INFO L175 Difference]: Start difference. First operand has 320 places, 477 transitions, 7579 flow. Second operand 8 states and 125 transitions. [2024-06-20 19:57:09,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 497 transitions, 8796 flow [2024-06-20 19:57:11,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 497 transitions, 8657 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-20 19:57:11,877 INFO L231 Difference]: Finished difference. Result has 324 places, 477 transitions, 7556 flow [2024-06-20 19:57:11,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7440, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7556, PETRI_PLACES=324, PETRI_TRANSITIONS=477} [2024-06-20 19:57:11,878 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 283 predicate places. [2024-06-20 19:57:11,878 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 477 transitions, 7556 flow [2024-06-20 19:57:11,878 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-20 19:57:11,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:11,879 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-20 19:57:11,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 19:57:11,879 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-20 19:57:11,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2078442863, now seen corresponding path program 6 times [2024-06-20 19:57:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962799796] [2024-06-20 19:57:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:57:19,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962799796] [2024-06-20 19:57:19,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962799796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:19,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:19,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:57:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829873332] [2024-06-20 19:57:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:19,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:57:19,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:57:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:57:19,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:57:19,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 477 transitions, 7556 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-20 19:57:19,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:19,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:57:19,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:57:21,683 INFO L124 PetriNetUnfolderBase]: 3943/5931 cut-off events. [2024-06-20 19:57:21,684 INFO L125 PetriNetUnfolderBase]: For 689129/689133 co-relation queries the response was YES. [2024-06-20 19:57:21,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56112 conditions, 5931 events. 3943/5931 cut-off events. For 689129/689133 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32137 event pairs, 724 based on Foata normal form. 6/5935 useless extension candidates. Maximal degree in co-relation 55956. Up to 5800 conditions per place. [2024-06-20 19:57:21,763 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 447 selfloop transitions, 45 changer transitions 0/495 dead transitions. [2024-06-20 19:57:21,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 495 transitions, 8613 flow [2024-06-20 19:57:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:57:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:57:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-20 19:57:21,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-20 19:57:21,766 INFO L175 Difference]: Start difference. First operand has 324 places, 477 transitions, 7556 flow. Second operand 8 states and 122 transitions. [2024-06-20 19:57:21,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 495 transitions, 8613 flow [2024-06-20 19:57:23,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 495 transitions, 8478 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-20 19:57:23,785 INFO L231 Difference]: Finished difference. Result has 328 places, 478 transitions, 7532 flow [2024-06-20 19:57:23,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7421, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7532, PETRI_PLACES=328, PETRI_TRANSITIONS=478} [2024-06-20 19:57:23,786 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 287 predicate places. [2024-06-20 19:57:23,786 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 478 transitions, 7532 flow [2024-06-20 19:57:23,786 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-20 19:57:23,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:23,786 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-20 19:57:23,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 19:57:23,786 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:57:23,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2078085371, now seen corresponding path program 2 times [2024-06-20 19:57:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:23,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663028392] [2024-06-20 19:57:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:57:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663028392] [2024-06-20 19:57:31,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663028392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:31,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:31,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:57:31,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022636121] [2024-06-20 19:57:31,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:31,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:57:31,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:31,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:57:31,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:57:31,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:57:31,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 478 transitions, 7532 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-20 19:57:31,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:31,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:57:31,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:57:33,711 INFO L124 PetriNetUnfolderBase]: 3953/5948 cut-off events. [2024-06-20 19:57:33,712 INFO L125 PetriNetUnfolderBase]: For 708200/708200 co-relation queries the response was YES. [2024-06-20 19:57:33,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56438 conditions, 5948 events. 3953/5948 cut-off events. For 708200/708200 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 32234 event pairs, 732 based on Foata normal form. 2/5948 useless extension candidates. Maximal degree in co-relation 56280. Up to 5861 conditions per place. [2024-06-20 19:57:33,795 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 457 selfloop transitions, 39 changer transitions 0/499 dead transitions. [2024-06-20 19:57:33,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 499 transitions, 8676 flow [2024-06-20 19:57:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:57:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:57:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-20 19:57:33,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-20 19:57:33,796 INFO L175 Difference]: Start difference. First operand has 328 places, 478 transitions, 7532 flow. Second operand 8 states and 123 transitions. [2024-06-20 19:57:33,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 499 transitions, 8676 flow [2024-06-20 19:57:36,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 499 transitions, 8586 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 19:57:36,042 INFO L231 Difference]: Finished difference. Result has 332 places, 481 transitions, 7610 flow [2024-06-20 19:57:36,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7442, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7610, PETRI_PLACES=332, PETRI_TRANSITIONS=481} [2024-06-20 19:57:36,043 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-20 19:57:36,043 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 481 transitions, 7610 flow [2024-06-20 19:57:36,043 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-20 19:57:36,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:36,043 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-20 19:57:36,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 19:57:36,044 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:57:36,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1414534429, now seen corresponding path program 3 times [2024-06-20 19:57:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960325720] [2024-06-20 19:57:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:57:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960325720] [2024-06-20 19:57:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960325720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:57:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916181770] [2024-06-20 19:57:44,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:44,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:57:44,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:44,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:57:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:57:44,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-20 19:57:44,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 481 transitions, 7610 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-20 19:57:44,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:44,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-20 19:57:44,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15