./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix031.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix031.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix031.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:36:56,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:36:56,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:36:56,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:36:56,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:36:56,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:36:56,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:36:56,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:36:56,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:36:56,313 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:36:56,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:36:56,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:36:56,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:36:56,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:36:56,315 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:36:56,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:36:56,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:36:56,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:36:56,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:36:56,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:36:56,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:36:56,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:36:56,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:36:56,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:36:56,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:36:56,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:36:56,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:36:56,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:36:56,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:36:56,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:36:56,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:36:56,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:36:56,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:36:56,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:36:56,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:36:56,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:36:56,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:36:56,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:36:56,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:36:56,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:36:56,321 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:36:56,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:36:56,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:36:56,322 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 11:36:56,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:36:56,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:36:56,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:36:56,556 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:36:56,557 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:36:56,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix031.oepc.yml/witness.yml [2024-05-12 11:36:56,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:36:56,774 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:36:56,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-05-12 11:36:57,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:36:58,027 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:36:58,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-05-12 11:36:58,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2711a2899/f14c9d110dae45918351546ea3eec3d3/FLAG06e258613 [2024-05-12 11:36:58,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2711a2899/f14c9d110dae45918351546ea3eec3d3 [2024-05-12 11:36:58,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:36:58,070 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:36:58,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:36:58,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:36:58,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:36:58,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:36:56" (1/2) ... [2024-05-12 11:36:58,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea185b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:36:58, skipping insertion in model container [2024-05-12 11:36:58,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:36:56" (1/2) ... [2024-05-12 11:36:58,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@368bfc23 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:36:58, skipping insertion in model container [2024-05-12 11:36:58,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:36:58" (2/2) ... [2024-05-12 11:36:58,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58, skipping insertion in model container [2024-05-12 11:36:58,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:36:58" (2/2) ... [2024-05-12 11:36:58,081 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:36:58,141 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:36:58,142 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 11:36:58,143 INFO L97 edCorrectnessWitness]: Location invariant before [L831-L831] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 11:36:58,143 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:36:58,143 INFO L106 edCorrectnessWitness]: ghost_update [L828-L828] multithreaded = 1; [2024-05-12 11:36:58,178 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:36:58,321 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i[945,958] [2024-05-12 11:36:58,514 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:36:58,523 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:36:58,558 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:36:58,799 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:36:58,832 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:36:58,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58 WrapperNode [2024-05-12 11:36:58,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:36:58,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:36:58,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:36:58,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:36:58,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:58,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:58,982 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-05-12 11:36:58,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:36:58,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:36:58,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:36:58,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:36:58,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:58,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,046 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 11:36:59,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:36:59,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:36:59,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:36:59,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:36:59,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (1/1) ... [2024-05-12 11:36:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:36:59,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:36:59,133 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-05-12 11:36:59,152 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-05-12 11:36:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:36:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:36:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:36:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:36:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:36:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:36:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:36:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:36:59,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:36:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:36:59,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:36:59,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:36:59,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:36:59,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:36:59,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:36:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:36:59,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:36:59,169 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:36:59,274 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:36:59,276 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:37:00,103 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:37:00,103 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:37:00,300 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:37:00,300 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:37:00,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:37:00 BoogieIcfgContainer [2024-05-12 11:37:00,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:37:00,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:37:00,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:37:00,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:37:00,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:36:56" (1/4) ... [2024-05-12 11:37:00,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624b57ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:37:00, skipping insertion in model container [2024-05-12 11:37:00,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:36:58" (2/4) ... [2024-05-12 11:37:00,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624b57ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:37:00, skipping insertion in model container [2024-05-12 11:37:00,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:36:58" (3/4) ... [2024-05-12 11:37:00,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624b57ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:37:00, skipping insertion in model container [2024-05-12 11:37:00,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:37:00" (4/4) ... [2024-05-12 11:37:00,310 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2024-05-12 11:37:00,323 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:37:00,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 11:37:00,323 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:37:00,413 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:37:00,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 88 flow [2024-05-12 11:37:00,479 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-05-12 11:37:00,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:37:00,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-05-12 11:37:00,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 88 flow [2024-05-12 11:37:00,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 38 transitions, 82 flow [2024-05-12 11:37:00,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:37:00,515 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;@30b8580e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:37:00,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 11:37:00,523 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:37:00,523 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:37:00,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:37:00,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:00,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:37:00,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:00,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1517500681, now seen corresponding path program 1 times [2024-05-12 11:37:00,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:00,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024683357] [2024-05-12 11:37:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:06,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:06,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024683357] [2024-05-12 11:37:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024683357] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:06,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:06,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:37:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798426737] [2024-05-12 11:37:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:06,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:37:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:37:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:37:06,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-05-12 11:37:06,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:06,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:06,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-05-12 11:37:06,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:06,669 INFO L124 PetriNetUnfolderBase]: 559/987 cut-off events. [2024-05-12 11:37:06,669 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 11:37:06,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 987 events. 559/987 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5159 event pairs, 217 based on Foata normal form. 50/963 useless extension candidates. Maximal degree in co-relation 1924. Up to 920 conditions per place. [2024-05-12 11:37:06,677 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 33 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-05-12 11:37:06,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 179 flow [2024-05-12 11:37:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:37:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:37:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-05-12 11:37:06,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-05-12 11:37:06,687 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 82 flow. Second operand 3 states and 80 transitions. [2024-05-12 11:37:06,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 179 flow [2024-05-12 11:37:06,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:37:06,691 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 106 flow [2024-05-12 11:37:06,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-05-12 11:37:06,695 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-05-12 11:37:06,695 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 106 flow [2024-05-12 11:37:06,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:06,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:06,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:37:06,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:37:06,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:06,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1517501614, now seen corresponding path program 1 times [2024-05-12 11:37:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007848448] [2024-05-12 11:37:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:06,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007848448] [2024-05-12 11:37:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007848448] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:06,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:37:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928636304] [2024-05-12 11:37:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:06,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:37:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:06,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:37:06,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:37:06,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2024-05-12 11:37:06,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:06,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:06,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2024-05-12 11:37:06,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:06,890 INFO L124 PetriNetUnfolderBase]: 169/417 cut-off events. [2024-05-12 11:37:06,890 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 11:37:06,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 417 events. 169/417 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2258 event pairs, 96 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 773. Up to 256 conditions per place. [2024-05-12 11:37:06,893 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 25 selfloop transitions, 3 changer transitions 2/49 dead transitions. [2024-05-12 11:37:06,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 181 flow [2024-05-12 11:37:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:37:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:37:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-05-12 11:37:06,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-05-12 11:37:06,895 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 106 flow. Second operand 3 states and 90 transitions. [2024-05-12 11:37:06,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 181 flow [2024-05-12 11:37:06,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:37:06,897 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 98 flow [2024-05-12 11:37:06,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-05-12 11:37:06,898 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-05-12 11:37:06,898 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 98 flow [2024-05-12 11:37:06,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:06,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:06,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:06,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:37:06,899 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:06,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1970714105, now seen corresponding path program 1 times [2024-05-12 11:37:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335129753] [2024-05-12 11:37:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:11,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335129753] [2024-05-12 11:37:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335129753] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:11,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:11,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:37:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397551974] [2024-05-12 11:37:11,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:37:11,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:37:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:37:11,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-05-12 11:37:11,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-05-12 11:37:11,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:11,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-05-12 11:37:11,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:11,612 INFO L124 PetriNetUnfolderBase]: 402/808 cut-off events. [2024-05-12 11:37:11,613 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-05-12 11:37:11,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 808 events. 402/808 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4398 event pairs, 196 based on Foata normal form. 2/769 useless extension candidates. Maximal degree in co-relation 1659. Up to 658 conditions per place. [2024-05-12 11:37:11,616 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 37 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2024-05-12 11:37:11,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 230 flow [2024-05-12 11:37:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:37:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:37:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-05-12 11:37:11,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-05-12 11:37:11,618 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 98 flow. Second operand 4 states and 95 transitions. [2024-05-12 11:37:11,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 230 flow [2024-05-12 11:37:11,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:37:11,619 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 141 flow [2024-05-12 11:37:11,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-05-12 11:37:11,620 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-05-12 11:37:11,620 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 141 flow [2024-05-12 11:37:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-05-12 11:37:11,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:11,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:11,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:37:11,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:11,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash -962594642, now seen corresponding path program 1 times [2024-05-12 11:37:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479342702] [2024-05-12 11:37:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:15,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:15,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479342702] [2024-05-12 11:37:15,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479342702] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:15,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:15,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:37:15,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419798108] [2024-05-12 11:37:15,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:15,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:37:15,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:37:15,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:37:15,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 11:37:15,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:15,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:15,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 11:37:15,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:15,709 INFO L124 PetriNetUnfolderBase]: 477/945 cut-off events. [2024-05-12 11:37:15,710 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2024-05-12 11:37:15,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 945 events. 477/945 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5187 event pairs, 207 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 2107. Up to 764 conditions per place. [2024-05-12 11:37:15,715 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 45 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2024-05-12 11:37:15,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 303 flow [2024-05-12 11:37:15,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:37:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:37:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-05-12 11:37:15,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.565 [2024-05-12 11:37:15,719 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 141 flow. Second operand 5 states and 113 transitions. [2024-05-12 11:37:15,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 303 flow [2024-05-12 11:37:15,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 296 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 11:37:15,722 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 169 flow [2024-05-12 11:37:15,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-05-12 11:37:15,724 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2024-05-12 11:37:15,724 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 169 flow [2024-05-12 11:37:15,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:15,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:15,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:15,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:37:15,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:15,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash 224337670, now seen corresponding path program 1 times [2024-05-12 11:37:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166064075] [2024-05-12 11:37:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:19,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-05-12 11:37:19,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:19,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166064075] [2024-05-12 11:37:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166064075] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:19,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:19,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:37:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847556797] [2024-05-12 11:37:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:19,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:37:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:37:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:37:19,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 11:37:19,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:19,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:19,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 11:37:19,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:19,934 INFO L124 PetriNetUnfolderBase]: 477/952 cut-off events. [2024-05-12 11:37:19,934 INFO L125 PetriNetUnfolderBase]: For 637/637 co-relation queries the response was YES. [2024-05-12 11:37:19,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 952 events. 477/952 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5257 event pairs, 162 based on Foata normal form. 2/915 useless extension candidates. Maximal degree in co-relation 2254. Up to 749 conditions per place. [2024-05-12 11:37:19,941 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 52 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2024-05-12 11:37:19,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 369 flow [2024-05-12 11:37:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:37:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:37:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-05-12 11:37:19,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2024-05-12 11:37:19,943 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 169 flow. Second operand 6 states and 134 transitions. [2024-05-12 11:37:19,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 369 flow [2024-05-12 11:37:19,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 352 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 11:37:19,946 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 193 flow [2024-05-12 11:37:19,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-05-12 11:37:19,947 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2024-05-12 11:37:19,947 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 193 flow [2024-05-12 11:37:19,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:19,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:19,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:19,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:37:19,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:19,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1650267464, now seen corresponding path program 1 times [2024-05-12 11:37:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:19,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890772856] [2024-05-12 11:37:19,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:19,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890772856] [2024-05-12 11:37:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890772856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:29,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:37:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688422811] [2024-05-12 11:37:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:29,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:37:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:29,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:37:29,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:37:29,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 11:37:29,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:29,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:29,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 11:37:29,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:29,853 INFO L124 PetriNetUnfolderBase]: 603/1219 cut-off events. [2024-05-12 11:37:29,854 INFO L125 PetriNetUnfolderBase]: For 1096/1098 co-relation queries the response was YES. [2024-05-12 11:37:29,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 1219 events. 603/1219 cut-off events. For 1096/1098 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6953 event pairs, 274 based on Foata normal form. 3/1182 useless extension candidates. Maximal degree in co-relation 2947. Up to 987 conditions per place. [2024-05-12 11:37:29,859 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 42 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-05-12 11:37:29,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 327 flow [2024-05-12 11:37:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:37:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:37:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-05-12 11:37:29,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495 [2024-05-12 11:37:29,862 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 193 flow. Second operand 5 states and 99 transitions. [2024-05-12 11:37:29,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 327 flow [2024-05-12 11:37:29,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 304 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 11:37:29,866 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 202 flow [2024-05-12 11:37:29,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-05-12 11:37:29,868 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2024-05-12 11:37:29,868 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 202 flow [2024-05-12 11:37:29,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:29,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:29,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:29,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:37:29,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:29,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash 729548937, now seen corresponding path program 1 times [2024-05-12 11:37:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:29,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755448506] [2024-05-12 11:37:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:34,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755448506] [2024-05-12 11:37:34,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755448506] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:34,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:37:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427419410] [2024-05-12 11:37:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:34,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:37:34,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:34,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:37:34,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:37:34,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 11:37:34,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:34,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:34,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 11:37:34,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:34,895 INFO L124 PetriNetUnfolderBase]: 547/981 cut-off events. [2024-05-12 11:37:34,895 INFO L125 PetriNetUnfolderBase]: For 1206/1206 co-relation queries the response was YES. [2024-05-12 11:37:34,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 981 events. 547/981 cut-off events. For 1206/1206 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5008 event pairs, 89 based on Foata normal form. 2/976 useless extension candidates. Maximal degree in co-relation 2657. Up to 816 conditions per place. [2024-05-12 11:37:34,900 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 69 selfloop transitions, 22 changer transitions 0/100 dead transitions. [2024-05-12 11:37:34,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 558 flow [2024-05-12 11:37:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:37:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:37:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-05-12 11:37:34,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-05-12 11:37:34,903 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 202 flow. Second operand 8 states and 170 transitions. [2024-05-12 11:37:34,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 558 flow [2024-05-12 11:37:34,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 544 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-05-12 11:37:34,907 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 344 flow [2024-05-12 11:37:34,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=344, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-05-12 11:37:34,908 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2024-05-12 11:37:34,908 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 344 flow [2024-05-12 11:37:34,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:34,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:34,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:34,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:37:34,909 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:34,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash 381317065, now seen corresponding path program 1 times [2024-05-12 11:37:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435305842] [2024-05-12 11:37:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:44,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435305842] [2024-05-12 11:37:44,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435305842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:37:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978784413] [2024-05-12 11:37:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:44,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:37:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:37:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:37:44,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:37:44,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 344 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:44,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:44,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:37:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:45,552 INFO L124 PetriNetUnfolderBase]: 687/1312 cut-off events. [2024-05-12 11:37:45,552 INFO L125 PetriNetUnfolderBase]: For 2204/2210 co-relation queries the response was YES. [2024-05-12 11:37:45,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3783 conditions, 1312 events. 687/1312 cut-off events. For 2204/2210 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7281 event pairs, 215 based on Foata normal form. 7/1281 useless extension candidates. Maximal degree in co-relation 3756. Up to 1114 conditions per place. [2024-05-12 11:37:45,559 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 58 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2024-05-12 11:37:45,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 528 flow [2024-05-12 11:37:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:37:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:37:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-05-12 11:37:45,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 11:37:45,567 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 344 flow. Second operand 6 states and 112 transitions. [2024-05-12 11:37:45,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 528 flow [2024-05-12 11:37:45,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 491 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-05-12 11:37:45,571 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 344 flow [2024-05-12 11:37:45,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-05-12 11:37:45,573 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2024-05-12 11:37:45,573 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 344 flow [2024-05-12 11:37:45,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:45,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:45,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:37:45,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:45,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1122455214, now seen corresponding path program 1 times [2024-05-12 11:37:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562749329] [2024-05-12 11:37:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562749329] [2024-05-12 11:37:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562749329] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:52,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:37:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538647025] [2024-05-12 11:37:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:37:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:52,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:37:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:37:52,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 11:37:52,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 344 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:52,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:52,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 11:37:52,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:53,359 INFO L124 PetriNetUnfolderBase]: 637/1227 cut-off events. [2024-05-12 11:37:53,359 INFO L125 PetriNetUnfolderBase]: For 2539/2542 co-relation queries the response was YES. [2024-05-12 11:37:53,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 1227 events. 637/1227 cut-off events. For 2539/2542 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6782 event pairs, 150 based on Foata normal form. 4/1198 useless extension candidates. Maximal degree in co-relation 3708. Up to 999 conditions per place. [2024-05-12 11:37:53,365 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 63 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-05-12 11:37:53,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 595 flow [2024-05-12 11:37:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:37:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:37:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-05-12 11:37:53,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-05-12 11:37:53,366 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 344 flow. Second operand 6 states and 122 transitions. [2024-05-12 11:37:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 595 flow [2024-05-12 11:37:53,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 88 transitions, 571 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 11:37:53,369 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 404 flow [2024-05-12 11:37:53,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2024-05-12 11:37:53,370 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2024-05-12 11:37:53,370 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 404 flow [2024-05-12 11:37:53,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:53,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:53,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:53,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:37:53,371 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:53,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash 274942700, now seen corresponding path program 1 times [2024-05-12 11:37:53,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:53,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429502426] [2024-05-12 11:37:53,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429502426] [2024-05-12 11:37:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429502426] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:58,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:37:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265843359] [2024-05-12 11:37:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:58,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:37:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:37:58,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:37:58,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 11:37:58,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 404 flow. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:58,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:58,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 11:37:58,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:59,358 INFO L124 PetriNetUnfolderBase]: 592/1182 cut-off events. [2024-05-12 11:37:59,358 INFO L125 PetriNetUnfolderBase]: For 3159/3159 co-relation queries the response was YES. [2024-05-12 11:37:59,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 1182 events. 592/1182 cut-off events. For 3159/3159 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6633 event pairs, 172 based on Foata normal form. 4/1142 useless extension candidates. Maximal degree in co-relation 3711. Up to 848 conditions per place. [2024-05-12 11:37:59,365 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 79 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2024-05-12 11:37:59,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 113 transitions, 726 flow [2024-05-12 11:37:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:37:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:37:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-05-12 11:37:59,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49 [2024-05-12 11:37:59,367 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 404 flow. Second operand 10 states and 196 transitions. [2024-05-12 11:37:59,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 113 transitions, 726 flow [2024-05-12 11:37:59,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 113 transitions, 718 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 11:37:59,371 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 436 flow [2024-05-12 11:37:59,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=436, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-05-12 11:37:59,373 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2024-05-12 11:37:59,373 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 436 flow [2024-05-12 11:37:59,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:59,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:59,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:59,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:37:59,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:59,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1122245964, now seen corresponding path program 2 times [2024-05-12 11:37:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:59,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291856103] [2024-05-12 11:37:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:06,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:06,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291856103] [2024-05-12 11:38:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291856103] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:06,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:38:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233148888] [2024-05-12 11:38:06,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:06,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:38:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:38:06,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:38:06,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 11:38:06,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 436 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:38:06,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:06,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 11:38:06,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:07,315 INFO L124 PetriNetUnfolderBase]: 639/1246 cut-off events. [2024-05-12 11:38:07,315 INFO L125 PetriNetUnfolderBase]: For 3763/3769 co-relation queries the response was YES. [2024-05-12 11:38:07,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4117 conditions, 1246 events. 639/1246 cut-off events. For 3763/3769 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6983 event pairs, 198 based on Foata normal form. 7/1220 useless extension candidates. Maximal degree in co-relation 4082. Up to 1028 conditions per place. [2024-05-12 11:38:07,324 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 59 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-05-12 11:38:07,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 81 transitions, 608 flow [2024-05-12 11:38:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:38:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:38:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-05-12 11:38:07,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 11:38:07,325 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 436 flow. Second operand 6 states and 114 transitions. [2024-05-12 11:38:07,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 81 transitions, 608 flow [2024-05-12 11:38:07,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 537 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-05-12 11:38:07,330 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 390 flow [2024-05-12 11:38:07,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2024-05-12 11:38:07,331 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2024-05-12 11:38:07,331 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 390 flow [2024-05-12 11:38:07,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:38:07,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:07,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:07,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:38:07,332 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:07,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1064071945, now seen corresponding path program 1 times [2024-05-12 11:38:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673121447] [2024-05-12 11:38:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:17,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673121447] [2024-05-12 11:38:17,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673121447] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:17,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:17,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359833675] [2024-05-12 11:38:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:17,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:17,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:17,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:38:17,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 390 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:17,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:17,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:38:17,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:18,743 INFO L124 PetriNetUnfolderBase]: 690/1284 cut-off events. [2024-05-12 11:38:18,743 INFO L125 PetriNetUnfolderBase]: For 4027/4033 co-relation queries the response was YES. [2024-05-12 11:38:18,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4134 conditions, 1284 events. 690/1284 cut-off events. For 4027/4033 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6956 event pairs, 203 based on Foata normal form. 9/1262 useless extension candidates. Maximal degree in co-relation 4099. Up to 1083 conditions per place. [2024-05-12 11:38:18,752 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 68 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2024-05-12 11:38:18,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 620 flow [2024-05-12 11:38:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-05-12 11:38:18,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-05-12 11:38:18,754 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 390 flow. Second operand 7 states and 130 transitions. [2024-05-12 11:38:18,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 620 flow [2024-05-12 11:38:18,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 92 transitions, 589 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 11:38:18,758 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 406 flow [2024-05-12 11:38:18,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-05-12 11:38:18,759 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2024-05-12 11:38:18,759 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 406 flow [2024-05-12 11:38:18,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:18,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:18,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:18,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:38:18,761 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:18,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1108217201, now seen corresponding path program 1 times [2024-05-12 11:38:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071614159] [2024-05-12 11:38:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:25,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:25,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071614159] [2024-05-12 11:38:25,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071614159] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:25,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497532345] [2024-05-12 11:38:25,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:25,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:25,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:25,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:38:25,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 406 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:25,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:25,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:38:25,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:26,399 INFO L124 PetriNetUnfolderBase]: 684/1282 cut-off events. [2024-05-12 11:38:26,400 INFO L125 PetriNetUnfolderBase]: For 4528/4530 co-relation queries the response was YES. [2024-05-12 11:38:26,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 1282 events. 684/1282 cut-off events. For 4528/4530 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6955 event pairs, 145 based on Foata normal form. 3/1250 useless extension candidates. Maximal degree in co-relation 4278. Up to 1022 conditions per place. [2024-05-12 11:38:26,410 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 74 selfloop transitions, 18 changer transitions 0/101 dead transitions. [2024-05-12 11:38:26,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 101 transitions, 710 flow [2024-05-12 11:38:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-05-12 11:38:26,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-05-12 11:38:26,412 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 406 flow. Second operand 7 states and 137 transitions. [2024-05-12 11:38:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 101 transitions, 710 flow [2024-05-12 11:38:26,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 679 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 11:38:26,419 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 444 flow [2024-05-12 11:38:26,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2024-05-12 11:38:26,420 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2024-05-12 11:38:26,420 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 444 flow [2024-05-12 11:38:26,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:26,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:26,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:26,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:38:26,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:26,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash -436372617, now seen corresponding path program 2 times [2024-05-12 11:38:26,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:26,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733217053] [2024-05-12 11:38:26,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733217053] [2024-05-12 11:38:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733217053] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555147094] [2024-05-12 11:38:34,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:34,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:34,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:38:34,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 444 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:34,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:34,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:38:34,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:35,084 INFO L124 PetriNetUnfolderBase]: 695/1297 cut-off events. [2024-05-12 11:38:35,085 INFO L125 PetriNetUnfolderBase]: For 5191/5193 co-relation queries the response was YES. [2024-05-12 11:38:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 1297 events. 695/1297 cut-off events. For 5191/5193 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7016 event pairs, 147 based on Foata normal form. 3/1266 useless extension candidates. Maximal degree in co-relation 4468. Up to 1034 conditions per place. [2024-05-12 11:38:35,092 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 72 selfloop transitions, 19 changer transitions 0/100 dead transitions. [2024-05-12 11:38:35,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 100 transitions, 732 flow [2024-05-12 11:38:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-05-12 11:38:35,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-05-12 11:38:35,105 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 444 flow. Second operand 7 states and 135 transitions. [2024-05-12 11:38:35,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 100 transitions, 732 flow [2024-05-12 11:38:35,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 100 transitions, 705 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 11:38:35,114 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 476 flow [2024-05-12 11:38:35,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2024-05-12 11:38:35,114 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2024-05-12 11:38:35,115 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 476 flow [2024-05-12 11:38:35,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:35,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:35,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:35,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:38:35,115 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:35,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash -436372369, now seen corresponding path program 1 times [2024-05-12 11:38:35,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:35,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805315550] [2024-05-12 11:38:35,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805315550] [2024-05-12 11:38:43,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805315550] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:43,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:43,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504902943] [2024-05-12 11:38:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:43,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:43,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:43,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:43,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:38:43,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 476 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:43,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:43,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:38:43,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:43,838 INFO L124 PetriNetUnfolderBase]: 735/1367 cut-off events. [2024-05-12 11:38:43,838 INFO L125 PetriNetUnfolderBase]: For 5704/5707 co-relation queries the response was YES. [2024-05-12 11:38:43,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 1367 events. 735/1367 cut-off events. For 5704/5707 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7440 event pairs, 159 based on Foata normal form. 4/1330 useless extension candidates. Maximal degree in co-relation 4694. Up to 1111 conditions per place. [2024-05-12 11:38:43,844 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 76 selfloop transitions, 18 changer transitions 0/107 dead transitions. [2024-05-12 11:38:43,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 796 flow [2024-05-12 11:38:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-05-12 11:38:43,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-05-12 11:38:43,846 INFO L175 Difference]: Start difference. First operand has 85 places, 75 transitions, 476 flow. Second operand 7 states and 135 transitions. [2024-05-12 11:38:43,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 796 flow [2024-05-12 11:38:43,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 107 transitions, 763 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 11:38:43,851 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 542 flow [2024-05-12 11:38:43,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=542, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2024-05-12 11:38:43,852 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2024-05-12 11:38:43,852 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 542 flow [2024-05-12 11:38:43,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:43,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:43,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:43,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:38:43,853 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:43,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash 657792161, now seen corresponding path program 2 times [2024-05-12 11:38:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865592092] [2024-05-12 11:38:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:52,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865592092] [2024-05-12 11:38:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865592092] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689789519] [2024-05-12 11:38:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:52,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:52,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:38:52,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:52,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:52,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:38:52,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:52,743 INFO L124 PetriNetUnfolderBase]: 742/1416 cut-off events. [2024-05-12 11:38:52,744 INFO L125 PetriNetUnfolderBase]: For 6873/6879 co-relation queries the response was YES. [2024-05-12 11:38:52,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 1416 events. 742/1416 cut-off events. For 6873/6879 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7973 event pairs, 217 based on Foata normal form. 7/1380 useless extension candidates. Maximal degree in co-relation 5011. Up to 1181 conditions per place. [2024-05-12 11:38:52,755 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 75 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2024-05-12 11:38:52,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 101 transitions, 776 flow [2024-05-12 11:38:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-05-12 11:38:52,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-05-12 11:38:52,757 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 542 flow. Second operand 7 states and 125 transitions. [2024-05-12 11:38:52,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 101 transitions, 776 flow [2024-05-12 11:38:52,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 101 transitions, 763 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 11:38:52,765 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 580 flow [2024-05-12 11:38:52,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=580, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2024-05-12 11:38:52,766 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2024-05-12 11:38:52,766 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 580 flow [2024-05-12 11:38:52,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:38:52,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:52,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:52,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:38:52,775 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:52,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1373171659, now seen corresponding path program 3 times [2024-05-12 11:38:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:52,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87470797] [2024-05-12 11:38:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87470797] [2024-05-12 11:39:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87470797] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:00,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:39:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062561770] [2024-05-12 11:39:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:00,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:39:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:39:00,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:39:00,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:39:00,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 580 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:39:00,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:00,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:39:00,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:01,380 INFO L124 PetriNetUnfolderBase]: 740/1412 cut-off events. [2024-05-12 11:39:01,381 INFO L125 PetriNetUnfolderBase]: For 7580/7586 co-relation queries the response was YES. [2024-05-12 11:39:01,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 1412 events. 740/1412 cut-off events. For 7580/7586 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7932 event pairs, 213 based on Foata normal form. 7/1376 useless extension candidates. Maximal degree in co-relation 5069. Up to 1158 conditions per place. [2024-05-12 11:39:01,388 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 74 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2024-05-12 11:39:01,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 103 transitions, 812 flow [2024-05-12 11:39:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:39:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:39:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-05-12 11:39:01,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-05-12 11:39:01,390 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 580 flow. Second operand 7 states and 128 transitions. [2024-05-12 11:39:01,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 103 transitions, 812 flow [2024-05-12 11:39:01,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 771 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:39:01,397 INFO L231 Difference]: Finished difference. Result has 96 places, 84 transitions, 576 flow [2024-05-12 11:39:01,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=96, PETRI_TRANSITIONS=84} [2024-05-12 11:39:01,398 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2024-05-12 11:39:01,398 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 84 transitions, 576 flow [2024-05-12 11:39:01,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:39:01,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:01,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:01,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:39:01,399 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:01,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash -349334817, now seen corresponding path program 3 times [2024-05-12 11:39:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:01,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507907377] [2024-05-12 11:39:01,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:08,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507907377] [2024-05-12 11:39:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507907377] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:08,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:08,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:39:08,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214823346] [2024-05-12 11:39:08,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:08,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:39:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:08,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:39:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:39:08,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:39:08,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 84 transitions, 576 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:39:08,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:08,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:39:08,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:09,490 INFO L124 PetriNetUnfolderBase]: 729/1386 cut-off events. [2024-05-12 11:39:09,491 INFO L125 PetriNetUnfolderBase]: For 8418/8418 co-relation queries the response was YES. [2024-05-12 11:39:09,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5144 conditions, 1386 events. 729/1386 cut-off events. For 8418/8418 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7746 event pairs, 201 based on Foata normal form. 1/1348 useless extension candidates. Maximal degree in co-relation 5101. Up to 1143 conditions per place. [2024-05-12 11:39:09,498 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 78 selfloop transitions, 12 changer transitions 0/103 dead transitions. [2024-05-12 11:39:09,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 808 flow [2024-05-12 11:39:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:39:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:39:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-05-12 11:39:09,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 11:39:09,522 INFO L175 Difference]: Start difference. First operand has 96 places, 84 transitions, 576 flow. Second operand 7 states and 126 transitions. [2024-05-12 11:39:09,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 808 flow [2024-05-12 11:39:09,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 103 transitions, 757 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 11:39:09,531 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 554 flow [2024-05-12 11:39:09,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=97, PETRI_TRANSITIONS=84} [2024-05-12 11:39:09,532 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2024-05-12 11:39:09,532 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 554 flow [2024-05-12 11:39:09,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-05-12 11:39:09,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:09,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:09,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:39:09,532 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:09,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:09,533 INFO L85 PathProgramCache]: Analyzing trace with hash -5154187, now seen corresponding path program 1 times [2024-05-12 11:39:09,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:09,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023569790] [2024-05-12 11:39:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023569790] [2024-05-12 11:39:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023569790] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:17,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523080644] [2024-05-12 11:39:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:17,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:17,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:39:17,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 554 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:17,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:17,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:39:17,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:18,355 INFO L124 PetriNetUnfolderBase]: 732/1343 cut-off events. [2024-05-12 11:39:18,355 INFO L125 PetriNetUnfolderBase]: For 9043/9043 co-relation queries the response was YES. [2024-05-12 11:39:18,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5146 conditions, 1343 events. 732/1343 cut-off events. For 9043/9043 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7242 event pairs, 142 based on Foata normal form. 1/1315 useless extension candidates. Maximal degree in co-relation 5102. Up to 1029 conditions per place. [2024-05-12 11:39:18,362 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 87 selfloop transitions, 25 changer transitions 0/125 dead transitions. [2024-05-12 11:39:18,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 125 transitions, 946 flow [2024-05-12 11:39:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-05-12 11:39:18,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-05-12 11:39:18,370 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 554 flow. Second operand 8 states and 158 transitions. [2024-05-12 11:39:18,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 125 transitions, 946 flow [2024-05-12 11:39:18,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 125 transitions, 904 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 11:39:18,378 INFO L231 Difference]: Finished difference. Result has 99 places, 89 transitions, 611 flow [2024-05-12 11:39:18,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=99, PETRI_TRANSITIONS=89} [2024-05-12 11:39:18,379 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2024-05-12 11:39:18,379 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 89 transitions, 611 flow [2024-05-12 11:39:18,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:18,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:18,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:18,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:39:18,380 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:18,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash -5004240, now seen corresponding path program 1 times [2024-05-12 11:39:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:18,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080711241] [2024-05-12 11:39:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080711241] [2024-05-12 11:39:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080711241] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:26,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:26,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987088898] [2024-05-12 11:39:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:26,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:26,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:26,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:26,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:26,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:39:26,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 89 transitions, 611 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:26,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:26,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:39:26,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:27,189 INFO L124 PetriNetUnfolderBase]: 815/1442 cut-off events. [2024-05-12 11:39:27,189 INFO L125 PetriNetUnfolderBase]: For 10101/10101 co-relation queries the response was YES. [2024-05-12 11:39:27,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5734 conditions, 1442 events. 815/1442 cut-off events. For 10101/10101 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7629 event pairs, 163 based on Foata normal form. 1/1412 useless extension candidates. Maximal degree in co-relation 5688. Up to 1148 conditions per place. [2024-05-12 11:39:27,223 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 91 selfloop transitions, 28 changer transitions 0/126 dead transitions. [2024-05-12 11:39:27,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 126 transitions, 1009 flow [2024-05-12 11:39:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-05-12 11:39:27,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-05-12 11:39:27,225 INFO L175 Difference]: Start difference. First operand has 99 places, 89 transitions, 611 flow. Second operand 8 states and 150 transitions. [2024-05-12 11:39:27,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 126 transitions, 1009 flow [2024-05-12 11:39:27,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 126 transitions, 972 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:39:27,236 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 667 flow [2024-05-12 11:39:27,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=667, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2024-05-12 11:39:27,236 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places. [2024-05-12 11:39:27,237 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 667 flow [2024-05-12 11:39:27,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:27,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:27,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:27,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:39:27,237 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:27,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -5004457, now seen corresponding path program 2 times [2024-05-12 11:39:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:27,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609650679] [2024-05-12 11:39:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609650679] [2024-05-12 11:39:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609650679] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471363619] [2024-05-12 11:39:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:35,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:35,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:39:35,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 667 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:35,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:35,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:39:35,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:36,426 INFO L124 PetriNetUnfolderBase]: 762/1390 cut-off events. [2024-05-12 11:39:36,426 INFO L125 PetriNetUnfolderBase]: For 11275/11275 co-relation queries the response was YES. [2024-05-12 11:39:36,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 1390 events. 762/1390 cut-off events. For 11275/11275 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7535 event pairs, 142 based on Foata normal form. 1/1361 useless extension candidates. Maximal degree in co-relation 5706. Up to 1061 conditions per place. [2024-05-12 11:39:36,436 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 88 selfloop transitions, 25 changer transitions 0/128 dead transitions. [2024-05-12 11:39:36,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 128 transitions, 1041 flow [2024-05-12 11:39:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-05-12 11:39:36,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-05-12 11:39:36,438 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 667 flow. Second operand 8 states and 156 transitions. [2024-05-12 11:39:36,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 128 transitions, 1041 flow [2024-05-12 11:39:36,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 128 transitions, 1004 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:39:36,450 INFO L231 Difference]: Finished difference. Result has 107 places, 95 transitions, 699 flow [2024-05-12 11:39:36,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=699, PETRI_PLACES=107, PETRI_TRANSITIONS=95} [2024-05-12 11:39:36,450 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places. [2024-05-12 11:39:36,451 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 699 flow [2024-05-12 11:39:36,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:36,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:36,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:36,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:39:36,451 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:36,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash 908874695, now seen corresponding path program 3 times [2024-05-12 11:39:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:36,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423203692] [2024-05-12 11:39:36,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:44,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423203692] [2024-05-12 11:39:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423203692] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:44,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347394583] [2024-05-12 11:39:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:44,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:44,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:44,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:44,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:44,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:39:44,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 699 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:44,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:44,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:39:44,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:45,572 INFO L124 PetriNetUnfolderBase]: 773/1419 cut-off events. [2024-05-12 11:39:45,573 INFO L125 PetriNetUnfolderBase]: For 12406/12406 co-relation queries the response was YES. [2024-05-12 11:39:45,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 1419 events. 773/1419 cut-off events. For 12406/12406 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7757 event pairs, 149 based on Foata normal form. 1/1387 useless extension candidates. Maximal degree in co-relation 5941. Up to 1073 conditions per place. [2024-05-12 11:39:45,581 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 86 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-05-12 11:39:45,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 127 transitions, 1069 flow [2024-05-12 11:39:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-05-12 11:39:45,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-05-12 11:39:45,582 INFO L175 Difference]: Start difference. First operand has 107 places, 95 transitions, 699 flow. Second operand 8 states and 154 transitions. [2024-05-12 11:39:45,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 127 transitions, 1069 flow [2024-05-12 11:39:45,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 127 transitions, 1026 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 11:39:45,596 INFO L231 Difference]: Finished difference. Result has 110 places, 97 transitions, 731 flow [2024-05-12 11:39:45,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=110, PETRI_TRANSITIONS=97} [2024-05-12 11:39:45,596 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2024-05-12 11:39:45,596 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 97 transitions, 731 flow [2024-05-12 11:39:45,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:45,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:45,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:45,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:39:45,597 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:45,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash -642640902, now seen corresponding path program 2 times [2024-05-12 11:39:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528580370] [2024-05-12 11:39:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528580370] [2024-05-12 11:39:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528580370] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:52,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:52,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:39:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522134402] [2024-05-12 11:39:52,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:52,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:39:52,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:52,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:39:52,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:39:52,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:39:52,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 97 transitions, 731 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-05-12 11:39:52,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:52,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:39:52,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:53,092 INFO L124 PetriNetUnfolderBase]: 727/1316 cut-off events. [2024-05-12 11:39:53,093 INFO L125 PetriNetUnfolderBase]: For 13455/13455 co-relation queries the response was YES. [2024-05-12 11:39:53,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5761 conditions, 1316 events. 727/1316 cut-off events. For 13455/13455 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7219 event pairs, 160 based on Foata normal form. 1/1282 useless extension candidates. Maximal degree in co-relation 5710. Up to 1034 conditions per place. [2024-05-12 11:39:53,101 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 90 selfloop transitions, 29 changer transitions 0/127 dead transitions. [2024-05-12 11:39:53,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 127 transitions, 1165 flow [2024-05-12 11:39:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:39:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:39:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-05-12 11:39:53,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-05-12 11:39:53,102 INFO L175 Difference]: Start difference. First operand has 110 places, 97 transitions, 731 flow. Second operand 7 states and 141 transitions. [2024-05-12 11:39:53,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 127 transitions, 1165 flow [2024-05-12 11:39:53,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 1122 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 11:39:53,116 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 783 flow [2024-05-12 11:39:53,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=783, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2024-05-12 11:39:53,116 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 68 predicate places. [2024-05-12 11:39:53,116 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 783 flow [2024-05-12 11:39:53,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-05-12 11:39:53,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:53,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:53,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:39:53,117 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:53,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -642648342, now seen corresponding path program 3 times [2024-05-12 11:39:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286206967] [2024-05-12 11:39:53,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:01,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286206967] [2024-05-12 11:40:01,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286206967] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:01,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:01,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859820660] [2024-05-12 11:40:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:01,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:01,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:40:01,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 101 transitions, 783 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:01,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:01,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:40:01,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:02,237 INFO L124 PetriNetUnfolderBase]: 859/1520 cut-off events. [2024-05-12 11:40:02,237 INFO L125 PetriNetUnfolderBase]: For 14662/14662 co-relation queries the response was YES. [2024-05-12 11:40:02,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 1520 events. 859/1520 cut-off events. For 14662/14662 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8164 event pairs, 165 based on Foata normal form. 1/1487 useless extension candidates. Maximal degree in co-relation 6497. Up to 1206 conditions per place. [2024-05-12 11:40:02,245 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 95 selfloop transitions, 29 changer transitions 0/131 dead transitions. [2024-05-12 11:40:02,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 131 transitions, 1163 flow [2024-05-12 11:40:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 11:40:02,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-05-12 11:40:02,247 INFO L175 Difference]: Start difference. First operand has 112 places, 101 transitions, 783 flow. Second operand 8 states and 149 transitions. [2024-05-12 11:40:02,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 131 transitions, 1163 flow [2024-05-12 11:40:02,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 131 transitions, 1112 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 11:40:02,260 INFO L231 Difference]: Finished difference. Result has 117 places, 101 transitions, 795 flow [2024-05-12 11:40:02,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=795, PETRI_PLACES=117, PETRI_TRANSITIONS=101} [2024-05-12 11:40:02,261 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 73 predicate places. [2024-05-12 11:40:02,261 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 101 transitions, 795 flow [2024-05-12 11:40:02,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:02,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:02,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:02,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:40:02,262 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:02,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -642640623, now seen corresponding path program 1 times [2024-05-12 11:40:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047372350] [2024-05-12 11:40:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:02,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047372350] [2024-05-12 11:40:10,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047372350] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:10,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891406813] [2024-05-12 11:40:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:10,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:10,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:11,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:40:11,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 101 transitions, 795 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:11,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:11,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:40:11,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:11,684 INFO L124 PetriNetUnfolderBase]: 865/1552 cut-off events. [2024-05-12 11:40:11,684 INFO L125 PetriNetUnfolderBase]: For 16963/16967 co-relation queries the response was YES. [2024-05-12 11:40:11,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6654 conditions, 1552 events. 865/1552 cut-off events. For 16963/16967 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8515 event pairs, 176 based on Foata normal form. 7/1526 useless extension candidates. Maximal degree in co-relation 6601. Up to 1203 conditions per place. [2024-05-12 11:40:11,693 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 101 selfloop transitions, 24 changer transitions 0/142 dead transitions. [2024-05-12 11:40:11,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 142 transitions, 1229 flow [2024-05-12 11:40:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-05-12 11:40:11,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-05-12 11:40:11,697 INFO L175 Difference]: Start difference. First operand has 117 places, 101 transitions, 795 flow. Second operand 8 states and 158 transitions. [2024-05-12 11:40:11,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 142 transitions, 1229 flow [2024-05-12 11:40:11,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 142 transitions, 1165 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 11:40:11,714 INFO L231 Difference]: Finished difference. Result has 119 places, 108 transitions, 846 flow [2024-05-12 11:40:11,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=846, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2024-05-12 11:40:11,715 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places. [2024-05-12 11:40:11,715 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 846 flow [2024-05-12 11:40:11,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:11,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:11,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:11,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:40:11,716 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:11,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1201989979, now seen corresponding path program 2 times [2024-05-12 11:40:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643161185] [2024-05-12 11:40:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:19,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643161185] [2024-05-12 11:40:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643161185] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:19,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:19,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199167102] [2024-05-12 11:40:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:19,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:19,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:40:19,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 846 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:19,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:19,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:40:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:20,447 INFO L124 PetriNetUnfolderBase]: 932/1696 cut-off events. [2024-05-12 11:40:20,448 INFO L125 PetriNetUnfolderBase]: For 20215/20223 co-relation queries the response was YES. [2024-05-12 11:40:20,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7520 conditions, 1696 events. 932/1696 cut-off events. For 20215/20223 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9645 event pairs, 243 based on Foata normal form. 11/1667 useless extension candidates. Maximal degree in co-relation 7465. Up to 1383 conditions per place. [2024-05-12 11:40:20,457 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 103 selfloop transitions, 19 changer transitions 0/139 dead transitions. [2024-05-12 11:40:20,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 139 transitions, 1250 flow [2024-05-12 11:40:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 11:40:20,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-05-12 11:40:20,458 INFO L175 Difference]: Start difference. First operand has 119 places, 108 transitions, 846 flow. Second operand 8 states and 149 transitions. [2024-05-12 11:40:20,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 139 transitions, 1250 flow [2024-05-12 11:40:20,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 139 transitions, 1232 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 11:40:20,473 INFO L231 Difference]: Finished difference. Result has 124 places, 112 transitions, 911 flow [2024-05-12 11:40:20,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=911, PETRI_PLACES=124, PETRI_TRANSITIONS=112} [2024-05-12 11:40:20,473 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2024-05-12 11:40:20,474 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 112 transitions, 911 flow [2024-05-12 11:40:20,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:20,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:20,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:20,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:40:20,474 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:20,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash -370904843, now seen corresponding path program 3 times [2024-05-12 11:40:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:20,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530010314] [2024-05-12 11:40:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530010314] [2024-05-12 11:40:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530010314] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557341600] [2024-05-12 11:40:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:28,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:28,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:28,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:40:28,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 112 transitions, 911 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:28,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:28,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:40:28,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:29,662 INFO L124 PetriNetUnfolderBase]: 926/1682 cut-off events. [2024-05-12 11:40:29,662 INFO L125 PetriNetUnfolderBase]: For 20802/20810 co-relation queries the response was YES. [2024-05-12 11:40:29,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 1682 events. 926/1682 cut-off events. For 20802/20810 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9547 event pairs, 247 based on Foata normal form. 11/1655 useless extension candidates. Maximal degree in co-relation 7459. Up to 1421 conditions per place. [2024-05-12 11:40:29,672 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 101 selfloop transitions, 16 changer transitions 0/134 dead transitions. [2024-05-12 11:40:29,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 1201 flow [2024-05-12 11:40:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-05-12 11:40:29,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446875 [2024-05-12 11:40:29,674 INFO L175 Difference]: Start difference. First operand has 124 places, 112 transitions, 911 flow. Second operand 8 states and 143 transitions. [2024-05-12 11:40:29,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 1201 flow [2024-05-12 11:40:29,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 134 transitions, 1159 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 11:40:29,692 INFO L231 Difference]: Finished difference. Result has 128 places, 112 transitions, 906 flow [2024-05-12 11:40:29,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=906, PETRI_PLACES=128, PETRI_TRANSITIONS=112} [2024-05-12 11:40:29,693 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2024-05-12 11:40:29,693 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 112 transitions, 906 flow [2024-05-12 11:40:29,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:29,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:29,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:29,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:40:29,694 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:29,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash -371260382, now seen corresponding path program 4 times [2024-05-12 11:40:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180310328] [2024-05-12 11:40:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:29,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180310328] [2024-05-12 11:40:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180310328] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330929106] [2024-05-12 11:40:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:36,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:36,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:40:36,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 112 transitions, 906 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:36,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:36,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:40:36,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:37,100 INFO L124 PetriNetUnfolderBase]: 998/1776 cut-off events. [2024-05-12 11:40:37,100 INFO L125 PetriNetUnfolderBase]: For 21314/21314 co-relation queries the response was YES. [2024-05-12 11:40:37,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7972 conditions, 1776 events. 998/1776 cut-off events. For 21314/21314 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9989 event pairs, 255 based on Foata normal form. 1/1737 useless extension candidates. Maximal degree in co-relation 7913. Up to 1574 conditions per place. [2024-05-12 11:40:37,111 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 114 selfloop transitions, 15 changer transitions 0/136 dead transitions. [2024-05-12 11:40:37,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 136 transitions, 1244 flow [2024-05-12 11:40:37,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 11:40:37,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-05-12 11:40:37,125 INFO L175 Difference]: Start difference. First operand has 128 places, 112 transitions, 906 flow. Second operand 8 states and 135 transitions. [2024-05-12 11:40:37,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 136 transitions, 1244 flow [2024-05-12 11:40:37,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 1203 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 11:40:37,146 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 922 flow [2024-05-12 11:40:37,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=922, PETRI_PLACES=129, PETRI_TRANSITIONS=114} [2024-05-12 11:40:37,147 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places. [2024-05-12 11:40:37,147 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 922 flow [2024-05-12 11:40:37,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:37,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:37,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:37,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:40:37,148 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:37,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash -381358322, now seen corresponding path program 5 times [2024-05-12 11:40:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452998573] [2024-05-12 11:40:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:37,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452998573] [2024-05-12 11:40:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452998573] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818144760] [2024-05-12 11:40:45,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:45,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:45,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:40:45,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 114 transitions, 922 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:45,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:45,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:40:45,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:46,020 INFO L124 PetriNetUnfolderBase]: 1009/1794 cut-off events. [2024-05-12 11:40:46,021 INFO L125 PetriNetUnfolderBase]: For 22712/22712 co-relation queries the response was YES. [2024-05-12 11:40:46,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8104 conditions, 1794 events. 1009/1794 cut-off events. For 22712/22712 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10069 event pairs, 247 based on Foata normal form. 1/1754 useless extension candidates. Maximal degree in co-relation 8044. Up to 1537 conditions per place. [2024-05-12 11:40:46,035 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 111 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2024-05-12 11:40:46,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 141 transitions, 1342 flow [2024-05-12 11:40:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-05-12 11:40:46,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-05-12 11:40:46,036 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 922 flow. Second operand 8 states and 140 transitions. [2024-05-12 11:40:46,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 141 transitions, 1342 flow [2024-05-12 11:40:46,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 141 transitions, 1307 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:40:46,069 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 960 flow [2024-05-12 11:40:46,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=960, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2024-05-12 11:40:46,071 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places. [2024-05-12 11:40:46,071 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 960 flow [2024-05-12 11:40:46,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:46,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:46,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:46,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:40:46,072 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:46,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2055523241, now seen corresponding path program 4 times [2024-05-12 11:40:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008707014] [2024-05-12 11:40:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:54,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008707014] [2024-05-12 11:40:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008707014] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:54,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:54,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457857668] [2024-05-12 11:40:54,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:54,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:54,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:54,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:54,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:40:54,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 960 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:54,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:54,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:40:54,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:55,059 INFO L124 PetriNetUnfolderBase]: 930/1731 cut-off events. [2024-05-12 11:40:55,060 INFO L125 PetriNetUnfolderBase]: For 23856/23858 co-relation queries the response was YES. [2024-05-12 11:40:55,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 1731 events. 930/1731 cut-off events. For 23856/23858 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10111 event pairs, 231 based on Foata normal form. 1/1685 useless extension candidates. Maximal degree in co-relation 7757. Up to 1422 conditions per place. [2024-05-12 11:40:55,070 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 107 selfloop transitions, 14 changer transitions 0/140 dead transitions. [2024-05-12 11:40:55,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 140 transitions, 1276 flow [2024-05-12 11:40:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-05-12 11:40:55,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446875 [2024-05-12 11:40:55,072 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 960 flow. Second operand 8 states and 143 transitions. [2024-05-12 11:40:55,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 140 transitions, 1276 flow [2024-05-12 11:40:55,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 140 transitions, 1191 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-05-12 11:40:55,098 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 908 flow [2024-05-12 11:40:55,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=908, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2024-05-12 11:40:55,098 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places. [2024-05-12 11:40:55,098 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 908 flow [2024-05-12 11:40:55,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:55,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:55,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:55,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:40:55,099 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:55,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash -381350882, now seen corresponding path program 6 times [2024-05-12 11:40:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:55,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638229142] [2024-05-12 11:40:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:03,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-05-12 11:41:03,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638229142] [2024-05-12 11:41:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638229142] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:03,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:41:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362772299] [2024-05-12 11:41:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:03,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:41:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:41:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:41:03,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:41:03,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 908 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:03,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:03,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:41:03,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:04,205 INFO L124 PetriNetUnfolderBase]: 1005/1789 cut-off events. [2024-05-12 11:41:04,205 INFO L125 PetriNetUnfolderBase]: For 24379/24379 co-relation queries the response was YES. [2024-05-12 11:41:04,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 1789 events. 1005/1789 cut-off events. For 24379/24379 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10086 event pairs, 249 based on Foata normal form. 1/1749 useless extension candidates. Maximal degree in co-relation 7992. Up to 1532 conditions per place. [2024-05-12 11:41:04,216 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 111 selfloop transitions, 22 changer transitions 0/140 dead transitions. [2024-05-12 11:41:04,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 140 transitions, 1248 flow [2024-05-12 11:41:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:41:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:41:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-05-12 11:41:04,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-05-12 11:41:04,217 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 908 flow. Second operand 8 states and 140 transitions. [2024-05-12 11:41:04,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 140 transitions, 1248 flow [2024-05-12 11:41:04,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 140 transitions, 1217 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 11:41:04,241 INFO L231 Difference]: Finished difference. Result has 134 places, 116 transitions, 926 flow [2024-05-12 11:41:04,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=926, PETRI_PLACES=134, PETRI_TRANSITIONS=116} [2024-05-12 11:41:04,242 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2024-05-12 11:41:04,242 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 116 transitions, 926 flow [2024-05-12 11:41:04,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:04,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:04,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:04,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:41:04,243 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:04,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2055531177, now seen corresponding path program 4 times [2024-05-12 11:41:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060537586] [2024-05-12 11:41:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060537586] [2024-05-12 11:41:12,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060537586] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:12,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:12,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:41:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461589229] [2024-05-12 11:41:12,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:12,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:41:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:12,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:41:12,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:41:12,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:41:12,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 116 transitions, 926 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:12,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:12,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:41:12,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:13,097 INFO L124 PetriNetUnfolderBase]: 934/1708 cut-off events. [2024-05-12 11:41:13,097 INFO L125 PetriNetUnfolderBase]: For 25025/25031 co-relation queries the response was YES. [2024-05-12 11:41:13,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 1708 events. 934/1708 cut-off events. For 25025/25031 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9800 event pairs, 235 based on Foata normal form. 9/1676 useless extension candidates. Maximal degree in co-relation 7540. Up to 1334 conditions per place. [2024-05-12 11:41:13,108 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 102 selfloop transitions, 23 changer transitions 0/144 dead transitions. [2024-05-12 11:41:13,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 144 transitions, 1262 flow [2024-05-12 11:41:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:41:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:41:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-05-12 11:41:13,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471875 [2024-05-12 11:41:13,110 INFO L175 Difference]: Start difference. First operand has 134 places, 116 transitions, 926 flow. Second operand 8 states and 151 transitions. [2024-05-12 11:41:13,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 144 transitions, 1262 flow [2024-05-12 11:41:13,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 144 transitions, 1204 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 11:41:13,135 INFO L231 Difference]: Finished difference. Result has 135 places, 116 transitions, 919 flow [2024-05-12 11:41:13,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=919, PETRI_PLACES=135, PETRI_TRANSITIONS=116} [2024-05-12 11:41:13,136 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2024-05-12 11:41:13,136 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 116 transitions, 919 flow [2024-05-12 11:41:13,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:13,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:13,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:13,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:41:13,137 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:13,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash -159783736, now seen corresponding path program 1 times [2024-05-12 11:41:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:13,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78788980] [2024-05-12 11:41:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:22,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78788980] [2024-05-12 11:41:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78788980] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:22,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:22,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:41:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011025665] [2024-05-12 11:41:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:22,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:41:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:41:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:41:22,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:41:22,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 116 transitions, 919 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:22,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:22,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:41:22,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:23,130 INFO L124 PetriNetUnfolderBase]: 932/1738 cut-off events. [2024-05-12 11:41:23,130 INFO L125 PetriNetUnfolderBase]: For 26033/26033 co-relation queries the response was YES. [2024-05-12 11:41:23,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 1738 events. 932/1738 cut-off events. For 26033/26033 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10169 event pairs, 173 based on Foata normal form. 1/1686 useless extension candidates. Maximal degree in co-relation 7767. Up to 1385 conditions per place. [2024-05-12 11:41:23,141 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 127 selfloop transitions, 15 changer transitions 0/161 dead transitions. [2024-05-12 11:41:23,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 161 transitions, 1355 flow [2024-05-12 11:41:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:41:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:41:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-05-12 11:41:23,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-05-12 11:41:23,143 INFO L175 Difference]: Start difference. First operand has 135 places, 116 transitions, 919 flow. Second operand 9 states and 173 transitions. [2024-05-12 11:41:23,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 161 transitions, 1355 flow [2024-05-12 11:41:23,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 161 transitions, 1272 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 11:41:23,170 INFO L231 Difference]: Finished difference. Result has 136 places, 118 transitions, 891 flow [2024-05-12 11:41:23,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=891, PETRI_PLACES=136, PETRI_TRANSITIONS=118} [2024-05-12 11:41:23,171 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 92 predicate places. [2024-05-12 11:41:23,171 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 118 transitions, 891 flow [2024-05-12 11:41:23,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:23,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:23,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:23,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:41:23,171 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:23,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1375600342, now seen corresponding path program 2 times [2024-05-12 11:41:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:23,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424452190] [2024-05-12 11:41:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:23,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424452190] [2024-05-12 11:41:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424452190] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:31,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:41:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589224714] [2024-05-12 11:41:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:31,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:41:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:41:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:41:31,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:41:31,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 118 transitions, 891 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:31,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:31,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:41:31,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:32,214 INFO L124 PetriNetUnfolderBase]: 946/1741 cut-off events. [2024-05-12 11:41:32,214 INFO L125 PetriNetUnfolderBase]: For 26914/26914 co-relation queries the response was YES. [2024-05-12 11:41:32,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 1741 events. 946/1741 cut-off events. For 26914/26914 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10110 event pairs, 160 based on Foata normal form. 1/1694 useless extension candidates. Maximal degree in co-relation 7769. Up to 1266 conditions per place. [2024-05-12 11:41:32,226 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 33 changer transitions 0/163 dead transitions. [2024-05-12 11:41:32,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 163 transitions, 1413 flow [2024-05-12 11:41:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:41:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:41:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-05-12 11:41:32,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-05-12 11:41:32,228 INFO L175 Difference]: Start difference. First operand has 136 places, 118 transitions, 891 flow. Second operand 9 states and 177 transitions. [2024-05-12 11:41:32,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 163 transitions, 1413 flow [2024-05-12 11:41:32,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 163 transitions, 1342 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-05-12 11:41:32,257 INFO L231 Difference]: Finished difference. Result has 136 places, 122 transitions, 935 flow [2024-05-12 11:41:32,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=935, PETRI_PLACES=136, PETRI_TRANSITIONS=122} [2024-05-12 11:41:32,258 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 92 predicate places. [2024-05-12 11:41:32,258 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 122 transitions, 935 flow [2024-05-12 11:41:32,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:32,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:32,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:32,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:41:32,259 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:32,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1375600528, now seen corresponding path program 1 times [2024-05-12 11:41:32,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:32,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096488829] [2024-05-12 11:41:32,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096488829] [2024-05-12 11:41:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096488829] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:40,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:40,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:41:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218242943] [2024-05-12 11:41:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:40,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:41:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:41:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:41:40,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:41:40,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 122 transitions, 935 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:40,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:40,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:41:40,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:41,481 INFO L124 PetriNetUnfolderBase]: 1038/1859 cut-off events. [2024-05-12 11:41:41,482 INFO L125 PetriNetUnfolderBase]: For 28649/28649 co-relation queries the response was YES. [2024-05-12 11:41:41,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8435 conditions, 1859 events. 1038/1859 cut-off events. For 28649/28649 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10638 event pairs, 178 based on Foata normal form. 1/1807 useless extension candidates. Maximal degree in co-relation 8370. Up to 1343 conditions per place. [2024-05-12 11:41:41,493 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 115 selfloop transitions, 45 changer transitions 0/167 dead transitions. [2024-05-12 11:41:41,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 167 transitions, 1479 flow [2024-05-12 11:41:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:41:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:41:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-05-12 11:41:41,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 11:41:41,494 INFO L175 Difference]: Start difference. First operand has 136 places, 122 transitions, 935 flow. Second operand 9 states and 171 transitions. [2024-05-12 11:41:41,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 167 transitions, 1479 flow [2024-05-12 11:41:41,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 167 transitions, 1428 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 11:41:41,525 INFO L231 Difference]: Finished difference. Result has 140 places, 126 transitions, 1011 flow [2024-05-12 11:41:41,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1011, PETRI_PLACES=140, PETRI_TRANSITIONS=126} [2024-05-12 11:41:41,526 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 96 predicate places. [2024-05-12 11:41:41,526 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 126 transitions, 1011 flow [2024-05-12 11:41:41,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:41,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:41,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:41,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:41:41,526 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:41,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1380248916, now seen corresponding path program 1 times [2024-05-12 11:41:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796505831] [2024-05-12 11:41:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796505831] [2024-05-12 11:41:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796505831] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:41:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151275715] [2024-05-12 11:41:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:41:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:41:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:41:49,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:41:49,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 126 transitions, 1011 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:49,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:49,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:41:49,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:50,496 INFO L124 PetriNetUnfolderBase]: 1100/1919 cut-off events. [2024-05-12 11:41:50,496 INFO L125 PetriNetUnfolderBase]: For 32888/32888 co-relation queries the response was YES. [2024-05-12 11:41:50,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9124 conditions, 1919 events. 1100/1919 cut-off events. For 32888/32888 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10738 event pairs, 204 based on Foata normal form. 3/1882 useless extension candidates. Maximal degree in co-relation 9057. Up to 1267 conditions per place. [2024-05-12 11:41:50,509 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 125 selfloop transitions, 42 changer transitions 0/174 dead transitions. [2024-05-12 11:41:50,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 174 transitions, 1585 flow [2024-05-12 11:41:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:41:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:41:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-05-12 11:41:50,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 11:41:50,511 INFO L175 Difference]: Start difference. First operand has 140 places, 126 transitions, 1011 flow. Second operand 9 states and 175 transitions. [2024-05-12 11:41:50,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 174 transitions, 1585 flow [2024-05-12 11:41:50,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 174 transitions, 1524 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:41:50,548 INFO L231 Difference]: Finished difference. Result has 144 places, 130 transitions, 1075 flow [2024-05-12 11:41:50,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1075, PETRI_PLACES=144, PETRI_TRANSITIONS=130} [2024-05-12 11:41:50,549 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-05-12 11:41:50,549 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 130 transitions, 1075 flow [2024-05-12 11:41:50,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:50,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:50,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:50,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:41:50,550 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:50,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1380248668, now seen corresponding path program 2 times [2024-05-12 11:41:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840651929] [2024-05-12 11:41:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840651929] [2024-05-12 11:41:58,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840651929] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:58,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:58,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:41:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562775889] [2024-05-12 11:41:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:58,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:41:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:41:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:41:58,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:41:58,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 1075 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:58,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:58,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:41:58,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:58,664 INFO L124 PetriNetUnfolderBase]: 944/1703 cut-off events. [2024-05-12 11:41:58,664 INFO L125 PetriNetUnfolderBase]: For 33973/33973 co-relation queries the response was YES. [2024-05-12 11:41:58,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8577 conditions, 1703 events. 944/1703 cut-off events. For 33973/33973 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9930 event pairs, 181 based on Foata normal form. 1/1655 useless extension candidates. Maximal degree in co-relation 8508. Up to 1248 conditions per place. [2024-05-12 11:41:58,677 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 117 selfloop transitions, 42 changer transitions 0/167 dead transitions. [2024-05-12 11:41:58,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 167 transitions, 1673 flow [2024-05-12 11:41:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:41:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:41:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-05-12 11:41:58,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-05-12 11:41:58,678 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 1075 flow. Second operand 8 states and 162 transitions. [2024-05-12 11:41:58,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 167 transitions, 1673 flow [2024-05-12 11:41:58,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 167 transitions, 1623 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:41:58,721 INFO L231 Difference]: Finished difference. Result has 147 places, 134 transitions, 1142 flow [2024-05-12 11:41:58,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1142, PETRI_PLACES=147, PETRI_TRANSITIONS=134} [2024-05-12 11:41:58,721 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places. [2024-05-12 11:41:58,721 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 134 transitions, 1142 flow [2024-05-12 11:41:58,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:58,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:58,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:58,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:41:58,722 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:58,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:58,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1380241972, now seen corresponding path program 3 times [2024-05-12 11:41:58,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612061150] [2024-05-12 11:41:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:06,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:06,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612061150] [2024-05-12 11:42:06,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612061150] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:06,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:06,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:06,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433838416] [2024-05-12 11:42:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:06,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:06,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:07,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:42:07,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 134 transitions, 1142 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:07,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:07,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:42:07,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:07,981 INFO L124 PetriNetUnfolderBase]: 1061/1954 cut-off events. [2024-05-12 11:42:07,982 INFO L125 PetriNetUnfolderBase]: For 36015/36015 co-relation queries the response was YES. [2024-05-12 11:42:07,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9583 conditions, 1954 events. 1061/1954 cut-off events. For 36015/36015 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11644 event pairs, 195 based on Foata normal form. 1/1895 useless extension candidates. Maximal degree in co-relation 9513. Up to 1418 conditions per place. [2024-05-12 11:42:07,995 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 118 selfloop transitions, 33 changer transitions 0/174 dead transitions. [2024-05-12 11:42:07,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 174 transitions, 1658 flow [2024-05-12 11:42:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:42:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:42:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-05-12 11:42:07,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 11:42:07,997 INFO L175 Difference]: Start difference. First operand has 147 places, 134 transitions, 1142 flow. Second operand 9 states and 175 transitions. [2024-05-12 11:42:07,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 174 transitions, 1658 flow [2024-05-12 11:42:08,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 174 transitions, 1594 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 11:42:08,048 INFO L231 Difference]: Finished difference. Result has 152 places, 136 transitions, 1169 flow [2024-05-12 11:42:08,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1169, PETRI_PLACES=152, PETRI_TRANSITIONS=136} [2024-05-12 11:42:08,048 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 108 predicate places. [2024-05-12 11:42:08,049 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 136 transitions, 1169 flow [2024-05-12 11:42:08,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:08,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:08,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:08,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:42:08,050 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:08,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1380242158, now seen corresponding path program 3 times [2024-05-12 11:42:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652329352] [2024-05-12 11:42:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:16,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652329352] [2024-05-12 11:42:16,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652329352] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:16,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:16,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212461096] [2024-05-12 11:42:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:16,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:16,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:16,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:16,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:42:16,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 136 transitions, 1169 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:16,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:16,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:42:16,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:17,416 INFO L124 PetriNetUnfolderBase]: 1133/2032 cut-off events. [2024-05-12 11:42:17,416 INFO L125 PetriNetUnfolderBase]: For 37133/37133 co-relation queries the response was YES. [2024-05-12 11:42:17,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9968 conditions, 2032 events. 1133/2032 cut-off events. For 37133/37133 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11893 event pairs, 208 based on Foata normal form. 1/1972 useless extension candidates. Maximal degree in co-relation 9896. Up to 1480 conditions per place. [2024-05-12 11:42:17,430 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 125 selfloop transitions, 42 changer transitions 0/174 dead transitions. [2024-05-12 11:42:17,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 174 transitions, 1699 flow [2024-05-12 11:42:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:42:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:42:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-05-12 11:42:17,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 11:42:17,431 INFO L175 Difference]: Start difference. First operand has 152 places, 136 transitions, 1169 flow. Second operand 9 states and 170 transitions. [2024-05-12 11:42:17,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 174 transitions, 1699 flow [2024-05-12 11:42:17,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 174 transitions, 1635 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 11:42:17,478 INFO L231 Difference]: Finished difference. Result has 155 places, 136 transitions, 1194 flow [2024-05-12 11:42:17,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1194, PETRI_PLACES=155, PETRI_TRANSITIONS=136} [2024-05-12 11:42:17,479 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places. [2024-05-12 11:42:17,479 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 136 transitions, 1194 flow [2024-05-12 11:42:17,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:17,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:17,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:17,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:42:17,479 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:17,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1552977816, now seen corresponding path program 2 times [2024-05-12 11:42:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339432466] [2024-05-12 11:42:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:26,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339432466] [2024-05-12 11:42:26,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339432466] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:26,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:26,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610831288] [2024-05-12 11:42:26,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:26,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:26,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:26,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:26,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:42:26,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 136 transitions, 1194 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:26,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:26,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:42:26,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:27,379 INFO L124 PetriNetUnfolderBase]: 1205/2098 cut-off events. [2024-05-12 11:42:27,380 INFO L125 PetriNetUnfolderBase]: For 43343/43343 co-relation queries the response was YES. [2024-05-12 11:42:27,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10609 conditions, 2098 events. 1205/2098 cut-off events. For 43343/43343 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11953 event pairs, 214 based on Foata normal form. 3/2056 useless extension candidates. Maximal degree in co-relation 10536. Up to 1370 conditions per place. [2024-05-12 11:42:27,395 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 132 selfloop transitions, 43 changer transitions 0/182 dead transitions. [2024-05-12 11:42:27,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 182 transitions, 1866 flow [2024-05-12 11:42:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:42:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:42:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-05-12 11:42:27,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-05-12 11:42:27,397 INFO L175 Difference]: Start difference. First operand has 155 places, 136 transitions, 1194 flow. Second operand 9 states and 174 transitions. [2024-05-12 11:42:27,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 182 transitions, 1866 flow [2024-05-12 11:42:27,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 182 transitions, 1776 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 11:42:27,451 INFO L231 Difference]: Finished difference. Result has 156 places, 140 transitions, 1231 flow [2024-05-12 11:42:27,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1231, PETRI_PLACES=156, PETRI_TRANSITIONS=140} [2024-05-12 11:42:27,452 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places. [2024-05-12 11:42:27,452 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 140 transitions, 1231 flow [2024-05-12 11:42:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:27,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:27,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:27,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:42:27,453 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:27,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash 17359378, now seen corresponding path program 3 times [2024-05-12 11:42:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510657976] [2024-05-12 11:42:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:35,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510657976] [2024-05-12 11:42:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510657976] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:35,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939819504] [2024-05-12 11:42:35,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:35,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:35,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:42:35,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 140 transitions, 1231 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:35,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:35,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:42:35,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:36,694 INFO L124 PetriNetUnfolderBase]: 1238/2149 cut-off events. [2024-05-12 11:42:36,694 INFO L125 PetriNetUnfolderBase]: For 46017/46017 co-relation queries the response was YES. [2024-05-12 11:42:36,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10980 conditions, 2149 events. 1238/2149 cut-off events. For 46017/46017 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12262 event pairs, 214 based on Foata normal form. 3/2107 useless extension candidates. Maximal degree in co-relation 10906. Up to 1394 conditions per place. [2024-05-12 11:42:36,709 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 137 selfloop transitions, 42 changer transitions 0/186 dead transitions. [2024-05-12 11:42:36,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 186 transitions, 1907 flow [2024-05-12 11:42:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:42:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:42:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-05-12 11:42:36,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 11:42:36,711 INFO L175 Difference]: Start difference. First operand has 156 places, 140 transitions, 1231 flow. Second operand 9 states and 178 transitions. [2024-05-12 11:42:36,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 186 transitions, 1907 flow [2024-05-12 11:42:36,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 186 transitions, 1826 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 11:42:36,772 INFO L231 Difference]: Finished difference. Result has 160 places, 142 transitions, 1261 flow [2024-05-12 11:42:36,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1261, PETRI_PLACES=160, PETRI_TRANSITIONS=142} [2024-05-12 11:42:36,773 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 116 predicate places. [2024-05-12 11:42:36,773 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 142 transitions, 1261 flow [2024-05-12 11:42:36,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:36,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:36,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:36,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:42:36,774 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:36,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 17590018, now seen corresponding path program 4 times [2024-05-12 11:42:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084496403] [2024-05-12 11:42:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:45,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:45,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084496403] [2024-05-12 11:42:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084496403] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:45,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679947878] [2024-05-12 11:42:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:45,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:45,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:45,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:42:45,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 142 transitions, 1261 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:45,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:45,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:42:45,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:46,280 INFO L124 PetriNetUnfolderBase]: 1232/2140 cut-off events. [2024-05-12 11:42:46,281 INFO L125 PetriNetUnfolderBase]: For 45693/45693 co-relation queries the response was YES. [2024-05-12 11:42:46,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10752 conditions, 2140 events. 1232/2140 cut-off events. For 45693/45693 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12213 event pairs, 212 based on Foata normal form. 3/2098 useless extension candidates. Maximal degree in co-relation 10677. Up to 1390 conditions per place. [2024-05-12 11:42:46,293 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 135 selfloop transitions, 43 changer transitions 0/185 dead transitions. [2024-05-12 11:42:46,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 185 transitions, 1835 flow [2024-05-12 11:42:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:42:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:42:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-05-12 11:42:46,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 11:42:46,295 INFO L175 Difference]: Start difference. First operand has 160 places, 142 transitions, 1261 flow. Second operand 9 states and 176 transitions. [2024-05-12 11:42:46,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 185 transitions, 1835 flow [2024-05-12 11:42:46,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 185 transitions, 1756 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:42:46,359 INFO L231 Difference]: Finished difference. Result has 163 places, 142 transitions, 1273 flow [2024-05-12 11:42:46,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1273, PETRI_PLACES=163, PETRI_TRANSITIONS=142} [2024-05-12 11:42:46,359 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places. [2024-05-12 11:42:46,359 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 142 transitions, 1273 flow [2024-05-12 11:42:46,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:46,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:46,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:46,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:42:46,360 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:46,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 17589770, now seen corresponding path program 4 times [2024-05-12 11:42:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:46,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530477280] [2024-05-12 11:42:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530477280] [2024-05-12 11:42:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530477280] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272113810] [2024-05-12 11:42:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:54,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:54,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:42:54,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 142 transitions, 1273 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:54,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:54,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:42:54,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:55,143 INFO L124 PetriNetUnfolderBase]: 1256/2233 cut-off events. [2024-05-12 11:42:55,143 INFO L125 PetriNetUnfolderBase]: For 47021/47021 co-relation queries the response was YES. [2024-05-12 11:42:55,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11062 conditions, 2233 events. 1256/2233 cut-off events. For 47021/47021 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13129 event pairs, 220 based on Foata normal form. 1/2171 useless extension candidates. Maximal degree in co-relation 10986. Up to 1659 conditions per place. [2024-05-12 11:42:55,161 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 129 selfloop transitions, 46 changer transitions 0/182 dead transitions. [2024-05-12 11:42:55,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 182 transitions, 1935 flow [2024-05-12 11:42:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:42:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:42:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-05-12 11:42:55,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 11:42:55,163 INFO L175 Difference]: Start difference. First operand has 163 places, 142 transitions, 1273 flow. Second operand 9 states and 168 transitions. [2024-05-12 11:42:55,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 182 transitions, 1935 flow [2024-05-12 11:42:55,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 182 transitions, 1830 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 11:42:55,235 INFO L231 Difference]: Finished difference. Result has 163 places, 146 transitions, 1297 flow [2024-05-12 11:42:55,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1297, PETRI_PLACES=163, PETRI_TRANSITIONS=146} [2024-05-12 11:42:55,236 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places. [2024-05-12 11:42:55,236 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 146 transitions, 1297 flow [2024-05-12 11:42:55,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:55,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:55,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:55,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:42:55,237 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:55,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 17352434, now seen corresponding path program 4 times [2024-05-12 11:42:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124857108] [2024-05-12 11:42:55,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124857108] [2024-05-12 11:43:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124857108] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050177842] [2024-05-12 11:43:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:03,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:03,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:43:03,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 146 transitions, 1297 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:03,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:03,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:43:03,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:04,516 INFO L124 PetriNetUnfolderBase]: 1182/2164 cut-off events. [2024-05-12 11:43:04,516 INFO L125 PetriNetUnfolderBase]: For 48815/48815 co-relation queries the response was YES. [2024-05-12 11:43:04,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10683 conditions, 2164 events. 1182/2164 cut-off events. For 48815/48815 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13044 event pairs, 212 based on Foata normal form. 1/2101 useless extension candidates. Maximal degree in co-relation 10606. Up to 1595 conditions per place. [2024-05-12 11:43:04,532 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 124 selfloop transitions, 34 changer transitions 0/183 dead transitions. [2024-05-12 11:43:04,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 183 transitions, 1833 flow [2024-05-12 11:43:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:43:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:43:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-05-12 11:43:04,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-05-12 11:43:04,544 INFO L175 Difference]: Start difference. First operand has 163 places, 146 transitions, 1297 flow. Second operand 9 states and 173 transitions. [2024-05-12 11:43:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 183 transitions, 1833 flow [2024-05-12 11:43:04,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 183 transitions, 1767 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:04,611 INFO L231 Difference]: Finished difference. Result has 167 places, 148 transitions, 1326 flow [2024-05-12 11:43:04,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1326, PETRI_PLACES=167, PETRI_TRANSITIONS=148} [2024-05-12 11:43:04,612 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 123 predicate places. [2024-05-12 11:43:04,612 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 148 transitions, 1326 flow [2024-05-12 11:43:04,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:04,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:04,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:04,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:43:04,616 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:04,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 17359130, now seen corresponding path program 5 times [2024-05-12 11:43:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622456550] [2024-05-12 11:43:04,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622456550] [2024-05-12 11:43:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622456550] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:12,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803117861] [2024-05-12 11:43:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:12,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:12,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:43:12,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 148 transitions, 1326 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:12,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:12,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:43:12,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:13,917 INFO L124 PetriNetUnfolderBase]: 1278/2270 cut-off events. [2024-05-12 11:43:13,918 INFO L125 PetriNetUnfolderBase]: For 50896/50896 co-relation queries the response was YES. [2024-05-12 11:43:13,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11192 conditions, 2270 events. 1278/2270 cut-off events. For 50896/50896 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13388 event pairs, 220 based on Foata normal form. 1/2207 useless extension candidates. Maximal degree in co-relation 11114. Up to 1688 conditions per place. [2024-05-12 11:43:14,005 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 134 selfloop transitions, 45 changer transitions 0/186 dead transitions. [2024-05-12 11:43:14,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 186 transitions, 1986 flow [2024-05-12 11:43:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:43:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:43:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-05-12 11:43:14,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 11:43:14,007 INFO L175 Difference]: Start difference. First operand has 167 places, 148 transitions, 1326 flow. Second operand 9 states and 170 transitions. [2024-05-12 11:43:14,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 186 transitions, 1986 flow [2024-05-12 11:43:14,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 186 transitions, 1921 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 11:43:14,073 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 1370 flow [2024-05-12 11:43:14,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1370, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2024-05-12 11:43:14,075 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 126 predicate places. [2024-05-12 11:43:14,075 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 1370 flow [2024-05-12 11:43:14,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:14,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:14,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:14,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:43:14,076 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:14,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 17352620, now seen corresponding path program 6 times [2024-05-12 11:43:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483905479] [2024-05-12 11:43:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:14,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:22,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483905479] [2024-05-12 11:43:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483905479] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394518302] [2024-05-12 11:43:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:22,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:22,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:43:22,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 1370 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:22,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:22,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:43:22,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:23,208 INFO L124 PetriNetUnfolderBase]: 1276/2270 cut-off events. [2024-05-12 11:43:23,209 INFO L125 PetriNetUnfolderBase]: For 52134/52134 co-relation queries the response was YES. [2024-05-12 11:43:23,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11243 conditions, 2270 events. 1276/2270 cut-off events. For 52134/52134 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13435 event pairs, 236 based on Foata normal form. 1/2207 useless extension candidates. Maximal degree in co-relation 11164. Up to 1686 conditions per place. [2024-05-12 11:43:23,227 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 132 selfloop transitions, 46 changer transitions 0/185 dead transitions. [2024-05-12 11:43:23,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 185 transitions, 1928 flow [2024-05-12 11:43:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:43:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:43:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-05-12 11:43:23,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 11:43:23,231 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 1370 flow. Second operand 9 states and 168 transitions. [2024-05-12 11:43:23,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 185 transitions, 1928 flow [2024-05-12 11:43:23,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 185 transitions, 1823 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 11:43:23,311 INFO L231 Difference]: Finished difference. Result has 172 places, 150 transitions, 1362 flow [2024-05-12 11:43:23,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1362, PETRI_PLACES=172, PETRI_TRANSITIONS=150} [2024-05-12 11:43:23,311 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 128 predicate places. [2024-05-12 11:43:23,312 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 150 transitions, 1362 flow [2024-05-12 11:43:23,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:23,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:23,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:23,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:43:23,312 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:23,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1381617276, now seen corresponding path program 1 times [2024-05-12 11:43:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123904211] [2024-05-12 11:43:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:30,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123904211] [2024-05-12 11:43:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123904211] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:43:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012350616] [2024-05-12 11:43:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:30,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:43:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:30,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:43:30,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:43:30,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 11:43:30,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 150 transitions, 1362 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:30,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:30,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 11:43:30,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:31,247 INFO L124 PetriNetUnfolderBase]: 990/1822 cut-off events. [2024-05-12 11:43:31,248 INFO L125 PetriNetUnfolderBase]: For 53889/53895 co-relation queries the response was YES. [2024-05-12 11:43:31,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9420 conditions, 1822 events. 990/1822 cut-off events. For 53889/53895 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11131 event pairs, 293 based on Foata normal form. 8/1779 useless extension candidates. Maximal degree in co-relation 9340. Up to 1504 conditions per place. [2024-05-12 11:43:31,262 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 130 selfloop transitions, 18 changer transitions 0/173 dead transitions. [2024-05-12 11:43:31,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 173 transitions, 1742 flow [2024-05-12 11:43:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:43:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:43:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 11:43:31,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-05-12 11:43:31,264 INFO L175 Difference]: Start difference. First operand has 172 places, 150 transitions, 1362 flow. Second operand 8 states and 149 transitions. [2024-05-12 11:43:31,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 173 transitions, 1742 flow [2024-05-12 11:43:31,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 173 transitions, 1647 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 11:43:31,327 INFO L231 Difference]: Finished difference. Result has 173 places, 155 transitions, 1360 flow [2024-05-12 11:43:31,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1360, PETRI_PLACES=173, PETRI_TRANSITIONS=155} [2024-05-12 11:43:31,327 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places. [2024-05-12 11:43:31,327 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 155 transitions, 1360 flow [2024-05-12 11:43:31,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:31,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:31,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:31,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:43:31,328 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:31,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1386852404, now seen corresponding path program 5 times [2024-05-12 11:43:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:31,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822411126] [2024-05-12 11:43:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:38,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822411126] [2024-05-12 11:43:38,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822411126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:38,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244204346] [2024-05-12 11:43:38,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:38,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:38,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:38,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:38,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:43:38,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 155 transitions, 1360 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:38,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:38,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:43:38,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:39,677 INFO L124 PetriNetUnfolderBase]: 1321/2305 cut-off events. [2024-05-12 11:43:39,677 INFO L125 PetriNetUnfolderBase]: For 58177/58177 co-relation queries the response was YES. [2024-05-12 11:43:39,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11713 conditions, 2305 events. 1321/2305 cut-off events. For 58177/58177 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13450 event pairs, 312 based on Foata normal form. 3/2261 useless extension candidates. Maximal degree in co-relation 11632. Up to 2012 conditions per place. [2024-05-12 11:43:39,695 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 161 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2024-05-12 11:43:39,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 186 transitions, 1826 flow [2024-05-12 11:43:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:43:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:43:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 11:43:39,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2024-05-12 11:43:39,696 INFO L175 Difference]: Start difference. First operand has 173 places, 155 transitions, 1360 flow. Second operand 9 states and 154 transitions. [2024-05-12 11:43:39,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 186 transitions, 1826 flow [2024-05-12 11:43:39,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 186 transitions, 1771 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:39,787 INFO L231 Difference]: Finished difference. Result has 177 places, 157 transitions, 1370 flow [2024-05-12 11:43:39,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1370, PETRI_PLACES=177, PETRI_TRANSITIONS=157} [2024-05-12 11:43:39,788 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places. [2024-05-12 11:43:39,788 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 157 transitions, 1370 flow [2024-05-12 11:43:39,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:39,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:39,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:39,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 11:43:39,789 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:39,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash -390245174, now seen corresponding path program 6 times [2024-05-12 11:43:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754422006] [2024-05-12 11:43:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:47,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754422006] [2024-05-12 11:43:47,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754422006] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:47,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411455133] [2024-05-12 11:43:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:47,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:47,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:47,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:43:47,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 157 transitions, 1370 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:47,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:47,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:43:47,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:48,175 INFO L124 PetriNetUnfolderBase]: 1393/2445 cut-off events. [2024-05-12 11:43:48,175 INFO L125 PetriNetUnfolderBase]: For 64736/64736 co-relation queries the response was YES. [2024-05-12 11:43:48,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12477 conditions, 2445 events. 1393/2445 cut-off events. For 64736/64736 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14562 event pairs, 320 based on Foata normal form. 3/2392 useless extension candidates. Maximal degree in co-relation 12394. Up to 1987 conditions per place. [2024-05-12 11:43:48,194 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 162 selfloop transitions, 26 changer transitions 0/195 dead transitions. [2024-05-12 11:43:48,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 195 transitions, 2000 flow [2024-05-12 11:43:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:43:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:43:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 11:43:48,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-05-12 11:43:48,196 INFO L175 Difference]: Start difference. First operand has 177 places, 157 transitions, 1370 flow. Second operand 9 states and 161 transitions. [2024-05-12 11:43:48,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 195 transitions, 2000 flow [2024-05-12 11:43:48,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 195 transitions, 1957 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 11:43:48,302 INFO L231 Difference]: Finished difference. Result has 179 places, 161 transitions, 1436 flow [2024-05-12 11:43:48,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1436, PETRI_PLACES=179, PETRI_TRANSITIONS=161} [2024-05-12 11:43:48,302 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places. [2024-05-12 11:43:48,302 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 161 transitions, 1436 flow [2024-05-12 11:43:48,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:48,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:48,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:48,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 11:43:48,303 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:48,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1375830726, now seen corresponding path program 7 times [2024-05-12 11:43:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:48,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127120308] [2024-05-12 11:43:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:48,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:56,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127120308] [2024-05-12 11:43:56,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127120308] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:56,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:56,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:56,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979940221] [2024-05-12 11:43:56,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:56,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:56,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:56,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:56,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:43:56,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 161 transitions, 1436 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:56,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:56,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:43:56,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:57,218 INFO L124 PetriNetUnfolderBase]: 1404/2425 cut-off events. [2024-05-12 11:43:57,219 INFO L125 PetriNetUnfolderBase]: For 65272/65272 co-relation queries the response was YES. [2024-05-12 11:43:57,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12641 conditions, 2425 events. 1404/2425 cut-off events. For 65272/65272 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14176 event pairs, 362 based on Foata normal form. 1/2381 useless extension candidates. Maximal degree in co-relation 12557. Up to 2192 conditions per place. [2024-05-12 11:43:57,241 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 166 selfloop transitions, 17 changer transitions 0/190 dead transitions. [2024-05-12 11:43:57,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 1906 flow [2024-05-12 11:43:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:43:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:43:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 11:43:57,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-05-12 11:43:57,242 INFO L175 Difference]: Start difference. First operand has 179 places, 161 transitions, 1436 flow. Second operand 9 states and 151 transitions. [2024-05-12 11:43:57,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 1906 flow [2024-05-12 11:43:57,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 190 transitions, 1865 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:57,359 INFO L231 Difference]: Finished difference. Result has 183 places, 163 transitions, 1456 flow [2024-05-12 11:43:57,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1456, PETRI_PLACES=183, PETRI_TRANSITIONS=163} [2024-05-12 11:43:57,360 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 139 predicate places. [2024-05-12 11:43:57,360 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 163 transitions, 1456 flow [2024-05-12 11:43:57,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:57,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:57,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:57,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 11:43:57,360 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:57,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1375839344, now seen corresponding path program 7 times [2024-05-12 11:43:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441670097] [2024-05-12 11:43:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:04,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:04,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441670097] [2024-05-12 11:44:04,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441670097] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:04,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:04,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:04,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18393808] [2024-05-12 11:44:04,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:04,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:04,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:04,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:44:04,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 163 transitions, 1456 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:04,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:04,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:44:04,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:05,926 INFO L124 PetriNetUnfolderBase]: 1398/2436 cut-off events. [2024-05-12 11:44:05,926 INFO L125 PetriNetUnfolderBase]: For 65662/65662 co-relation queries the response was YES. [2024-05-12 11:44:05,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12458 conditions, 2436 events. 1398/2436 cut-off events. For 65662/65662 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14346 event pairs, 336 based on Foata normal form. 3/2389 useless extension candidates. Maximal degree in co-relation 12372. Up to 2000 conditions per place. [2024-05-12 11:44:05,945 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 164 selfloop transitions, 25 changer transitions 0/196 dead transitions. [2024-05-12 11:44:05,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 196 transitions, 1944 flow [2024-05-12 11:44:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 11:44:05,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-05-12 11:44:05,950 INFO L175 Difference]: Start difference. First operand has 183 places, 163 transitions, 1456 flow. Second operand 9 states and 161 transitions. [2024-05-12 11:44:05,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 196 transitions, 1944 flow [2024-05-12 11:44:06,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 196 transitions, 1903 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 11:44:06,096 INFO L231 Difference]: Finished difference. Result has 185 places, 163 transitions, 1470 flow [2024-05-12 11:44:06,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1470, PETRI_PLACES=185, PETRI_TRANSITIONS=163} [2024-05-12 11:44:06,097 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2024-05-12 11:44:06,097 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 163 transitions, 1470 flow [2024-05-12 11:44:06,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:06,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:06,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:06,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 11:44:06,097 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:06,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1063033844, now seen corresponding path program 8 times [2024-05-12 11:44:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:06,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613061856] [2024-05-12 11:44:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:13,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-05-12 11:44:13,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:13,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613061856] [2024-05-12 11:44:13,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613061856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:13,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:44:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566343848] [2024-05-12 11:44:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:44:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:44:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:44:13,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:44:13,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 163 transitions, 1470 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:13,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:13,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:44:13,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:14,530 INFO L124 PetriNetUnfolderBase]: 1431/2570 cut-off events. [2024-05-12 11:44:14,530 INFO L125 PetriNetUnfolderBase]: For 69948/69948 co-relation queries the response was YES. [2024-05-12 11:44:14,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12944 conditions, 2570 events. 1431/2570 cut-off events. For 69948/69948 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15708 event pairs, 575 based on Foata normal form. 3/2505 useless extension candidates. Maximal degree in co-relation 12857. Up to 1876 conditions per place. [2024-05-12 11:44:14,548 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 158 selfloop transitions, 37 changer transitions 0/202 dead transitions. [2024-05-12 11:44:14,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 202 transitions, 2133 flow [2024-05-12 11:44:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 11:44:14,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-05-12 11:44:14,550 INFO L175 Difference]: Start difference. First operand has 185 places, 163 transitions, 1470 flow. Second operand 9 states and 167 transitions. [2024-05-12 11:44:14,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 202 transitions, 2133 flow [2024-05-12 11:44:14,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 202 transitions, 2069 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-05-12 11:44:14,683 INFO L231 Difference]: Finished difference. Result has 187 places, 167 transitions, 1539 flow [2024-05-12 11:44:14,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1539, PETRI_PLACES=187, PETRI_TRANSITIONS=167} [2024-05-12 11:44:14,683 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 143 predicate places. [2024-05-12 11:44:14,683 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 167 transitions, 1539 flow [2024-05-12 11:44:14,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:14,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:14,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:14,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 11:44:14,684 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:14,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1063025474, now seen corresponding path program 9 times [2024-05-12 11:44:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042211027] [2024-05-12 11:44:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:22,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:22,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042211027] [2024-05-12 11:44:22,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042211027] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:22,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:22,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633402689] [2024-05-12 11:44:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:23,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:44:23,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 167 transitions, 1539 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:23,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:23,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:44:23,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:24,074 INFO L124 PetriNetUnfolderBase]: 1464/2645 cut-off events. [2024-05-12 11:44:24,075 INFO L125 PetriNetUnfolderBase]: For 73357/73357 co-relation queries the response was YES. [2024-05-12 11:44:24,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13378 conditions, 2645 events. 1464/2645 cut-off events. For 73357/73357 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16406 event pairs, 581 based on Foata normal form. 3/2572 useless extension candidates. Maximal degree in co-relation 13289. Up to 1900 conditions per place. [2024-05-12 11:44:24,097 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 162 selfloop transitions, 37 changer transitions 0/206 dead transitions. [2024-05-12 11:44:24,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 206 transitions, 2203 flow [2024-05-12 11:44:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 11:44:24,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-05-12 11:44:24,098 INFO L175 Difference]: Start difference. First operand has 187 places, 167 transitions, 1539 flow. Second operand 9 states and 169 transitions. [2024-05-12 11:44:24,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 206 transitions, 2203 flow [2024-05-12 11:44:24,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 206 transitions, 2063 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-05-12 11:44:24,247 INFO L231 Difference]: Finished difference. Result has 190 places, 169 transitions, 1510 flow [2024-05-12 11:44:24,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1510, PETRI_PLACES=190, PETRI_TRANSITIONS=169} [2024-05-12 11:44:24,248 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-05-12 11:44:24,248 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 169 transitions, 1510 flow [2024-05-12 11:44:24,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:24,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:24,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:24,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 11:44:24,249 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:24,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash -703281314, now seen corresponding path program 10 times [2024-05-12 11:44:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531848519] [2024-05-12 11:44:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:32,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:32,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531848519] [2024-05-12 11:44:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531848519] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:32,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:32,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819986506] [2024-05-12 11:44:32,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:32,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:32,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:44:32,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 169 transitions, 1510 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:32,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:32,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:44:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:33,698 INFO L124 PetriNetUnfolderBase]: 1458/2584 cut-off events. [2024-05-12 11:44:33,698 INFO L125 PetriNetUnfolderBase]: For 69649/69649 co-relation queries the response was YES. [2024-05-12 11:44:33,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12813 conditions, 2584 events. 1458/2584 cut-off events. For 69649/69649 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15706 event pairs, 535 based on Foata normal form. 3/2526 useless extension candidates. Maximal degree in co-relation 12722. Up to 1896 conditions per place. [2024-05-12 11:44:33,721 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 156 selfloop transitions, 40 changer transitions 0/203 dead transitions. [2024-05-12 11:44:33,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 203 transitions, 2024 flow [2024-05-12 11:44:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 11:44:33,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-05-12 11:44:33,722 INFO L175 Difference]: Start difference. First operand has 190 places, 169 transitions, 1510 flow. Second operand 9 states and 164 transitions. [2024-05-12 11:44:33,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 203 transitions, 2024 flow [2024-05-12 11:44:33,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 203 transitions, 1945 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-05-12 11:44:33,870 INFO L231 Difference]: Finished difference. Result has 193 places, 169 transitions, 1516 flow [2024-05-12 11:44:33,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1516, PETRI_PLACES=193, PETRI_TRANSITIONS=169} [2024-05-12 11:44:33,874 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 149 predicate places. [2024-05-12 11:44:33,874 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 169 transitions, 1516 flow [2024-05-12 11:44:33,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:33,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:33,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:33,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 11:44:33,879 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:33,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1063025226, now seen corresponding path program 8 times [2024-05-12 11:44:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364723139] [2024-05-12 11:44:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364723139] [2024-05-12 11:44:42,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364723139] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:42,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267788240] [2024-05-12 11:44:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:42,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:42,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:44:42,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 169 transitions, 1516 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:42,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:42,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:44:42,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:43,419 INFO L124 PetriNetUnfolderBase]: 1469/2617 cut-off events. [2024-05-12 11:44:43,419 INFO L125 PetriNetUnfolderBase]: For 69530/69530 co-relation queries the response was YES. [2024-05-12 11:44:43,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12942 conditions, 2617 events. 1469/2617 cut-off events. For 69530/69530 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16006 event pairs, 601 based on Foata normal form. 1/2553 useless extension candidates. Maximal degree in co-relation 12850. Up to 2200 conditions per place. [2024-05-12 11:44:43,441 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 165 selfloop transitions, 28 changer transitions 0/200 dead transitions. [2024-05-12 11:44:43,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 200 transitions, 2130 flow [2024-05-12 11:44:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-05-12 11:44:43,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-05-12 11:44:43,443 INFO L175 Difference]: Start difference. First operand has 193 places, 169 transitions, 1516 flow. Second operand 9 states and 159 transitions. [2024-05-12 11:44:43,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 200 transitions, 2130 flow [2024-05-12 11:44:43,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 200 transitions, 1999 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 11:44:43,570 INFO L231 Difference]: Finished difference. Result has 192 places, 171 transitions, 1468 flow [2024-05-12 11:44:43,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1468, PETRI_PLACES=192, PETRI_TRANSITIONS=171} [2024-05-12 11:44:43,571 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 148 predicate places. [2024-05-12 11:44:43,571 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 171 transitions, 1468 flow [2024-05-12 11:44:43,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:43,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:43,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 11:44:43,571 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:43,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -703288072, now seen corresponding path program 9 times [2024-05-12 11:44:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302090801] [2024-05-12 11:44:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302090801] [2024-05-12 11:44:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302090801] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:50,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:50,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:50,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712116513] [2024-05-12 11:44:50,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:50,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:50,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:50,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:50,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:50,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:44:50,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 171 transitions, 1468 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:50,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:50,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:44:50,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:52,002 INFO L124 PetriNetUnfolderBase]: 1480/2622 cut-off events. [2024-05-12 11:44:52,002 INFO L125 PetriNetUnfolderBase]: For 70887/70887 co-relation queries the response was YES. [2024-05-12 11:44:52,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12773 conditions, 2622 events. 1480/2622 cut-off events. For 70887/70887 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15950 event pairs, 595 based on Foata normal form. 1/2561 useless extension candidates. Maximal degree in co-relation 12680. Up to 2212 conditions per place. [2024-05-12 11:44:52,025 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 162 selfloop transitions, 33 changer transitions 0/202 dead transitions. [2024-05-12 11:44:52,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 2092 flow [2024-05-12 11:44:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-05-12 11:44:52,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2024-05-12 11:44:52,026 INFO L175 Difference]: Start difference. First operand has 192 places, 171 transitions, 1468 flow. Second operand 9 states and 157 transitions. [2024-05-12 11:44:52,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 2092 flow [2024-05-12 11:44:52,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 202 transitions, 2005 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-05-12 11:44:52,215 INFO L231 Difference]: Finished difference. Result has 194 places, 173 transitions, 1478 flow [2024-05-12 11:44:52,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1478, PETRI_PLACES=194, PETRI_TRANSITIONS=173} [2024-05-12 11:44:52,215 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 150 predicate places. [2024-05-12 11:44:52,215 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 173 transitions, 1478 flow [2024-05-12 11:44:52,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:52,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:52,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:52,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 11:44:52,216 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:52,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -703281562, now seen corresponding path program 10 times [2024-05-12 11:44:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:52,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114805985] [2024-05-12 11:44:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:00,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:00,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114805985] [2024-05-12 11:45:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114805985] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:00,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:45:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023427242] [2024-05-12 11:45:00,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:00,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:45:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:00,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:45:00,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:45:00,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:45:00,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 173 transitions, 1478 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:00,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:00,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:45:00,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:01,435 INFO L124 PetriNetUnfolderBase]: 1478/2637 cut-off events. [2024-05-12 11:45:01,435 INFO L125 PetriNetUnfolderBase]: For 71295/71295 co-relation queries the response was YES. [2024-05-12 11:45:01,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12750 conditions, 2637 events. 1478/2637 cut-off events. For 71295/71295 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16167 event pairs, 598 based on Foata normal form. 1/2570 useless extension candidates. Maximal degree in co-relation 12656. Up to 2210 conditions per place. [2024-05-12 11:45:01,455 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 163 selfloop transitions, 31 changer transitions 0/201 dead transitions. [2024-05-12 11:45:01,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 201 transitions, 1964 flow [2024-05-12 11:45:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:45:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:45:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-05-12 11:45:01,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2024-05-12 11:45:01,456 INFO L175 Difference]: Start difference. First operand has 194 places, 173 transitions, 1478 flow. Second operand 9 states and 157 transitions. [2024-05-12 11:45:01,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 201 transitions, 1964 flow [2024-05-12 11:45:01,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 201 transitions, 1838 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 11:45:01,600 INFO L231 Difference]: Finished difference. Result has 195 places, 173 transitions, 1419 flow [2024-05-12 11:45:01,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1419, PETRI_PLACES=195, PETRI_TRANSITIONS=173} [2024-05-12 11:45:01,601 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-05-12 11:45:01,601 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 173 transitions, 1419 flow [2024-05-12 11:45:01,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:01,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:01,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:01,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 11:45:01,601 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:01,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1062787890, now seen corresponding path program 5 times [2024-05-12 11:45:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:01,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133310935] [2024-05-12 11:45:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:01,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133310935] [2024-05-12 11:45:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133310935] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:09,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:09,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:45:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567999608] [2024-05-12 11:45:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:09,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:45:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:45:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:45:10,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:45:10,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 173 transitions, 1419 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:10,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:10,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:45:10,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:11,153 INFO L124 PetriNetUnfolderBase]: 1375/2488 cut-off events. [2024-05-12 11:45:11,153 INFO L125 PetriNetUnfolderBase]: For 71631/71639 co-relation queries the response was YES. [2024-05-12 11:45:11,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12016 conditions, 2488 events. 1375/2488 cut-off events. For 71631/71639 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15373 event pairs, 553 based on Foata normal form. 1/2421 useless extension candidates. Maximal degree in co-relation 11921. Up to 2060 conditions per place. [2024-05-12 11:45:11,176 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 155 selfloop transitions, 17 changer transitions 0/201 dead transitions. [2024-05-12 11:45:11,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 201 transitions, 1861 flow [2024-05-12 11:45:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:45:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:45:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-05-12 11:45:11,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 11:45:11,178 INFO L175 Difference]: Start difference. First operand has 195 places, 173 transitions, 1419 flow. Second operand 9 states and 160 transitions. [2024-05-12 11:45:11,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 201 transitions, 1861 flow [2024-05-12 11:45:11,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 201 transitions, 1774 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-05-12 11:45:11,381 INFO L231 Difference]: Finished difference. Result has 195 places, 173 transitions, 1371 flow [2024-05-12 11:45:11,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1371, PETRI_PLACES=195, PETRI_TRANSITIONS=173} [2024-05-12 11:45:11,381 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-05-12 11:45:11,381 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 173 transitions, 1371 flow [2024-05-12 11:45:11,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:11,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:11,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:11,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 11:45:11,382 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:11,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1387251591, now seen corresponding path program 1 times [2024-05-12 11:45:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082093844] [2024-05-12 11:45:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:20,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-05-12 11:45:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082093844] [2024-05-12 11:45:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082093844] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:20,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:20,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:45:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002265360] [2024-05-12 11:45:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:20,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:45:20,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:20,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:45:20,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:45:21,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:45:21,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 173 transitions, 1371 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:21,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:21,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:45:21,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:22,339 INFO L124 PetriNetUnfolderBase]: 1304/2404 cut-off events. [2024-05-12 11:45:22,340 INFO L125 PetriNetUnfolderBase]: For 72309/72328 co-relation queries the response was YES. [2024-05-12 11:45:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11386 conditions, 2404 events. 1304/2404 cut-off events. For 72309/72328 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15192 event pairs, 568 based on Foata normal form. 21/2356 useless extension candidates. Maximal degree in co-relation 11290. Up to 1930 conditions per place. [2024-05-12 11:45:22,363 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 153 selfloop transitions, 23 changer transitions 0/205 dead transitions. [2024-05-12 11:45:22,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 205 transitions, 1819 flow [2024-05-12 11:45:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:45:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:45:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-05-12 11:45:22,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 11:45:22,364 INFO L175 Difference]: Start difference. First operand has 195 places, 173 transitions, 1371 flow. Second operand 9 states and 162 transitions. [2024-05-12 11:45:22,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 205 transitions, 1819 flow [2024-05-12 11:45:22,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 205 transitions, 1738 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-05-12 11:45:22,522 INFO L231 Difference]: Finished difference. Result has 195 places, 175 transitions, 1360 flow [2024-05-12 11:45:22,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1360, PETRI_PLACES=195, PETRI_TRANSITIONS=175} [2024-05-12 11:45:22,523 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-05-12 11:45:22,523 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 175 transitions, 1360 flow [2024-05-12 11:45:22,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:22,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:22,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:22,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 11:45:22,523 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:22,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1259599229, now seen corresponding path program 1 times [2024-05-12 11:45:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:22,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863092626] [2024-05-12 11:45:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863092626] [2024-05-12 11:45:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863092626] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:45:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131612790] [2024-05-12 11:45:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:22,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:45:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:22,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:45:22,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:45:22,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-05-12 11:45:22,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 175 transitions, 1360 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:22,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:22,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-05-12 11:45:22,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:23,048 INFO L124 PetriNetUnfolderBase]: 409/910 cut-off events. [2024-05-12 11:45:23,049 INFO L125 PetriNetUnfolderBase]: For 45580/45600 co-relation queries the response was YES. [2024-05-12 11:45:23,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4616 conditions, 910 events. 409/910 cut-off events. For 45580/45600 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5217 event pairs, 105 based on Foata normal form. 72/904 useless extension candidates. Maximal degree in co-relation 4518. Up to 235 conditions per place. [2024-05-12 11:45:23,055 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 50 selfloop transitions, 21 changer transitions 0/172 dead transitions. [2024-05-12 11:45:23,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 172 transitions, 1418 flow [2024-05-12 11:45:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:45:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:45:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-05-12 11:45:23,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68125 [2024-05-12 11:45:23,056 INFO L175 Difference]: Start difference. First operand has 195 places, 175 transitions, 1360 flow. Second operand 4 states and 109 transitions. [2024-05-12 11:45:23,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 172 transitions, 1418 flow [2024-05-12 11:45:23,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 1280 flow, removed 21 selfloop flow, removed 23 redundant places. [2024-05-12 11:45:23,129 INFO L231 Difference]: Finished difference. Result has 177 places, 157 transitions, 1164 flow [2024-05-12 11:45:23,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1164, PETRI_PLACES=177, PETRI_TRANSITIONS=157} [2024-05-12 11:45:23,130 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places. [2024-05-12 11:45:23,130 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 157 transitions, 1164 flow [2024-05-12 11:45:23,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:23,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:23,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:23,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 11:45:23,130 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:23,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash -725568432, now seen corresponding path program 1 times [2024-05-12 11:45:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:23,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630752929] [2024-05-12 11:45:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:33,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:33,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630752929] [2024-05-12 11:45:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630752929] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:33,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:45:33,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415802740] [2024-05-12 11:45:33,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:33,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:45:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:33,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:45:33,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:45:34,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:45:34,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 157 transitions, 1164 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:34,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:34,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:45:34,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:35,232 INFO L124 PetriNetUnfolderBase]: 820/1501 cut-off events. [2024-05-12 11:45:35,232 INFO L125 PetriNetUnfolderBase]: For 69419/69421 co-relation queries the response was YES. [2024-05-12 11:45:35,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7903 conditions, 1501 events. 820/1501 cut-off events. For 69419/69421 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7611 event pairs, 160 based on Foata normal form. 3/1447 useless extension candidates. Maximal degree in co-relation 7814. Up to 1248 conditions per place. [2024-05-12 11:45:35,243 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 143 selfloop transitions, 26 changer transitions 0/198 dead transitions. [2024-05-12 11:45:35,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 198 transitions, 1643 flow [2024-05-12 11:45:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:45:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:45:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 211 transitions. [2024-05-12 11:45:35,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40576923076923077 [2024-05-12 11:45:35,244 INFO L175 Difference]: Start difference. First operand has 177 places, 157 transitions, 1164 flow. Second operand 13 states and 211 transitions. [2024-05-12 11:45:35,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 198 transitions, 1643 flow [2024-05-12 11:45:35,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 198 transitions, 1641 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:45:35,401 INFO L231 Difference]: Finished difference. Result has 191 places, 168 transitions, 1301 flow [2024-05-12 11:45:35,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1301, PETRI_PLACES=191, PETRI_TRANSITIONS=168} [2024-05-12 11:45:35,402 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places. [2024-05-12 11:45:35,402 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 168 transitions, 1301 flow [2024-05-12 11:45:35,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:35,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:35,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:35,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 11:45:35,402 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:35,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash 789472244, now seen corresponding path program 2 times [2024-05-12 11:45:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864024516] [2024-05-12 11:45:35,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:35,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:47,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-05-12 11:45:47,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864024516] [2024-05-12 11:45:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864024516] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:47,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:47,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:45:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168572561] [2024-05-12 11:45:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:47,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:45:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:45:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:45:47,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:45:47,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 168 transitions, 1301 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:47,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:47,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:45:47,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:48,393 INFO L124 PetriNetUnfolderBase]: 898/1634 cut-off events. [2024-05-12 11:45:48,393 INFO L125 PetriNetUnfolderBase]: For 74202/74202 co-relation queries the response was YES. [2024-05-12 11:45:48,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9091 conditions, 1634 events. 898/1634 cut-off events. For 74202/74202 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8375 event pairs, 162 based on Foata normal form. 1/1574 useless extension candidates. Maximal degree in co-relation 8997. Up to 1317 conditions per place. [2024-05-12 11:45:48,405 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 155 selfloop transitions, 45 changer transitions 0/229 dead transitions. [2024-05-12 11:45:48,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 229 transitions, 2237 flow [2024-05-12 11:45:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:45:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:45:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-05-12 11:45:48,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42954545454545456 [2024-05-12 11:45:48,407 INFO L175 Difference]: Start difference. First operand has 191 places, 168 transitions, 1301 flow. Second operand 11 states and 189 transitions. [2024-05-12 11:45:48,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 229 transitions, 2237 flow [2024-05-12 11:45:48,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 229 transitions, 2119 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-05-12 11:45:48,574 INFO L231 Difference]: Finished difference. Result has 199 places, 200 transitions, 1661 flow [2024-05-12 11:45:48,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1661, PETRI_PLACES=199, PETRI_TRANSITIONS=200} [2024-05-12 11:45:48,575 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places. [2024-05-12 11:45:48,575 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 1661 flow [2024-05-12 11:45:48,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:48,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:48,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:48,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 11:45:48,576 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:48,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash 364587290, now seen corresponding path program 3 times [2024-05-12 11:45:48,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:48,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059457064] [2024-05-12 11:45:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059457064] [2024-05-12 11:45:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059457064] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:59,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:45:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249852061] [2024-05-12 11:45:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:59,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:45:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:45:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:45:59,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:45:59,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 200 transitions, 1661 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:59,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:59,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:45:59,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:00,301 INFO L124 PetriNetUnfolderBase]: 953/1729 cut-off events. [2024-05-12 11:46:00,301 INFO L125 PetriNetUnfolderBase]: For 79727/79730 co-relation queries the response was YES. [2024-05-12 11:46:00,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10048 conditions, 1729 events. 953/1729 cut-off events. For 79727/79730 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9004 event pairs, 241 based on Foata normal form. 3/1665 useless extension candidates. Maximal degree in co-relation 9948. Up to 1376 conditions per place. [2024-05-12 11:46:00,317 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 164 selfloop transitions, 69 changer transitions 0/262 dead transitions. [2024-05-12 11:46:00,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 262 transitions, 2736 flow [2024-05-12 11:46:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:46:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:46:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-05-12 11:46:00,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-05-12 11:46:00,319 INFO L175 Difference]: Start difference. First operand has 199 places, 200 transitions, 1661 flow. Second operand 11 states and 188 transitions. [2024-05-12 11:46:00,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 262 transitions, 2736 flow [2024-05-12 11:46:00,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 262 transitions, 2666 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-05-12 11:46:00,523 INFO L231 Difference]: Finished difference. Result has 211 places, 232 transitions, 2198 flow [2024-05-12 11:46:00,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2198, PETRI_PLACES=211, PETRI_TRANSITIONS=232} [2024-05-12 11:46:00,523 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 167 predicate places. [2024-05-12 11:46:00,524 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 232 transitions, 2198 flow [2024-05-12 11:46:00,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:00,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:00,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:00,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 11:46:00,524 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:00,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1209035442, now seen corresponding path program 4 times [2024-05-12 11:46:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:00,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577083022] [2024-05-12 11:46:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:10,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:10,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577083022] [2024-05-12 11:46:10,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577083022] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:10,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:10,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:46:10,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059916770] [2024-05-12 11:46:10,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:10,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:46:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:10,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:46:10,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:46:10,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:46:10,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 232 transitions, 2198 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:10,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:10,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:46:10,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:11,436 INFO L124 PetriNetUnfolderBase]: 1009/1828 cut-off events. [2024-05-12 11:46:11,437 INFO L125 PetriNetUnfolderBase]: For 86011/86011 co-relation queries the response was YES. [2024-05-12 11:46:11,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11317 conditions, 1828 events. 1009/1828 cut-off events. For 86011/86011 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9719 event pairs, 248 based on Foata normal form. 1/1756 useless extension candidates. Maximal degree in co-relation 11212. Up to 1473 conditions per place. [2024-05-12 11:46:11,454 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 195 selfloop transitions, 87 changer transitions 0/311 dead transitions. [2024-05-12 11:46:11,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 311 transitions, 3670 flow [2024-05-12 11:46:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:46:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:46:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-05-12 11:46:11,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42954545454545456 [2024-05-12 11:46:11,457 INFO L175 Difference]: Start difference. First operand has 211 places, 232 transitions, 2198 flow. Second operand 11 states and 189 transitions. [2024-05-12 11:46:11,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 311 transitions, 3670 flow [2024-05-12 11:46:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 311 transitions, 3592 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-05-12 11:46:11,648 INFO L231 Difference]: Finished difference. Result has 222 places, 284 transitions, 3134 flow [2024-05-12 11:46:11,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3134, PETRI_PLACES=222, PETRI_TRANSITIONS=284} [2024-05-12 11:46:11,649 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 178 predicate places. [2024-05-12 11:46:11,650 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 284 transitions, 3134 flow [2024-05-12 11:46:11,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:11,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:11,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:11,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 11:46:11,650 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:11,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash -186476377, now seen corresponding path program 1 times [2024-05-12 11:46:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584463609] [2024-05-12 11:46:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584463609] [2024-05-12 11:46:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584463609] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:21,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:21,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:46:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90141169] [2024-05-12 11:46:21,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:21,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:46:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:21,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:46:21,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:46:22,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:46:22,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 284 transitions, 3134 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:22,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:22,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:46:22,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:23,473 INFO L124 PetriNetUnfolderBase]: 1072/1915 cut-off events. [2024-05-12 11:46:23,473 INFO L125 PetriNetUnfolderBase]: For 92514/92514 co-relation queries the response was YES. [2024-05-12 11:46:23,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12407 conditions, 1915 events. 1072/1915 cut-off events. For 92514/92514 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10119 event pairs, 265 based on Foata normal form. 1/1842 useless extension candidates. Maximal degree in co-relation 12296. Up to 1611 conditions per place. [2024-05-12 11:46:23,492 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 236 selfloop transitions, 75 changer transitions 0/319 dead transitions. [2024-05-12 11:46:23,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 319 transitions, 4084 flow [2024-05-12 11:46:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:46:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:46:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2024-05-12 11:46:23,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38846153846153847 [2024-05-12 11:46:23,493 INFO L175 Difference]: Start difference. First operand has 222 places, 284 transitions, 3134 flow. Second operand 13 states and 202 transitions. [2024-05-12 11:46:23,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 319 transitions, 4084 flow [2024-05-12 11:46:23,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 319 transitions, 4044 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 11:46:23,677 INFO L231 Difference]: Finished difference. Result has 233 places, 291 transitions, 3341 flow [2024-05-12 11:46:23,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3094, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3341, PETRI_PLACES=233, PETRI_TRANSITIONS=291} [2024-05-12 11:46:23,677 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 189 predicate places. [2024-05-12 11:46:23,678 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 291 transitions, 3341 flow [2024-05-12 11:46:23,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:23,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:23,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:23,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 11:46:23,678 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:23,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1341787580, now seen corresponding path program 5 times [2024-05-12 11:46:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659191885] [2024-05-12 11:46:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:35,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659191885] [2024-05-12 11:46:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659191885] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:35,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:46:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564864214] [2024-05-12 11:46:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:35,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:46:35,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:35,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:46:35,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:46:35,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:46:35,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 291 transitions, 3341 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:35,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:35,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:46:35,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:36,521 INFO L124 PetriNetUnfolderBase]: 1027/1865 cut-off events. [2024-05-12 11:46:36,522 INFO L125 PetriNetUnfolderBase]: For 98226/98228 co-relation queries the response was YES. [2024-05-12 11:46:36,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12541 conditions, 1865 events. 1027/1865 cut-off events. For 98226/98228 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10077 event pairs, 245 based on Foata normal form. 1/1789 useless extension candidates. Maximal degree in co-relation 12427. Up to 1501 conditions per place. [2024-05-12 11:46:36,540 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 199 selfloop transitions, 84 changer transitions 0/315 dead transitions. [2024-05-12 11:46:36,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 315 transitions, 4050 flow [2024-05-12 11:46:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:46:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:46:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 11:46:36,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275 [2024-05-12 11:46:36,541 INFO L175 Difference]: Start difference. First operand has 233 places, 291 transitions, 3341 flow. Second operand 10 states and 171 transitions. [2024-05-12 11:46:36,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 315 transitions, 4050 flow [2024-05-12 11:46:36,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 315 transitions, 3910 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-05-12 11:46:36,765 INFO L231 Difference]: Finished difference. Result has 235 places, 291 transitions, 3404 flow [2024-05-12 11:46:36,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3215, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3404, PETRI_PLACES=235, PETRI_TRANSITIONS=291} [2024-05-12 11:46:36,765 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 191 predicate places. [2024-05-12 11:46:36,765 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 291 transitions, 3404 flow [2024-05-12 11:46:36,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:36,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:36,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 11:46:36,766 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:36,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1463394158, now seen corresponding path program 1 times [2024-05-12 11:46:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:36,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107801074] [2024-05-12 11:46:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:46,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107801074] [2024-05-12 11:46:46,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107801074] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:46,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:46:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817565731] [2024-05-12 11:46:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:46,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:46:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:46:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:46:47,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:46:47,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 291 transitions, 3404 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:47,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:47,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:46:47,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:48,586 INFO L124 PetriNetUnfolderBase]: 1259/2286 cut-off events. [2024-05-12 11:46:48,586 INFO L125 PetriNetUnfolderBase]: For 117913/117913 co-relation queries the response was YES. [2024-05-12 11:46:48,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14814 conditions, 2286 events. 1259/2286 cut-off events. For 117913/117913 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13054 event pairs, 242 based on Foata normal form. 3/2207 useless extension candidates. Maximal degree in co-relation 14698. Up to 1265 conditions per place. [2024-05-12 11:46:48,607 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 300 selfloop transitions, 114 changer transitions 0/422 dead transitions. [2024-05-12 11:46:48,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 422 transitions, 5501 flow [2024-05-12 11:46:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:46:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:46:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2024-05-12 11:46:48,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46136363636363636 [2024-05-12 11:46:48,608 INFO L175 Difference]: Start difference. First operand has 235 places, 291 transitions, 3404 flow. Second operand 11 states and 203 transitions. [2024-05-12 11:46:48,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 422 transitions, 5501 flow [2024-05-12 11:46:48,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 422 transitions, 5346 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-05-12 11:46:48,874 INFO L231 Difference]: Finished difference. Result has 242 places, 338 transitions, 3953 flow [2024-05-12 11:46:48,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3249, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3953, PETRI_PLACES=242, PETRI_TRANSITIONS=338} [2024-05-12 11:46:48,874 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 198 predicate places. [2024-05-12 11:46:48,875 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 338 transitions, 3953 flow [2024-05-12 11:46:48,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:48,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:48,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:48,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 11:46:48,875 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:48,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1195446362, now seen corresponding path program 6 times [2024-05-12 11:46:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:48,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772473717] [2024-05-12 11:46:48,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:48,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772473717] [2024-05-12 11:46:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772473717] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:59,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:59,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:46:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723117937] [2024-05-12 11:46:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:59,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:46:59,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:59,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:46:59,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:46:59,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:46:59,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 338 transitions, 3953 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:59,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:59,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:46:59,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:00,876 INFO L124 PetriNetUnfolderBase]: 1261/2276 cut-off events. [2024-05-12 11:47:00,877 INFO L125 PetriNetUnfolderBase]: For 126497/126499 co-relation queries the response was YES. [2024-05-12 11:47:00,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15940 conditions, 2276 events. 1261/2276 cut-off events. For 126497/126499 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 12988 event pairs, 290 based on Foata normal form. 1/2166 useless extension candidates. Maximal degree in co-relation 15819. Up to 1755 conditions per place. [2024-05-12 11:47:00,898 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 225 selfloop transitions, 147 changer transitions 0/405 dead transitions. [2024-05-12 11:47:00,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 405 transitions, 5504 flow [2024-05-12 11:47:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:47:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:47:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2024-05-12 11:47:00,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-05-12 11:47:00,900 INFO L175 Difference]: Start difference. First operand has 242 places, 338 transitions, 3953 flow. Second operand 12 states and 205 transitions. [2024-05-12 11:47:00,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 405 transitions, 5504 flow [2024-05-12 11:47:01,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 405 transitions, 5433 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-05-12 11:47:01,246 INFO L231 Difference]: Finished difference. Result has 253 places, 374 transitions, 4802 flow [2024-05-12 11:47:01,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3882, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4802, PETRI_PLACES=253, PETRI_TRANSITIONS=374} [2024-05-12 11:47:01,246 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 209 predicate places. [2024-05-12 11:47:01,246 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 374 transitions, 4802 flow [2024-05-12 11:47:01,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:01,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:01,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:01,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 11:47:01,247 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:47:01,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1552122493, now seen corresponding path program 2 times [2024-05-12 11:47:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:01,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008540277] [2024-05-12 11:47:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008540277] [2024-05-12 11:47:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008540277] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:12,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:12,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:47:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897919148] [2024-05-12 11:47:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:12,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:47:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:47:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:47:13,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:47:13,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 374 transitions, 4802 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:13,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:13,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:47:13,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:14,248 INFO L124 PetriNetUnfolderBase]: 1319/2356 cut-off events. [2024-05-12 11:47:14,248 INFO L125 PetriNetUnfolderBase]: For 126621/126621 co-relation queries the response was YES. [2024-05-12 11:47:14,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16875 conditions, 2356 events. 1319/2356 cut-off events. For 126621/126621 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13240 event pairs, 326 based on Foata normal form. 1/2256 useless extension candidates. Maximal degree in co-relation 16750. Up to 2030 conditions per place. [2024-05-12 11:47:14,271 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 317 selfloop transitions, 80 changer transitions 0/405 dead transitions. [2024-05-12 11:47:14,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 405 transitions, 5803 flow [2024-05-12 11:47:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:47:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:47:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-05-12 11:47:14,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075 [2024-05-12 11:47:14,272 INFO L175 Difference]: Start difference. First operand has 253 places, 374 transitions, 4802 flow. Second operand 10 states and 163 transitions. [2024-05-12 11:47:14,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 405 transitions, 5803 flow [2024-05-12 11:47:14,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 405 transitions, 5642 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-05-12 11:47:14,647 INFO L231 Difference]: Finished difference. Result has 256 places, 380 transitions, 4878 flow [2024-05-12 11:47:14,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4643, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4878, PETRI_PLACES=256, PETRI_TRANSITIONS=380} [2024-05-12 11:47:14,648 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 212 predicate places. [2024-05-12 11:47:14,648 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 380 transitions, 4878 flow [2024-05-12 11:47:14,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:14,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:14,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:14,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 11:47:14,648 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:47:14,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1667593370, now seen corresponding path program 2 times [2024-05-12 11:47:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262319888] [2024-05-12 11:47:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262319888] [2024-05-12 11:47:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262319888] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:25,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:47:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660751059] [2024-05-12 11:47:25,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:25,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:47:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:25,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:47:25,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:47:26,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:47:26,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 380 transitions, 4878 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:26,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:26,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:47:26,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:27,695 INFO L124 PetriNetUnfolderBase]: 1368/2459 cut-off events. [2024-05-12 11:47:27,696 INFO L125 PetriNetUnfolderBase]: For 134250/134250 co-relation queries the response was YES. [2024-05-12 11:47:27,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 2459 events. 1368/2459 cut-off events. For 134250/134250 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14132 event pairs, 250 based on Foata normal form. 3/2357 useless extension candidates. Maximal degree in co-relation 17323. Up to 1736 conditions per place. [2024-05-12 11:47:27,723 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 337 selfloop transitions, 136 changer transitions 0/481 dead transitions. [2024-05-12 11:47:27,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 481 transitions, 6723 flow [2024-05-12 11:47:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:47:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:47:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-05-12 11:47:27,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-05-12 11:47:27,725 INFO L175 Difference]: Start difference. First operand has 256 places, 380 transitions, 4878 flow. Second operand 11 states and 192 transitions. [2024-05-12 11:47:27,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 481 transitions, 6723 flow [2024-05-12 11:47:28,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 481 transitions, 6560 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-05-12 11:47:28,220 INFO L231 Difference]: Finished difference. Result has 262 places, 433 transitions, 5653 flow [2024-05-12 11:47:28,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4717, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5653, PETRI_PLACES=262, PETRI_TRANSITIONS=433} [2024-05-12 11:47:28,220 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 218 predicate places. [2024-05-12 11:47:28,220 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 433 transitions, 5653 flow [2024-05-12 11:47:28,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:28,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:28,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:28,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-12 11:47:28,221 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:47:28,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:28,221 INFO L85 PathProgramCache]: Analyzing trace with hash 368402305, now seen corresponding path program 3 times [2024-05-12 11:47:28,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:28,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550313762] [2024-05-12 11:47:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550313762] [2024-05-12 11:47:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550313762] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:38,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:47:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431878186] [2024-05-12 11:47:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:38,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:47:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:47:38,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:47:38,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:47:38,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 433 transitions, 5653 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:38,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:38,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:47:38,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:40,398 INFO L124 PetriNetUnfolderBase]: 1390/2505 cut-off events. [2024-05-12 11:47:40,398 INFO L125 PetriNetUnfolderBase]: For 134012/134012 co-relation queries the response was YES. [2024-05-12 11:47:40,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18790 conditions, 2505 events. 1390/2505 cut-off events. For 134012/134012 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 14499 event pairs, 234 based on Foata normal form. 1/2405 useless extension candidates. Maximal degree in co-relation 18659. Up to 1760 conditions per place. [2024-05-12 11:47:40,424 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 347 selfloop transitions, 146 changer transitions 0/501 dead transitions. [2024-05-12 11:47:40,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 501 transitions, 7445 flow [2024-05-12 11:47:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:47:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:47:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-05-12 11:47:40,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-05-12 11:47:40,425 INFO L175 Difference]: Start difference. First operand has 262 places, 433 transitions, 5653 flow. Second operand 11 states and 188 transitions. [2024-05-12 11:47:40,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 501 transitions, 7445 flow [2024-05-12 11:47:40,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 501 transitions, 7394 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-05-12 11:47:40,983 INFO L231 Difference]: Finished difference. Result has 273 places, 463 transitions, 6247 flow [2024-05-12 11:47:40,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5608, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6247, PETRI_PLACES=273, PETRI_TRANSITIONS=463} [2024-05-12 11:47:40,986 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 229 predicate places. [2024-05-12 11:47:40,986 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 463 transitions, 6247 flow [2024-05-12 11:47:40,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:40,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:40,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:40,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-12 11:47:40,987 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:47:40,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash 578726678, now seen corresponding path program 7 times [2024-05-12 11:47:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366002382] [2024-05-12 11:47:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:51,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:51,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366002382] [2024-05-12 11:47:51,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366002382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:51,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:51,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:47:51,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705137477] [2024-05-12 11:47:51,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:51,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:47:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:51,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:47:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:47:52,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:47:52,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 463 transitions, 6247 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:52,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:52,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:47:52,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:53,697 INFO L124 PetriNetUnfolderBase]: 1347/2460 cut-off events. [2024-05-12 11:47:53,697 INFO L125 PetriNetUnfolderBase]: For 140062/140062 co-relation queries the response was YES. [2024-05-12 11:47:53,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19114 conditions, 2460 events. 1347/2460 cut-off events. For 140062/140062 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 14548 event pairs, 237 based on Foata normal form. 1/2359 useless extension candidates. Maximal degree in co-relation 18979. Up to 1933 conditions per place. [2024-05-12 11:47:53,725 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 359 selfloop transitions, 104 changer transitions 0/514 dead transitions. [2024-05-12 11:47:53,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 514 transitions, 7668 flow [2024-05-12 11:47:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:47:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:47:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 217 transitions. [2024-05-12 11:47:53,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173076923076923 [2024-05-12 11:47:53,727 INFO L175 Difference]: Start difference. First operand has 273 places, 463 transitions, 6247 flow. Second operand 13 states and 217 transitions. [2024-05-12 11:47:53,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 514 transitions, 7668 flow [2024-05-12 11:47:54,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 514 transitions, 7578 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-05-12 11:47:54,265 INFO L231 Difference]: Finished difference. Result has 285 places, 486 transitions, 6765 flow [2024-05-12 11:47:54,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6157, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6765, PETRI_PLACES=285, PETRI_TRANSITIONS=486} [2024-05-12 11:47:54,266 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 241 predicate places. [2024-05-12 11:47:54,266 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 486 transitions, 6765 flow [2024-05-12 11:47:54,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:54,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:54,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:54,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-12 11:47:54,267 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:47:54,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:54,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1667413663, now seen corresponding path program 4 times [2024-05-12 11:47:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:54,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417514407] [2024-05-12 11:47:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:48:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417514407] [2024-05-12 11:48:05,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417514407] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:05,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:05,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:48:05,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216255274] [2024-05-12 11:48:05,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:05,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:48:05,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:05,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:48:05,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:48:05,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:48:05,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 486 transitions, 6765 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:05,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:05,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:48:05,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:07,109 INFO L124 PetriNetUnfolderBase]: 1402/2531 cut-off events. [2024-05-12 11:48:07,109 INFO L125 PetriNetUnfolderBase]: For 141793/141793 co-relation queries the response was YES. [2024-05-12 11:48:07,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19915 conditions, 2531 events. 1402/2531 cut-off events. For 141793/141793 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 14753 event pairs, 248 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 19775. Up to 1952 conditions per place. [2024-05-12 11:48:07,138 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 347 selfloop transitions, 163 changer transitions 0/518 dead transitions. [2024-05-12 11:48:07,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 518 transitions, 8026 flow [2024-05-12 11:48:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:48:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:48:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 214 transitions. [2024-05-12 11:48:07,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115384615384615 [2024-05-12 11:48:07,143 INFO L175 Difference]: Start difference. First operand has 285 places, 486 transitions, 6765 flow. Second operand 13 states and 214 transitions. [2024-05-12 11:48:07,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 518 transitions, 8026 flow [2024-05-12 11:48:07,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 518 transitions, 7790 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-05-12 11:48:07,832 INFO L231 Difference]: Finished difference. Result has 292 places, 490 transitions, 6954 flow [2024-05-12 11:48:07,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6529, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6954, PETRI_PLACES=292, PETRI_TRANSITIONS=490} [2024-05-12 11:48:07,833 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 248 predicate places. [2024-05-12 11:48:07,833 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 490 transitions, 6954 flow [2024-05-12 11:48:07,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:07,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:07,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:48:07,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-12 11:48:07,834 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:48:07,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1957765419, now seen corresponding path program 5 times [2024-05-12 11:48:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593106331] [2024-05-12 11:48:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:48:19,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:19,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593106331] [2024-05-12 11:48:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593106331] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:19,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:48:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687550353] [2024-05-12 11:48:19,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:19,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:48:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:48:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:48:19,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:48:19,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 490 transitions, 6954 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:19,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:19,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:48:19,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:21,450 INFO L124 PetriNetUnfolderBase]: 1411/2544 cut-off events. [2024-05-12 11:48:21,450 INFO L125 PetriNetUnfolderBase]: For 145800/145800 co-relation queries the response was YES. [2024-05-12 11:48:21,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20244 conditions, 2544 events. 1411/2544 cut-off events. For 145800/145800 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14873 event pairs, 309 based on Foata normal form. 1/2445 useless extension candidates. Maximal degree in co-relation 20101. Up to 2203 conditions per place. [2024-05-12 11:48:21,495 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 432 selfloop transitions, 85 changer transitions 0/525 dead transitions. [2024-05-12 11:48:21,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 525 transitions, 8316 flow [2024-05-12 11:48:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:48:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:48:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-05-12 11:48:21,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-05-12 11:48:21,497 INFO L175 Difference]: Start difference. First operand has 292 places, 490 transitions, 6954 flow. Second operand 10 states and 164 transitions. [2024-05-12 11:48:21,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 525 transitions, 8316 flow [2024-05-12 11:48:22,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 525 transitions, 8095 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-05-12 11:48:22,496 INFO L231 Difference]: Finished difference. Result has 294 places, 502 transitions, 7098 flow [2024-05-12 11:48:22,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6751, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7098, PETRI_PLACES=294, PETRI_TRANSITIONS=502} [2024-05-12 11:48:22,497 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 250 predicate places. [2024-05-12 11:48:22,498 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 502 transitions, 7098 flow [2024-05-12 11:48:22,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:22,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:22,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:48:22,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-12 11:48:22,500 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:48:22,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1002633654, now seen corresponding path program 8 times [2024-05-12 11:48:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:22,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765195794] [2024-05-12 11:48:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:22,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:33,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-05-12 11:48:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765195794] [2024-05-12 11:48:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765195794] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:33,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:48:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536760683] [2024-05-12 11:48:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:33,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:48:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:48:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:48:33,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:48:33,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 502 transitions, 7098 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:33,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:33,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:48:33,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:35,256 INFO L124 PetriNetUnfolderBase]: 1356/2475 cut-off events. [2024-05-12 11:48:35,256 INFO L125 PetriNetUnfolderBase]: For 147481/147496 co-relation queries the response was YES. [2024-05-12 11:48:35,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19590 conditions, 2475 events. 1356/2475 cut-off events. For 147481/147496 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14665 event pairs, 271 based on Foata normal form. 1/2366 useless extension candidates. Maximal degree in co-relation 19446. Up to 2004 conditions per place. [2024-05-12 11:48:35,297 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 383 selfloop transitions, 81 changer transitions 0/524 dead transitions. [2024-05-12 11:48:35,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 524 transitions, 8183 flow [2024-05-12 11:48:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:48:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:48:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-05-12 11:48:35,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-05-12 11:48:35,299 INFO L175 Difference]: Start difference. First operand has 294 places, 502 transitions, 7098 flow. Second operand 10 states and 172 transitions. [2024-05-12 11:48:35,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 524 transitions, 8183 flow [2024-05-12 11:48:36,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 524 transitions, 8027 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-05-12 11:48:36,028 INFO L231 Difference]: Finished difference. Result has 297 places, 502 transitions, 7121 flow [2024-05-12 11:48:36,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6942, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7121, PETRI_PLACES=297, PETRI_TRANSITIONS=502} [2024-05-12 11:48:36,029 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 253 predicate places. [2024-05-12 11:48:36,029 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 502 transitions, 7121 flow [2024-05-12 11:48:36,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:36,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:36,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:48:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-12 11:48:36,030 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:48:36,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1328401314, now seen corresponding path program 3 times [2024-05-12 11:48:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952932725] [2024-05-12 11:48:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:36,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:48:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952932725] [2024-05-12 11:48:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952932725] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:48:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352935638] [2024-05-12 11:48:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:47,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:48:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:48:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:48:47,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:48:47,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 502 transitions, 7121 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:47,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:47,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:48:47,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:49,383 INFO L124 PetriNetUnfolderBase]: 1440/2614 cut-off events. [2024-05-12 11:48:49,384 INFO L125 PetriNetUnfolderBase]: For 148600/148600 co-relation queries the response was YES. [2024-05-12 11:48:49,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20267 conditions, 2614 events. 1440/2614 cut-off events. For 148600/148600 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 15489 event pairs, 269 based on Foata normal form. 3/2509 useless extension candidates. Maximal degree in co-relation 20122. Up to 1767 conditions per place. [2024-05-12 11:48:49,413 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 421 selfloop transitions, 175 changer transitions 0/604 dead transitions. [2024-05-12 11:48:49,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 604 transitions, 9562 flow [2024-05-12 11:48:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:48:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:48:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 11:48:49,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-05-12 11:48:49,415 INFO L175 Difference]: Start difference. First operand has 297 places, 502 transitions, 7121 flow. Second operand 11 states and 195 transitions. [2024-05-12 11:48:49,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 604 transitions, 9562 flow [2024-05-12 11:48:50,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 604 transitions, 9430 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 11:48:50,127 INFO L231 Difference]: Finished difference. Result has 304 places, 549 transitions, 8134 flow [2024-05-12 11:48:50,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6989, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8134, PETRI_PLACES=304, PETRI_TRANSITIONS=549} [2024-05-12 11:48:50,128 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 260 predicate places. [2024-05-12 11:48:50,128 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 549 transitions, 8134 flow [2024-05-12 11:48:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:50,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:50,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:48:50,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-12 11:48:50,128 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:48:50,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 167176148, now seen corresponding path program 9 times [2024-05-12 11:48:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:50,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510078487] [2024-05-12 11:48:50,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:02,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:02,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510078487] [2024-05-12 11:49:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510078487] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:49:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577484013] [2024-05-12 11:49:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:02,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:49:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:49:02,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:49:02,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:49:02,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 549 transitions, 8134 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:02,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:02,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:49:02,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:04,125 INFO L124 PetriNetUnfolderBase]: 1412/2578 cut-off events. [2024-05-12 11:49:04,125 INFO L125 PetriNetUnfolderBase]: For 152308/152347 co-relation queries the response was YES. [2024-05-12 11:49:04,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21004 conditions, 2578 events. 1412/2578 cut-off events. For 152308/152347 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 15484 event pairs, 244 based on Foata normal form. 1/2465 useless extension candidates. Maximal degree in co-relation 20855. Up to 2054 conditions per place. [2024-05-12 11:49:04,161 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 426 selfloop transitions, 107 changer transitions 0/593 dead transitions. [2024-05-12 11:49:04,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 593 transitions, 9589 flow [2024-05-12 11:49:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:49:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:49:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 217 transitions. [2024-05-12 11:49:04,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173076923076923 [2024-05-12 11:49:04,162 INFO L175 Difference]: Start difference. First operand has 304 places, 549 transitions, 8134 flow. Second operand 13 states and 217 transitions. [2024-05-12 11:49:04,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 593 transitions, 9589 flow [2024-05-12 11:49:04,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 593 transitions, 9444 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 11:49:04,842 INFO L231 Difference]: Finished difference. Result has 316 places, 566 transitions, 8461 flow [2024-05-12 11:49:04,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7989, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8461, PETRI_PLACES=316, PETRI_TRANSITIONS=566} [2024-05-12 11:49:04,843 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 272 predicate places. [2024-05-12 11:49:04,843 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 566 transitions, 8461 flow [2024-05-12 11:49:04,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:04,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:04,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:04,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-12 11:49:04,843 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:49:04,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 155787629, now seen corresponding path program 1 times [2024-05-12 11:49:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414815694] [2024-05-12 11:49:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:16,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:16,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414815694] [2024-05-12 11:49:16,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414815694] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:16,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:16,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:49:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598951329] [2024-05-12 11:49:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:16,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:49:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:49:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:49:17,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:49:17,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 566 transitions, 8461 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:17,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:17,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:49:17,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:18,926 INFO L124 PetriNetUnfolderBase]: 1505/2717 cut-off events. [2024-05-12 11:49:18,927 INFO L125 PetriNetUnfolderBase]: For 167962/167962 co-relation queries the response was YES. [2024-05-12 11:49:18,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22152 conditions, 2717 events. 1505/2717 cut-off events. For 167962/167962 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 16179 event pairs, 265 based on Foata normal form. 3/2607 useless extension candidates. Maximal degree in co-relation 21999. Up to 1824 conditions per place. [2024-05-12 11:49:18,959 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 397 selfloop transitions, 213 changer transitions 0/618 dead transitions. [2024-05-12 11:49:18,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 618 transitions, 10407 flow [2024-05-12 11:49:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-12 11:49:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-05-12 11:49:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 268 transitions. [2024-05-12 11:49:18,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-05-12 11:49:18,960 INFO L175 Difference]: Start difference. First operand has 316 places, 566 transitions, 8461 flow. Second operand 16 states and 268 transitions. [2024-05-12 11:49:18,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 618 transitions, 10407 flow [2024-05-12 11:49:19,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 618 transitions, 10238 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 11:49:19,662 INFO L231 Difference]: Finished difference. Result has 325 places, 572 transitions, 8806 flow [2024-05-12 11:49:19,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8292, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8806, PETRI_PLACES=325, PETRI_TRANSITIONS=572} [2024-05-12 11:49:19,663 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 281 predicate places. [2024-05-12 11:49:19,663 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 572 transitions, 8806 flow [2024-05-12 11:49:19,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:19,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:19,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:19,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-12 11:49:19,664 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:49:19,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1961490069, now seen corresponding path program 6 times [2024-05-12 11:49:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341222606] [2024-05-12 11:49:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341222606] [2024-05-12 11:49:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341222606] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:30,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:49:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705941919] [2024-05-12 11:49:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:30,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:49:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:49:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:49:31,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:49:31,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 572 transitions, 8806 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:31,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:31,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:49:31,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:32,806 INFO L124 PetriNetUnfolderBase]: 1535/2765 cut-off events. [2024-05-12 11:49:32,807 INFO L125 PetriNetUnfolderBase]: For 173252/173252 co-relation queries the response was YES. [2024-05-12 11:49:32,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23075 conditions, 2765 events. 1535/2765 cut-off events. For 173252/173252 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 16490 event pairs, 218 based on Foata normal form. 1/2654 useless extension candidates. Maximal degree in co-relation 22921. Up to 1970 conditions per place. [2024-05-12 11:49:32,841 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 433 selfloop transitions, 216 changer transitions 0/657 dead transitions. [2024-05-12 11:49:32,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 657 transitions, 11350 flow [2024-05-12 11:49:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:49:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:49:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-05-12 11:49:32,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-05-12 11:49:32,843 INFO L175 Difference]: Start difference. First operand has 325 places, 572 transitions, 8806 flow. Second operand 11 states and 190 transitions. [2024-05-12 11:49:32,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 657 transitions, 11350 flow [2024-05-12 11:49:33,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 657 transitions, 11039 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-05-12 11:49:33,556 INFO L231 Difference]: Finished difference. Result has 327 places, 617 transitions, 9468 flow [2024-05-12 11:49:33,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8499, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9468, PETRI_PLACES=327, PETRI_TRANSITIONS=617} [2024-05-12 11:49:33,557 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 283 predicate places. [2024-05-12 11:49:33,557 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 617 transitions, 9468 flow [2024-05-12 11:49:33,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:33,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:33,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:33,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-12 11:49:33,558 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:49:33,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1961484489, now seen corresponding path program 7 times [2024-05-12 11:49:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:33,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490620021] [2024-05-12 11:49:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490620021] [2024-05-12 11:49:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490620021] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:49:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246742717] [2024-05-12 11:49:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:44,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:49:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:44,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:49:44,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:49:44,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:49:44,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 617 transitions, 9468 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:44,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:44,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:49:44,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:46,463 INFO L124 PetriNetUnfolderBase]: 1533/2762 cut-off events. [2024-05-12 11:49:46,463 INFO L125 PetriNetUnfolderBase]: For 174312/174312 co-relation queries the response was YES. [2024-05-12 11:49:46,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23311 conditions, 2762 events. 1533/2762 cut-off events. For 174312/174312 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16493 event pairs, 214 based on Foata normal form. 1/2651 useless extension candidates. Maximal degree in co-relation 23154. Up to 1968 conditions per place. [2024-05-12 11:49:46,496 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 436 selfloop transitions, 211 changer transitions 0/655 dead transitions. [2024-05-12 11:49:46,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 655 transitions, 11375 flow [2024-05-12 11:49:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:49:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:49:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-05-12 11:49:46,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-05-12 11:49:46,497 INFO L175 Difference]: Start difference. First operand has 327 places, 617 transitions, 9468 flow. Second operand 11 states and 190 transitions. [2024-05-12 11:49:46,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 655 transitions, 11375 flow [2024-05-12 11:49:47,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 655 transitions, 11115 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 11:49:47,320 INFO L231 Difference]: Finished difference. Result has 333 places, 617 transitions, 9643 flow [2024-05-12 11:49:47,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9208, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9643, PETRI_PLACES=333, PETRI_TRANSITIONS=617} [2024-05-12 11:49:47,321 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 289 predicate places. [2024-05-12 11:49:47,321 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 617 transitions, 9643 flow [2024-05-12 11:49:47,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:47,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:47,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:47,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-12 11:49:47,322 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:49:47,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1463393941, now seen corresponding path program 8 times [2024-05-12 11:49:47,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:47,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440274420] [2024-05-12 11:49:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:47,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440274420] [2024-05-12 11:49:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440274420] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:59,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:59,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:49:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596117099] [2024-05-12 11:49:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:59,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:49:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:49:59,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:49:59,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:49:59,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 617 transitions, 9643 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:59,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:59,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:49:59,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:00,843 INFO L124 PetriNetUnfolderBase]: 1550/2798 cut-off events. [2024-05-12 11:50:00,844 INFO L125 PetriNetUnfolderBase]: For 183099/183099 co-relation queries the response was YES. [2024-05-12 11:50:00,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23741 conditions, 2798 events. 1550/2798 cut-off events. For 183099/183099 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 16759 event pairs, 257 based on Foata normal form. 1/2686 useless extension candidates. Maximal degree in co-relation 23583. Up to 2118 conditions per place. [2024-05-12 11:50:00,886 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 422 selfloop transitions, 245 changer transitions 0/675 dead transitions. [2024-05-12 11:50:00,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 675 transitions, 11880 flow [2024-05-12 11:50:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-12 11:50:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-05-12 11:50:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 241 transitions. [2024-05-12 11:50:00,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40166666666666667 [2024-05-12 11:50:00,887 INFO L175 Difference]: Start difference. First operand has 333 places, 617 transitions, 9643 flow. Second operand 15 states and 241 transitions. [2024-05-12 11:50:00,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 675 transitions, 11880 flow [2024-05-12 11:50:01,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 675 transitions, 11437 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-05-12 11:50:01,726 INFO L231 Difference]: Finished difference. Result has 339 places, 633 transitions, 9930 flow [2024-05-12 11:50:01,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9232, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9930, PETRI_PLACES=339, PETRI_TRANSITIONS=633} [2024-05-12 11:50:01,727 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 295 predicate places. [2024-05-12 11:50:01,727 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 633 transitions, 9930 flow [2024-05-12 11:50:01,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:01,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:01,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-12 11:50:01,728 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:50:01,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1895252518, now seen corresponding path program 4 times [2024-05-12 11:50:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194080382] [2024-05-12 11:50:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194080382] [2024-05-12 11:50:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194080382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:50:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729212647] [2024-05-12 11:50:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:10,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:50:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:10,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:50:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:50:10,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:50:10,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 633 transitions, 9930 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:10,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:10,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:50:10,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:12,790 INFO L124 PetriNetUnfolderBase]: 1570/2832 cut-off events. [2024-05-12 11:50:12,791 INFO L125 PetriNetUnfolderBase]: For 193938/193938 co-relation queries the response was YES. [2024-05-12 11:50:12,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24081 conditions, 2832 events. 1570/2832 cut-off events. For 193938/193938 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 17031 event pairs, 252 based on Foata normal form. 3/2720 useless extension candidates. Maximal degree in co-relation 23922. Up to 1967 conditions per place. [2024-05-12 11:50:12,825 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 518 selfloop transitions, 157 changer transitions 0/683 dead transitions. [2024-05-12 11:50:12,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 683 transitions, 12051 flow [2024-05-12 11:50:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:50:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:50:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 11:50:12,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-05-12 11:50:12,827 INFO L175 Difference]: Start difference. First operand has 339 places, 633 transitions, 9930 flow. Second operand 11 states and 197 transitions. [2024-05-12 11:50:12,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 683 transitions, 12051 flow [2024-05-12 11:50:13,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 683 transitions, 11725 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-05-12 11:50:13,797 INFO L231 Difference]: Finished difference. Result has 343 places, 638 transitions, 10002 flow [2024-05-12 11:50:13,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9604, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10002, PETRI_PLACES=343, PETRI_TRANSITIONS=638} [2024-05-12 11:50:13,798 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 299 predicate places. [2024-05-12 11:50:13,798 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 638 transitions, 10002 flow [2024-05-12 11:50:13,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:13,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:13,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:13,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-12 11:50:13,798 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:50:13,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1895252301, now seen corresponding path program 9 times [2024-05-12 11:50:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:13,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493808136] [2024-05-12 11:50:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493808136] [2024-05-12 11:50:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493808136] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:50:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33219687] [2024-05-12 11:50:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:23,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:50:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:50:23,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:50:23,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:50:23,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 638 transitions, 10002 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:23,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:23,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:50:23,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:25,495 INFO L124 PetriNetUnfolderBase]: 1568/2820 cut-off events. [2024-05-12 11:50:25,496 INFO L125 PetriNetUnfolderBase]: For 189429/189429 co-relation queries the response was YES. [2024-05-12 11:50:25,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24056 conditions, 2820 events. 1568/2820 cut-off events. For 189429/189429 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 16824 event pairs, 201 based on Foata normal form. 1/2707 useless extension candidates. Maximal degree in co-relation 23897. Up to 2022 conditions per place. [2024-05-12 11:50:25,532 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 423 selfloop transitions, 242 changer transitions 0/673 dead transitions. [2024-05-12 11:50:25,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 673 transitions, 11948 flow [2024-05-12 11:50:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:50:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:50:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-05-12 11:50:25,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 11:50:25,533 INFO L175 Difference]: Start difference. First operand has 343 places, 638 transitions, 10002 flow. Second operand 11 states and 187 transitions. [2024-05-12 11:50:25,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 673 transitions, 11948 flow [2024-05-12 11:50:26,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 673 transitions, 11719 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 11:50:26,517 INFO L231 Difference]: Finished difference. Result has 348 places, 638 transitions, 10267 flow [2024-05-12 11:50:26,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9773, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10267, PETRI_PLACES=348, PETRI_TRANSITIONS=638} [2024-05-12 11:50:26,517 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 304 predicate places. [2024-05-12 11:50:26,517 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 638 transitions, 10267 flow [2024-05-12 11:50:26,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:26,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:26,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:26,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-12 11:50:26,518 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:50:26,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1895259958, now seen corresponding path program 5 times [2024-05-12 11:50:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:26,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753570311] [2024-05-12 11:50:26,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:35,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753570311] [2024-05-12 11:50:35,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753570311] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:35,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:35,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:50:35,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474100203] [2024-05-12 11:50:35,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:35,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:50:35,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:50:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:50:36,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-05-12 11:50:36,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 638 transitions, 10267 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:36,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:36,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-05-12 11:50:36,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:37,974 INFO L124 PetriNetUnfolderBase]: 1562/2819 cut-off events. [2024-05-12 11:50:37,974 INFO L125 PetriNetUnfolderBase]: For 190781/190781 co-relation queries the response was YES. [2024-05-12 11:50:38,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23889 conditions, 2819 events. 1562/2819 cut-off events. For 190781/190781 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 16924 event pairs, 250 based on Foata normal form. 3/2707 useless extension candidates. Maximal degree in co-relation 23729. Up to 1960 conditions per place. [2024-05-12 11:50:38,011 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 506 selfloop transitions, 163 changer transitions 0/677 dead transitions. [2024-05-12 11:50:38,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 677 transitions, 12088 flow [2024-05-12 11:50:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:50:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:50:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 11:50:38,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-05-12 11:50:38,013 INFO L175 Difference]: Start difference. First operand has 348 places, 638 transitions, 10267 flow. Second operand 11 states and 193 transitions. [2024-05-12 11:50:38,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 677 transitions, 12088 flow [2024-05-12 11:50:38,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 677 transitions, 11771 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 11:50:38,856 INFO L231 Difference]: Finished difference. Result has 353 places, 638 transitions, 10285 flow [2024-05-12 11:50:38,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9950, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10285, PETRI_PLACES=353, PETRI_TRANSITIONS=638} [2024-05-12 11:50:38,856 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 309 predicate places. [2024-05-12 11:50:38,857 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 638 transitions, 10285 flow [2024-05-12 11:50:38,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:38,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:38,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:38,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-12 11:50:38,857 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:50:38,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2105374864, now seen corresponding path program 10 times [2024-05-12 11:50:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:38,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109084782] [2024-05-12 11:50:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:50,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109084782] [2024-05-12 11:50:50,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109084782] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:50,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:50,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:50:50,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967024074] [2024-05-12 11:50:50,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:50,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:50:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:50:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:50:51,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 11:50:51,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 638 transitions, 10285 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:51,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:51,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 11:50:51,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:52,815 INFO L124 PetriNetUnfolderBase]: 1520/2772 cut-off events. [2024-05-12 11:50:52,815 INFO L125 PetriNetUnfolderBase]: For 189699/189699 co-relation queries the response was YES. [2024-05-12 11:50:52,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23677 conditions, 2772 events. 1520/2772 cut-off events. For 189699/189699 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 16880 event pairs, 229 based on Foata normal form. 1/2660 useless extension candidates. Maximal degree in co-relation 23516. Up to 2147 conditions per place. [2024-05-12 11:50:52,857 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 438 selfloop transitions, 143 changer transitions 0/677 dead transitions. [2024-05-12 11:50:52,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 677 transitions, 11837 flow [2024-05-12 11:50:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:50:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:50:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2024-05-12 11:50:52,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2024-05-12 11:50:52,859 INFO L175 Difference]: Start difference. First operand has 353 places, 638 transitions, 10285 flow. Second operand 13 states and 216 transitions. [2024-05-12 11:50:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 677 transitions, 11837 flow [2024-05-12 11:50:53,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 677 transitions, 11530 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-05-12 11:50:53,700 INFO L231 Difference]: Finished difference. Result has 359 places, 650 transitions, 10508 flow [2024-05-12 11:50:53,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9980, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10508, PETRI_PLACES=359, PETRI_TRANSITIONS=650} [2024-05-12 11:50:53,701 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 315 predicate places. [2024-05-12 11:50:53,701 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 650 transitions, 10508 flow [2024-05-12 11:50:53,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:53,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:53,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:53,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-12 11:50:53,702 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:50:53,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2105375019, now seen corresponding path program 10 times [2024-05-12 11:50:53,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:53,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332281587] [2024-05-12 11:50:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15