./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.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/safe030_power.oepc_pso.oepc_rmo.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/safe030_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:21:30,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:21:30,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:21:30,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:21:30,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:21:30,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:21:30,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:21:30,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:21:30,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:21:30,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:21:30,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:21:30,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:21:30,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:21:30,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:21:30,469 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:21:30,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:21:30,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:21:30,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:21:30,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:21:30,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:21:30,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:21:30,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:21:30,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:21:30,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:21:30,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:21:30,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:21:30,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:21:30,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:21:30,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:21:30,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:21:30,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:21:30,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:21:30,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:21:30,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:21:30,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:21:30,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:21:30,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:21:30,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:21:30,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:21:30,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:21:30,477 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:21:30,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:21:30,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:21:30,478 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 12:21:30,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:21:30,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:21:30,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:21:30,760 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:21:30,761 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:21:30,762 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/safe030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 12:21:30,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:21:30,990 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:21:30,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 12:21:32,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:21:32,325 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:21:32,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 12:21:32,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5430651/6d4ef981f4d14fa38e0b8fd8ceffb33b/FLAGf831ebf99 [2024-05-12 12:21:32,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5430651/6d4ef981f4d14fa38e0b8fd8ceffb33b [2024-05-12 12:21:32,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:21:32,353 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:21:32,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:21:32,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:21:32,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:21:32,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:30" (1/2) ... [2024-05-12 12:21:32,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3e0c87 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:32, skipping insertion in model container [2024-05-12 12:21:32,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:30" (1/2) ... [2024-05-12 12:21:32,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@274f9a52 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:32, skipping insertion in model container [2024-05-12 12:21:32,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:21:32" (2/2) ... [2024-05-12 12:21:32,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3e0c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:32, skipping insertion in model container [2024-05-12 12:21:32,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:21:32" (2/2) ... [2024-05-12 12:21:32,366 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:21:32,473 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:21:32,474 INFO L97 edCorrectnessWitness]: Location invariant before [L822-L822] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 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 )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-05-12 12:21:32,474 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 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 )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-05-12 12:21:32,475 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 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 )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-05-12 12:21:32,475 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:21:32,475 INFO L106 edCorrectnessWitness]: ghost_update [L817-L817] multithreaded = 1; [2024-05-12 12:21:32,546 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:21:32,711 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-05-12 12:21:32,919 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:21:32,932 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:21:32,978 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:21:33,312 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:21:33,358 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:21:33,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33 WrapperNode [2024-05-12 12:21:33,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:21:33,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:21:33,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:21:33,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:21:33,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,530 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2024-05-12 12:21:33,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:21:33,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:21:33,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:21:33,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:21:33,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,638 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 12:21:33,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:21:33,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:21:33,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:21:33,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:21:33,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (1/1) ... [2024-05-12 12:21:33,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:21:33,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:21:33,783 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 12:21:33,811 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 12:21:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:21:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:21:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:21:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:21:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:21:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:21:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:21:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:21:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:21:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:21:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:21:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:21:33,830 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 12:21:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 12:21:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:21:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:21:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:21:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:21:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:21:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:21:33,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:21:33,833 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 12:21:33,991 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:21:33,994 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:21:35,199 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:21:35,199 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:21:35,496 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:21:35,496 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:21:35,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:21:35 BoogieIcfgContainer [2024-05-12 12:21:35,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:21:35,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:21:35,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:21:35,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:21:35,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:30" (1/4) ... [2024-05-12 12:21:35,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430c75f1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:21:35, skipping insertion in model container [2024-05-12 12:21:35,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:21:32" (2/4) ... [2024-05-12 12:21:35,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430c75f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:21:35, skipping insertion in model container [2024-05-12 12:21:35,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:33" (3/4) ... [2024-05-12 12:21:35,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430c75f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:21:35, skipping insertion in model container [2024-05-12 12:21:35,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:21:35" (4/4) ... [2024-05-12 12:21:35,507 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 12:21:35,523 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:21:35,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 12:21:35,523 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:21:35,625 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:21:35,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 12:21:35,727 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-05-12 12:21:35,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:21:35,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-05-12 12:21:35,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 12:21:35,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-05-12 12:21:35,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:21:35,762 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;@1d63e6f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:21:35,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 12:21:35,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:21:35,772 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:21:35,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:21:35,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:35,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:21:35,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:35,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:35,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1778363814, now seen corresponding path program 1 times [2024-05-12 12:21:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:35,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411013614] [2024-05-12 12:21:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:35,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:40,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:40,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411013614] [2024-05-12 12:21:40,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411013614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:40,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:21:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309528537] [2024-05-12 12:21:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:40,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:21:40,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:40,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:21:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:21:40,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:21:40,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:40,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:40,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:21:40,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:42,473 INFO L124 PetriNetUnfolderBase]: 5136/8109 cut-off events. [2024-05-12 12:21:42,473 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-05-12 12:21:42,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15562 conditions, 8109 events. 5136/8109 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 50488 event pairs, 4084 based on Foata normal form. 253/7747 useless extension candidates. Maximal degree in co-relation 15547. Up to 7333 conditions per place. [2024-05-12 12:21:42,526 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 46 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2024-05-12 12:21:42,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 235 flow [2024-05-12 12:21:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:21:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:21:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-05-12 12:21:42,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2024-05-12 12:21:42,539 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 89 transitions. [2024-05-12 12:21:42,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 235 flow [2024-05-12 12:21:42,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:42,544 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 129 flow [2024-05-12 12:21:42,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-05-12 12:21:42,549 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-05-12 12:21:42,550 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 129 flow [2024-05-12 12:21:42,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:42,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:42,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:21:42,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:21:42,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:42,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1778362930, now seen corresponding path program 1 times [2024-05-12 12:21:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:42,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170891406] [2024-05-12 12:21:42,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:42,598 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 12:21:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170891406] [2024-05-12 12:21:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170891406] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:42,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:21:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591931587] [2024-05-12 12:21:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:42,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:21:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:21:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:21:42,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-05-12 12:21:42,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:42,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:42,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-05-12 12:21:42,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:42,982 INFO L124 PetriNetUnfolderBase]: 822/1601 cut-off events. [2024-05-12 12:21:42,982 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2024-05-12 12:21:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1601 events. 822/1601 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10638 event pairs, 349 based on Foata normal form. 0/1511 useless extension candidates. Maximal degree in co-relation 3100. Up to 1051 conditions per place. [2024-05-12 12:21:42,991 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 37 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2024-05-12 12:21:42,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 236 flow [2024-05-12 12:21:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:21:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:21:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-05-12 12:21:42,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75177304964539 [2024-05-12 12:21:42,994 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 129 flow. Second operand 3 states and 106 transitions. [2024-05-12 12:21:42,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 236 flow [2024-05-12 12:21:42,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:42,996 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 122 flow [2024-05-12 12:21:42,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-05-12 12:21:42,997 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-05-12 12:21:42,997 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 122 flow [2024-05-12 12:21:42,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:42,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:42,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:42,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:21:42,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:42,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash 389384152, now seen corresponding path program 1 times [2024-05-12 12:21:42,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:42,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020615208] [2024-05-12 12:21:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:46,759 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 12:21:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020615208] [2024-05-12 12:21:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020615208] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:46,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:21:46,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813992578] [2024-05-12 12:21:46,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:46,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:21:46,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:46,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:21:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:21:46,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:21:46,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:46,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:46,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:21:46,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:48,124 INFO L124 PetriNetUnfolderBase]: 4364/6917 cut-off events. [2024-05-12 12:21:48,124 INFO L125 PetriNetUnfolderBase]: For 1566/1566 co-relation queries the response was YES. [2024-05-12 12:21:48,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14750 conditions, 6917 events. 4364/6917 cut-off events. For 1566/1566 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 42105 event pairs, 2959 based on Foata normal form. 3/6702 useless extension candidates. Maximal degree in co-relation 14734. Up to 6229 conditions per place. [2024-05-12 12:21:48,171 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 54 selfloop transitions, 8 changer transitions 2/72 dead transitions. [2024-05-12 12:21:48,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 324 flow [2024-05-12 12:21:48,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:21:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:21:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-05-12 12:21:48,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-05-12 12:21:48,178 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 122 flow. Second operand 4 states and 108 transitions. [2024-05-12 12:21:48,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 324 flow [2024-05-12 12:21:48,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:21:48,182 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 183 flow [2024-05-12 12:21:48,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-05-12 12:21:48,184 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-05-12 12:21:48,184 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 183 flow [2024-05-12 12:21:48,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:48,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:48,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:48,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:21:48,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:48,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash -813992285, now seen corresponding path program 1 times [2024-05-12 12:21:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:48,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835380166] [2024-05-12 12:21:48,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:48,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:51,463 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 12:21:51,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:51,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835380166] [2024-05-12 12:21:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835380166] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:51,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:21:51,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029928806] [2024-05-12 12:21:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:51,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:21:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:51,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:21:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:21:51,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:21:51,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:51,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:51,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:21:51,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:52,836 INFO L124 PetriNetUnfolderBase]: 3865/6227 cut-off events. [2024-05-12 12:21:52,837 INFO L125 PetriNetUnfolderBase]: For 2627/2627 co-relation queries the response was YES. [2024-05-12 12:21:52,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14306 conditions, 6227 events. 3865/6227 cut-off events. For 2627/2627 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 38141 event pairs, 2049 based on Foata normal form. 5/6011 useless extension candidates. Maximal degree in co-relation 14288. Up to 5430 conditions per place. [2024-05-12 12:21:52,878 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 71 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-05-12 12:21:52,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 97 transitions, 507 flow [2024-05-12 12:21:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:21:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:21:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-05-12 12:21:52,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5914893617021276 [2024-05-12 12:21:52,881 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 183 flow. Second operand 5 states and 139 transitions. [2024-05-12 12:21:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 97 transitions, 507 flow [2024-05-12 12:21:52,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 496 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:52,887 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 297 flow [2024-05-12 12:21:52,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2024-05-12 12:21:52,888 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-05-12 12:21:52,888 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 297 flow [2024-05-12 12:21:52,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:52,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:52,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:52,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:21:52,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:52,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1311801503, now seen corresponding path program 1 times [2024-05-12 12:21:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512240361] [2024-05-12 12:21:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:56,567 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 12:21:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512240361] [2024-05-12 12:21:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512240361] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:56,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:21:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887943702] [2024-05-12 12:21:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:56,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:21:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:56,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:21:56,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:21:56,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:21:56,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:56,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:56,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:21:56,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:58,231 INFO L124 PetriNetUnfolderBase]: 3893/6266 cut-off events. [2024-05-12 12:21:58,231 INFO L125 PetriNetUnfolderBase]: For 6404/6406 co-relation queries the response was YES. [2024-05-12 12:21:58,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16671 conditions, 6266 events. 3893/6266 cut-off events. For 6404/6406 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 38323 event pairs, 1736 based on Foata normal form. 7/6052 useless extension candidates. Maximal degree in co-relation 16649. Up to 5429 conditions per place. [2024-05-12 12:21:58,272 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 81 selfloop transitions, 23 changer transitions 0/112 dead transitions. [2024-05-12 12:21:58,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 669 flow [2024-05-12 12:21:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-05-12 12:21:58,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5851063829787234 [2024-05-12 12:21:58,281 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 297 flow. Second operand 6 states and 165 transitions. [2024-05-12 12:21:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 669 flow [2024-05-12 12:21:58,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 661 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 12:21:58,292 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 381 flow [2024-05-12 12:21:58,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2024-05-12 12:21:58,295 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-05-12 12:21:58,295 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 381 flow [2024-05-12 12:21:58,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:58,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:58,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:58,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:21:58,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:58,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2011141882, now seen corresponding path program 1 times [2024-05-12 12:21:58,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:58,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026925547] [2024-05-12 12:21:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:58,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:02,034 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 12:22:02,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:02,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026925547] [2024-05-12 12:22:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026925547] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:22:02,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603170478] [2024-05-12 12:22:02,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:02,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:22:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:02,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:22:02,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:22:02,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:22:02,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:02,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:02,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:22:02,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:03,403 INFO L124 PetriNetUnfolderBase]: 3938/6333 cut-off events. [2024-05-12 12:22:03,403 INFO L125 PetriNetUnfolderBase]: For 9629/9631 co-relation queries the response was YES. [2024-05-12 12:22:03,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18607 conditions, 6333 events. 3938/6333 cut-off events. For 9629/9631 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 38775 event pairs, 1376 based on Foata normal form. 12/6124 useless extension candidates. Maximal degree in co-relation 18582. Up to 5416 conditions per place. [2024-05-12 12:22:03,453 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 88 selfloop transitions, 27 changer transitions 0/123 dead transitions. [2024-05-12 12:22:03,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 123 transitions, 805 flow [2024-05-12 12:22:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-05-12 12:22:03,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683890577507599 [2024-05-12 12:22:03,455 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 381 flow. Second operand 7 states and 187 transitions. [2024-05-12 12:22:03,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 123 transitions, 805 flow [2024-05-12 12:22:03,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 751 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 12:22:03,463 INFO L231 Difference]: Finished difference. Result has 69 places, 71 transitions, 418 flow [2024-05-12 12:22:03,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=69, PETRI_TRANSITIONS=71} [2024-05-12 12:22:03,466 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-05-12 12:22:03,467 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 418 flow [2024-05-12 12:22:03,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:03,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:03,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:03,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:22:03,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:03,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash -942876428, now seen corresponding path program 1 times [2024-05-12 12:22:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589335396] [2024-05-12 12:22:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22: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 12:22:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589335396] [2024-05-12 12:22:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589335396] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:09,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:09,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:22:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807945665] [2024-05-12 12:22:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:09,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:22:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:22:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:22:10,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:22:10,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:10,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:10,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:22:10,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:11,730 INFO L124 PetriNetUnfolderBase]: 4484/7111 cut-off events. [2024-05-12 12:22:11,730 INFO L125 PetriNetUnfolderBase]: For 14243/14243 co-relation queries the response was YES. [2024-05-12 12:22:11,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22080 conditions, 7111 events. 4484/7111 cut-off events. For 14243/14243 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 42584 event pairs, 1984 based on Foata normal form. 2/6888 useless extension candidates. Maximal degree in co-relation 22054. Up to 6398 conditions per place. [2024-05-12 12:22:11,780 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 72 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2024-05-12 12:22:11,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 668 flow [2024-05-12 12:22:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:22:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:22:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-05-12 12:22:11,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765957446808511 [2024-05-12 12:22:11,782 INFO L175 Difference]: Start difference. First operand has 69 places, 71 transitions, 418 flow. Second operand 5 states and 112 transitions. [2024-05-12 12:22:11,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 668 flow [2024-05-12 12:22:11,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 595 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:11,792 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 417 flow [2024-05-12 12:22:11,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=69, PETRI_TRANSITIONS=74} [2024-05-12 12:22:11,793 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-05-12 12:22:11,793 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 417 flow [2024-05-12 12:22:11,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:11,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:11,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:11,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:22:11,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:11,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 835227971, now seen corresponding path program 1 times [2024-05-12 12:22:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105055020] [2024-05-12 12:22:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:19,069 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 12:22:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105055020] [2024-05-12 12:22:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105055020] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:19,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:19,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:22:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691402584] [2024-05-12 12:22:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:19,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:22:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:22:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:22:19,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:22:19,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 417 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 12:22:19,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:19,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:22:19,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:20,638 INFO L124 PetriNetUnfolderBase]: 4518/7152 cut-off events. [2024-05-12 12:22:20,638 INFO L125 PetriNetUnfolderBase]: For 17490/17490 co-relation queries the response was YES. [2024-05-12 12:22:20,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22753 conditions, 7152 events. 4518/7152 cut-off events. For 17490/17490 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 42604 event pairs, 1885 based on Foata normal form. 6/6935 useless extension candidates. Maximal degree in co-relation 22725. Up to 6306 conditions per place. [2024-05-12 12:22:20,688 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 91 selfloop transitions, 21 changer transitions 0/119 dead transitions. [2024-05-12 12:22:20,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 119 transitions, 835 flow [2024-05-12 12:22:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:22:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:22:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-05-12 12:22:20,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-05-12 12:22:20,690 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 417 flow. Second operand 6 states and 142 transitions. [2024-05-12 12:22:20,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 119 transitions, 835 flow [2024-05-12 12:22:20,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 805 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:20,701 INFO L231 Difference]: Finished difference. Result has 74 places, 85 transitions, 542 flow [2024-05-12 12:22:20,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=74, PETRI_TRANSITIONS=85} [2024-05-12 12:22:20,702 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2024-05-12 12:22:20,702 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 542 flow [2024-05-12 12:22:20,702 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 12:22:20,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:20,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:20,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:22:20,703 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:20,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash -216848624, now seen corresponding path program 1 times [2024-05-12 12:22:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631760192] [2024-05-12 12:22:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:25,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631760192] [2024-05-12 12:22:25,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631760192] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:25,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:25,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:22:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067085871] [2024-05-12 12:22:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:25,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:22:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:25,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:22:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:22:25,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:22:25,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 542 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 12:22:25,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:25,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:22:25,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:27,218 INFO L124 PetriNetUnfolderBase]: 4539/7191 cut-off events. [2024-05-12 12:22:27,218 INFO L125 PetriNetUnfolderBase]: For 24385/24391 co-relation queries the response was YES. [2024-05-12 12:22:27,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25001 conditions, 7191 events. 4539/7191 cut-off events. For 24385/24391 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 43192 event pairs, 1754 based on Foata normal form. 10/6975 useless extension candidates. Maximal degree in co-relation 24970. Up to 6348 conditions per place. [2024-05-12 12:22:27,265 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 92 selfloop transitions, 21 changer transitions 0/120 dead transitions. [2024-05-12 12:22:27,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 120 transitions, 908 flow [2024-05-12 12:22:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:22:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:22:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 12:22:27,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:22:27,267 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 542 flow. Second operand 6 states and 141 transitions. [2024-05-12 12:22:27,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 120 transitions, 908 flow [2024-05-12 12:22:27,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 894 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-05-12 12:22:27,282 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 604 flow [2024-05-12 12:22:27,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2024-05-12 12:22:27,284 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-05-12 12:22:27,284 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 604 flow [2024-05-12 12:22:27,284 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 12:22:27,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:27,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:27,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:22:27,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:27,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash 133873906, now seen corresponding path program 2 times [2024-05-12 12:22:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547642546] [2024-05-12 12:22:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:32,550 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 12:22:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547642546] [2024-05-12 12:22:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547642546] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:22:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323983957] [2024-05-12 12:22:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:32,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:22:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:32,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:22:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:22:32,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:22:32,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 604 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 12:22:32,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:32,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:22:32,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:34,346 INFO L124 PetriNetUnfolderBase]: 4524/7170 cut-off events. [2024-05-12 12:22:34,347 INFO L125 PetriNetUnfolderBase]: For 25791/25791 co-relation queries the response was YES. [2024-05-12 12:22:34,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25250 conditions, 7170 events. 4524/7170 cut-off events. For 25791/25791 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 42884 event pairs, 1959 based on Foata normal form. 2/6944 useless extension candidates. Maximal degree in co-relation 25216. Up to 6441 conditions per place. [2024-05-12 12:22:34,403 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 92 selfloop transitions, 13 changer transitions 0/112 dead transitions. [2024-05-12 12:22:34,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 878 flow [2024-05-12 12:22:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:22:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:22:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-05-12 12:22:34,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2024-05-12 12:22:34,405 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 604 flow. Second operand 6 states and 130 transitions. [2024-05-12 12:22:34,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 878 flow [2024-05-12 12:22:34,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 845 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:34,431 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 605 flow [2024-05-12 12:22:34,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2024-05-12 12:22:34,431 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2024-05-12 12:22:34,432 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 605 flow [2024-05-12 12:22:34,432 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 12:22:34,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:34,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:34,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:22:34,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:34,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1782850005, now seen corresponding path program 1 times [2024-05-12 12:22:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892981537] [2024-05-12 12:22:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:39,732 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 12:22:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892981537] [2024-05-12 12:22:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892981537] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:39,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:39,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204126811] [2024-05-12 12:22:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:39,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:39,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:39,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:22:39,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 605 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 12:22:39,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:39,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:22:39,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:41,411 INFO L124 PetriNetUnfolderBase]: 5026/7887 cut-off events. [2024-05-12 12:22:41,412 INFO L125 PetriNetUnfolderBase]: For 30583/30583 co-relation queries the response was YES. [2024-05-12 12:22:41,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27988 conditions, 7887 events. 5026/7887 cut-off events. For 30583/30583 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 47721 event pairs, 1570 based on Foata normal form. 12/7663 useless extension candidates. Maximal degree in co-relation 27953. Up to 6336 conditions per place. [2024-05-12 12:22:41,468 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 121 selfloop transitions, 34 changer transitions 0/162 dead transitions. [2024-05-12 12:22:41,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 162 transitions, 1331 flow [2024-05-12 12:22:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 12:22:41,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5349544072948328 [2024-05-12 12:22:41,470 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 605 flow. Second operand 7 states and 176 transitions. [2024-05-12 12:22:41,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 162 transitions, 1331 flow [2024-05-12 12:22:41,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 162 transitions, 1275 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:41,491 INFO L231 Difference]: Finished difference. Result has 86 places, 110 transitions, 842 flow [2024-05-12 12:22:41,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=842, PETRI_PLACES=86, PETRI_TRANSITIONS=110} [2024-05-12 12:22:41,491 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2024-05-12 12:22:41,492 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 110 transitions, 842 flow [2024-05-12 12:22:41,492 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 12:22:41,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:41,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:41,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:22:41,493 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:41,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1434115815, now seen corresponding path program 2 times [2024-05-12 12:22:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:41,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930286168] [2024-05-12 12:22:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:46,764 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 12:22:46,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930286168] [2024-05-12 12:22:46,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930286168] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:46,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:46,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684627225] [2024-05-12 12:22:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:46,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:46,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:22:46,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 110 transitions, 842 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 12:22:46,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:46,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:22:46,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:48,706 INFO L124 PetriNetUnfolderBase]: 5122/8073 cut-off events. [2024-05-12 12:22:48,707 INFO L125 PetriNetUnfolderBase]: For 42927/42927 co-relation queries the response was YES. [2024-05-12 12:22:48,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32969 conditions, 8073 events. 5122/8073 cut-off events. For 42927/42927 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 48940 event pairs, 1906 based on Foata normal form. 6/7823 useless extension candidates. Maximal degree in co-relation 32931. Up to 7165 conditions per place. [2024-05-12 12:22:48,839 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 120 selfloop transitions, 26 changer transitions 0/153 dead transitions. [2024-05-12 12:22:48,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 1367 flow [2024-05-12 12:22:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-05-12 12:22:48,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48024316109422494 [2024-05-12 12:22:48,841 INFO L175 Difference]: Start difference. First operand has 86 places, 110 transitions, 842 flow. Second operand 7 states and 158 transitions. [2024-05-12 12:22:48,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 1367 flow [2024-05-12 12:22:48,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 153 transitions, 1329 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-05-12 12:22:48,879 INFO L231 Difference]: Finished difference. Result has 95 places, 120 transitions, 1010 flow [2024-05-12 12:22:48,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1010, PETRI_PLACES=95, PETRI_TRANSITIONS=120} [2024-05-12 12:22:48,880 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2024-05-12 12:22:48,880 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 120 transitions, 1010 flow [2024-05-12 12:22:48,881 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 12:22:48,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:48,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:48,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:22:48,881 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:48,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2073359085, now seen corresponding path program 3 times [2024-05-12 12:22:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:48,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805686931] [2024-05-12 12:22:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:53,894 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 12:22:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805686931] [2024-05-12 12:22:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805686931] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370506110] [2024-05-12 12:22:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:53,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:53,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:22:53,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 120 transitions, 1010 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 12:22:53,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:53,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:22:53,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:55,890 INFO L124 PetriNetUnfolderBase]: 5156/8113 cut-off events. [2024-05-12 12:22:55,890 INFO L125 PetriNetUnfolderBase]: For 47536/47536 co-relation queries the response was YES. [2024-05-12 12:22:55,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33922 conditions, 8113 events. 5156/8113 cut-off events. For 47536/47536 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 49072 event pairs, 1908 based on Foata normal form. 6/7865 useless extension candidates. Maximal degree in co-relation 33878. Up to 7055 conditions per place. [2024-05-12 12:22:55,953 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 127 selfloop transitions, 32 changer transitions 0/166 dead transitions. [2024-05-12 12:22:55,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 166 transitions, 1590 flow [2024-05-12 12:22:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-05-12 12:22:55,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49544072948328266 [2024-05-12 12:22:55,955 INFO L175 Difference]: Start difference. First operand has 95 places, 120 transitions, 1010 flow. Second operand 7 states and 163 transitions. [2024-05-12 12:22:55,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 166 transitions, 1590 flow [2024-05-12 12:22:55,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 166 transitions, 1521 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:56,001 INFO L231 Difference]: Finished difference. Result has 100 places, 128 transitions, 1124 flow [2024-05-12 12:22:56,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1124, PETRI_PLACES=100, PETRI_TRANSITIONS=128} [2024-05-12 12:22:56,003 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 47 predicate places. [2024-05-12 12:22:56,003 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 128 transitions, 1124 flow [2024-05-12 12:22:56,003 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 12:22:56,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:56,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:56,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:22:56,004 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:56,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash -504772574, now seen corresponding path program 1 times [2024-05-12 12:22:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429491720] [2024-05-12 12:22:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:56,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:03,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429491720] [2024-05-12 12:23:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429491720] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070097599] [2024-05-12 12:23:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:03,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:23:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:03,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:23:03,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:23:03,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:03,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 128 transitions, 1124 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:03,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:03,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:03,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:05,245 INFO L124 PetriNetUnfolderBase]: 5184/8159 cut-off events. [2024-05-12 12:23:05,245 INFO L125 PetriNetUnfolderBase]: For 55484/55484 co-relation queries the response was YES. [2024-05-12 12:23:05,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35269 conditions, 8159 events. 5184/8159 cut-off events. For 55484/55484 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 49368 event pairs, 1840 based on Foata normal form. 6/7909 useless extension candidates. Maximal degree in co-relation 35223. Up to 7148 conditions per place. [2024-05-12 12:23:05,295 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 134 selfloop transitions, 33 changer transitions 0/174 dead transitions. [2024-05-12 12:23:05,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 174 transitions, 1678 flow [2024-05-12 12:23:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-05-12 12:23:05,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015197568389058 [2024-05-12 12:23:05,297 INFO L175 Difference]: Start difference. First operand has 100 places, 128 transitions, 1124 flow. Second operand 7 states and 165 transitions. [2024-05-12 12:23:05,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 174 transitions, 1678 flow [2024-05-12 12:23:05,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 174 transitions, 1622 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 12:23:05,335 INFO L231 Difference]: Finished difference. Result has 104 places, 131 transitions, 1186 flow [2024-05-12 12:23:05,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1186, PETRI_PLACES=104, PETRI_TRANSITIONS=131} [2024-05-12 12:23:05,336 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2024-05-12 12:23:05,336 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 131 transitions, 1186 flow [2024-05-12 12:23:05,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:05,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:05,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:23:05,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:05,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1599990548, now seen corresponding path program 1 times [2024-05-12 12:23:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508034755] [2024-05-12 12:23:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508034755] [2024-05-12 12:23:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508034755] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:23:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122443265] [2024-05-12 12:23:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:13,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:23:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:23:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:23:13,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:13,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 131 transitions, 1186 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 12:23:13,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:13,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:13,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:14,944 INFO L124 PetriNetUnfolderBase]: 5181/8172 cut-off events. [2024-05-12 12:23:14,944 INFO L125 PetriNetUnfolderBase]: For 59398/59398 co-relation queries the response was YES. [2024-05-12 12:23:14,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36102 conditions, 8172 events. 5181/8172 cut-off events. For 59398/59398 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 49719 event pairs, 1918 based on Foata normal form. 1/7911 useless extension candidates. Maximal degree in co-relation 36054. Up to 7354 conditions per place. [2024-05-12 12:23:14,995 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 126 selfloop transitions, 14 changer transitions 0/147 dead transitions. [2024-05-12 12:23:14,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 147 transitions, 1510 flow [2024-05-12 12:23:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:23:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:23:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-05-12 12:23:14,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595744680851064 [2024-05-12 12:23:14,996 INFO L175 Difference]: Start difference. First operand has 104 places, 131 transitions, 1186 flow. Second operand 5 states and 108 transitions. [2024-05-12 12:23:14,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 147 transitions, 1510 flow [2024-05-12 12:23:15,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 147 transitions, 1406 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:15,039 INFO L231 Difference]: Finished difference. Result has 104 places, 131 transitions, 1120 flow [2024-05-12 12:23:15,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1120, PETRI_PLACES=104, PETRI_TRANSITIONS=131} [2024-05-12 12:23:15,040 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2024-05-12 12:23:15,040 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 131 transitions, 1120 flow [2024-05-12 12:23:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 12:23:15,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:15,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:15,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:23:15,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:15,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash 562410449, now seen corresponding path program 1 times [2024-05-12 12:23:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34178322] [2024-05-12 12:23:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:20,132 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 12:23:20,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34178322] [2024-05-12 12:23:20,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34178322] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:20,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:20,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595595942] [2024-05-12 12:23:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:20,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:23:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:20,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:23:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:23:20,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:20,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 131 transitions, 1120 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:20,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:20,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:20,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:22,074 INFO L124 PetriNetUnfolderBase]: 5215/8209 cut-off events. [2024-05-12 12:23:22,074 INFO L125 PetriNetUnfolderBase]: For 61326/61334 co-relation queries the response was YES. [2024-05-12 12:23:22,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36151 conditions, 8209 events. 5215/8209 cut-off events. For 61326/61334 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 50217 event pairs, 1654 based on Foata normal form. 10/7961 useless extension candidates. Maximal degree in co-relation 36102. Up to 7194 conditions per place. [2024-05-12 12:23:22,123 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 143 selfloop transitions, 31 changer transitions 0/181 dead transitions. [2024-05-12 12:23:22,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 181 transitions, 1742 flow [2024-05-12 12:23:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-05-12 12:23:22,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045592705167173 [2024-05-12 12:23:22,125 INFO L175 Difference]: Start difference. First operand has 104 places, 131 transitions, 1120 flow. Second operand 7 states and 166 transitions. [2024-05-12 12:23:22,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 181 transitions, 1742 flow [2024-05-12 12:23:22,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 181 transitions, 1703 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:23:22,178 INFO L231 Difference]: Finished difference. Result has 108 places, 139 transitions, 1273 flow [2024-05-12 12:23:22,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1273, PETRI_PLACES=108, PETRI_TRANSITIONS=139} [2024-05-12 12:23:22,179 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 55 predicate places. [2024-05-12 12:23:22,179 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 139 transitions, 1273 flow [2024-05-12 12:23:22,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:22,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:22,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:22,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:23:22,180 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:22,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2058175473, now seen corresponding path program 2 times [2024-05-12 12:23:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783892387] [2024-05-12 12:23:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:27,654 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 12:23:27,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783892387] [2024-05-12 12:23:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783892387] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:27,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:27,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402022028] [2024-05-12 12:23:27,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:27,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:23:27,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:27,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:23:27,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:23:27,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:27,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 139 transitions, 1273 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:27,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:27,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:27,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:29,500 INFO L124 PetriNetUnfolderBase]: 5210/8205 cut-off events. [2024-05-12 12:23:29,500 INFO L125 PetriNetUnfolderBase]: For 69888/69896 co-relation queries the response was YES. [2024-05-12 12:23:29,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37918 conditions, 8205 events. 5210/8205 cut-off events. For 69888/69896 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50201 event pairs, 1663 based on Foata normal form. 10/7956 useless extension candidates. Maximal degree in co-relation 37868. Up to 7249 conditions per place. [2024-05-12 12:23:29,548 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 145 selfloop transitions, 25 changer transitions 0/177 dead transitions. [2024-05-12 12:23:29,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 177 transitions, 1735 flow [2024-05-12 12:23:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-05-12 12:23:29,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 12:23:29,551 INFO L175 Difference]: Start difference. First operand has 108 places, 139 transitions, 1273 flow. Second operand 7 states and 161 transitions. [2024-05-12 12:23:29,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 177 transitions, 1735 flow [2024-05-12 12:23:29,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 177 transitions, 1638 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-05-12 12:23:29,621 INFO L231 Difference]: Finished difference. Result has 112 places, 139 transitions, 1235 flow [2024-05-12 12:23:29,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1235, PETRI_PLACES=112, PETRI_TRANSITIONS=139} [2024-05-12 12:23:29,621 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 59 predicate places. [2024-05-12 12:23:29,621 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 139 transitions, 1235 flow [2024-05-12 12:23:29,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:29,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:29,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:29,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:23:29,622 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:29,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 566225464, now seen corresponding path program 1 times [2024-05-12 12:23:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032285399] [2024-05-12 12:23:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032285399] [2024-05-12 12:23:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032285399] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:34,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:34,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975643090] [2024-05-12 12:23:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:34,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:23:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:34,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:23:34,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:23:35,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:35,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 139 transitions, 1235 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:35,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:35,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:35,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:36,852 INFO L124 PetriNetUnfolderBase]: 5414/8463 cut-off events. [2024-05-12 12:23:36,852 INFO L125 PetriNetUnfolderBase]: For 76641/76643 co-relation queries the response was YES. [2024-05-12 12:23:36,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39681 conditions, 8463 events. 5414/8463 cut-off events. For 76641/76643 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 51384 event pairs, 1569 based on Foata normal form. 8/8221 useless extension candidates. Maximal degree in co-relation 39629. Up to 6617 conditions per place. [2024-05-12 12:23:36,915 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 138 selfloop transitions, 52 changer transitions 0/197 dead transitions. [2024-05-12 12:23:36,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 197 transitions, 2085 flow [2024-05-12 12:23:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-05-12 12:23:36,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-05-12 12:23:36,916 INFO L175 Difference]: Start difference. First operand has 112 places, 139 transitions, 1235 flow. Second operand 7 states and 175 transitions. [2024-05-12 12:23:36,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 197 transitions, 2085 flow [2024-05-12 12:23:36,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 197 transitions, 2021 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:36,968 INFO L231 Difference]: Finished difference. Result has 115 places, 148 transitions, 1457 flow [2024-05-12 12:23:36,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1457, PETRI_PLACES=115, PETRI_TRANSITIONS=148} [2024-05-12 12:23:36,969 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 62 predicate places. [2024-05-12 12:23:36,969 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 148 transitions, 1457 flow [2024-05-12 12:23:36,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:36,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:36,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:36,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:23:36,970 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:36,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash 566219884, now seen corresponding path program 2 times [2024-05-12 12:23:36,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:36,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775240201] [2024-05-12 12:23:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775240201] [2024-05-12 12:23:42,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775240201] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:42,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:42,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:42,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318982335] [2024-05-12 12:23:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:42,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:23:42,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:42,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:23:42,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:23:42,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:42,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 148 transitions, 1457 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:42,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:42,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:42,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:43,960 INFO L124 PetriNetUnfolderBase]: 5402/8459 cut-off events. [2024-05-12 12:23:43,960 INFO L125 PetriNetUnfolderBase]: For 88461/88463 co-relation queries the response was YES. [2024-05-12 12:23:43,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41840 conditions, 8459 events. 5402/8459 cut-off events. For 88461/88463 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 51499 event pairs, 1591 based on Foata normal form. 8/8213 useless extension candidates. Maximal degree in co-relation 41785. Up to 6611 conditions per place. [2024-05-12 12:23:44,029 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 139 selfloop transitions, 55 changer transitions 0/201 dead transitions. [2024-05-12 12:23:44,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 201 transitions, 2211 flow [2024-05-12 12:23:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-05-12 12:23:44,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2024-05-12 12:23:44,031 INFO L175 Difference]: Start difference. First operand has 115 places, 148 transitions, 1457 flow. Second operand 7 states and 178 transitions. [2024-05-12 12:23:44,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 201 transitions, 2211 flow [2024-05-12 12:23:44,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 201 transitions, 2102 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-05-12 12:23:44,146 INFO L231 Difference]: Finished difference. Result has 121 places, 151 transitions, 1565 flow [2024-05-12 12:23:44,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1565, PETRI_PLACES=121, PETRI_TRANSITIONS=151} [2024-05-12 12:23:44,147 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 68 predicate places. [2024-05-12 12:23:44,147 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 151 transitions, 1565 flow [2024-05-12 12:23:44,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:44,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:44,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:44,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:23:44,148 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:44,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash -187623439, now seen corresponding path program 1 times [2024-05-12 12:23:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721019672] [2024-05-12 12:23:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:49,588 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 12:23:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721019672] [2024-05-12 12:23:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721019672] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:49,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642919362] [2024-05-12 12:23:49,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:49,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:49,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:49,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:49,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 151 transitions, 1565 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 12:23:49,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:49,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:49,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:51,737 INFO L124 PetriNetUnfolderBase]: 5427/8514 cut-off events. [2024-05-12 12:23:51,737 INFO L125 PetriNetUnfolderBase]: For 93553/93553 co-relation queries the response was YES. [2024-05-12 12:23:51,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42979 conditions, 8514 events. 5427/8514 cut-off events. For 93553/93553 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 51878 event pairs, 1876 based on Foata normal form. 3/8254 useless extension candidates. Maximal degree in co-relation 42921. Up to 7526 conditions per place. [2024-05-12 12:23:51,797 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 152 selfloop transitions, 37 changer transitions 0/196 dead transitions. [2024-05-12 12:23:51,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 196 transitions, 2205 flow [2024-05-12 12:23:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 12:23:51,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 12:23:51,799 INFO L175 Difference]: Start difference. First operand has 121 places, 151 transitions, 1565 flow. Second operand 7 states and 159 transitions. [2024-05-12 12:23:51,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 196 transitions, 2205 flow [2024-05-12 12:23:51,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 196 transitions, 2100 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:51,879 INFO L231 Difference]: Finished difference. Result has 125 places, 164 transitions, 1736 flow [2024-05-12 12:23:51,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1736, PETRI_PLACES=125, PETRI_TRANSITIONS=164} [2024-05-12 12:23:51,879 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 72 predicate places. [2024-05-12 12:23:51,879 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 164 transitions, 1736 flow [2024-05-12 12:23:51,880 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 12:23:51,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:51,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:51,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:23:51,880 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:51,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -142131654, now seen corresponding path program 3 times [2024-05-12 12:23:51,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:51,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314165781] [2024-05-12 12:23:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:56,968 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 12:23:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314165781] [2024-05-12 12:23:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314165781] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:56,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339916908] [2024-05-12 12:23:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:56,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:23:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:23:56,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:23:57,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:23:57,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 164 transitions, 1736 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:57,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:57,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:23:57,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:58,969 INFO L124 PetriNetUnfolderBase]: 5461/8285 cut-off events. [2024-05-12 12:23:58,969 INFO L125 PetriNetUnfolderBase]: For 100759/100769 co-relation queries the response was YES. [2024-05-12 12:23:59,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43911 conditions, 8285 events. 5461/8285 cut-off events. For 100759/100769 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 48533 event pairs, 1890 based on Foata normal form. 16/8131 useless extension candidates. Maximal degree in co-relation 43851. Up to 7549 conditions per place. [2024-05-12 12:23:59,048 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 169 selfloop transitions, 28 changer transitions 0/204 dead transitions. [2024-05-12 12:23:59,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 204 transitions, 2355 flow [2024-05-12 12:23:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-05-12 12:23:59,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 12:23:59,050 INFO L175 Difference]: Start difference. First operand has 125 places, 164 transitions, 1736 flow. Second operand 7 states and 161 transitions. [2024-05-12 12:23:59,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 204 transitions, 2355 flow [2024-05-12 12:23:59,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 204 transitions, 2269 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-05-12 12:23:59,162 INFO L231 Difference]: Finished difference. Result has 129 places, 168 transitions, 1788 flow [2024-05-12 12:23:59,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1788, PETRI_PLACES=129, PETRI_TRANSITIONS=168} [2024-05-12 12:23:59,163 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 76 predicate places. [2024-05-12 12:23:59,163 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 168 transitions, 1788 flow [2024-05-12 12:23:59,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:59,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:59,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:59,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:23:59,164 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:59,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1939898671, now seen corresponding path program 1 times [2024-05-12 12:23:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815192616] [2024-05-12 12:23:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:07,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 12:24:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815192616] [2024-05-12 12:24:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815192616] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:24:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591477711] [2024-05-12 12:24:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:07,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:24:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:24:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:24:07,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:24:07,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 168 transitions, 1788 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:07,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:07,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:24:07,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:09,155 INFO L124 PetriNetUnfolderBase]: 5455/8569 cut-off events. [2024-05-12 12:24:09,155 INFO L125 PetriNetUnfolderBase]: For 106653/106653 co-relation queries the response was YES. [2024-05-12 12:24:09,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44537 conditions, 8569 events. 5455/8569 cut-off events. For 106653/106653 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 52136 event pairs, 1906 based on Foata normal form. 2/8302 useless extension candidates. Maximal degree in co-relation 44476. Up to 7718 conditions per place. [2024-05-12 12:24:09,233 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 170 selfloop transitions, 20 changer transitions 0/197 dead transitions. [2024-05-12 12:24:09,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 197 transitions, 2334 flow [2024-05-12 12:24:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:24:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:24:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-05-12 12:24:09,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4432624113475177 [2024-05-12 12:24:09,235 INFO L175 Difference]: Start difference. First operand has 129 places, 168 transitions, 1788 flow. Second operand 6 states and 125 transitions. [2024-05-12 12:24:09,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 197 transitions, 2334 flow [2024-05-12 12:24:09,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 197 transitions, 2249 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 12:24:09,353 INFO L231 Difference]: Finished difference. Result has 132 places, 180 transitions, 1906 flow [2024-05-12 12:24:09,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1906, PETRI_PLACES=132, PETRI_TRANSITIONS=180} [2024-05-12 12:24:09,354 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 79 predicate places. [2024-05-12 12:24:09,354 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 180 transitions, 1906 flow [2024-05-12 12:24:09,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:09,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:09,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:09,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:24:09,355 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:09,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash -623925904, now seen corresponding path program 1 times [2024-05-12 12:24:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:09,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939819504] [2024-05-12 12:24:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:15,451 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 12:24:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:15,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939819504] [2024-05-12 12:24:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939819504] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:15,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90161466] [2024-05-12 12:24:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:15,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:24:15,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 180 transitions, 1906 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:15,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:15,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:24:15,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:17,590 INFO L124 PetriNetUnfolderBase]: 5510/8376 cut-off events. [2024-05-12 12:24:17,590 INFO L125 PetriNetUnfolderBase]: For 114825/114835 co-relation queries the response was YES. [2024-05-12 12:24:17,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45813 conditions, 8376 events. 5510/8376 cut-off events. For 114825/114835 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 49509 event pairs, 1108 based on Foata normal form. 14/8213 useless extension candidates. Maximal degree in co-relation 45749. Up to 7424 conditions per place. [2024-05-12 12:24:17,660 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 191 selfloop transitions, 40 changer transitions 0/238 dead transitions. [2024-05-12 12:24:17,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 238 transitions, 2746 flow [2024-05-12 12:24:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:24:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:24:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-05-12 12:24:17,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026595744680851 [2024-05-12 12:24:17,662 INFO L175 Difference]: Start difference. First operand has 132 places, 180 transitions, 1906 flow. Second operand 8 states and 189 transitions. [2024-05-12 12:24:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 238 transitions, 2746 flow [2024-05-12 12:24:17,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 238 transitions, 2694 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-05-12 12:24:17,769 INFO L231 Difference]: Finished difference. Result has 140 places, 186 transitions, 2088 flow [2024-05-12 12:24:17,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2088, PETRI_PLACES=140, PETRI_TRANSITIONS=186} [2024-05-12 12:24:17,770 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2024-05-12 12:24:17,770 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 186 transitions, 2088 flow [2024-05-12 12:24:17,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:17,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:17,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:17,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:24:17,770 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:17,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1181223016, now seen corresponding path program 1 times [2024-05-12 12:24:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:17,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488124438] [2024-05-12 12:24:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:23,864 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 12:24:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488124438] [2024-05-12 12:24:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488124438] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592204200] [2024-05-12 12:24:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:23,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:24,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:24:24,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 186 transitions, 2088 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:24,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:24,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:24:24,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:26,364 INFO L124 PetriNetUnfolderBase]: 5761/8658 cut-off events. [2024-05-12 12:24:26,364 INFO L125 PetriNetUnfolderBase]: For 133239/133241 co-relation queries the response was YES. [2024-05-12 12:24:26,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49437 conditions, 8658 events. 5761/8658 cut-off events. For 133239/133241 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 50701 event pairs, 1282 based on Foata normal form. 8/8511 useless extension candidates. Maximal degree in co-relation 49369. Up to 6571 conditions per place. [2024-05-12 12:24:26,438 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 196 selfloop transitions, 78 changer transitions 0/281 dead transitions. [2024-05-12 12:24:26,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 281 transitions, 3436 flow [2024-05-12 12:24:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2024-05-12 12:24:26,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446808510638298 [2024-05-12 12:24:26,441 INFO L175 Difference]: Start difference. First operand has 140 places, 186 transitions, 2088 flow. Second operand 10 states and 256 transitions. [2024-05-12 12:24:26,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 281 transitions, 3436 flow [2024-05-12 12:24:26,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 281 transitions, 3319 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-05-12 12:24:26,603 INFO L231 Difference]: Finished difference. Result has 148 places, 201 transitions, 2381 flow [2024-05-12 12:24:26,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2381, PETRI_PLACES=148, PETRI_TRANSITIONS=201} [2024-05-12 12:24:26,604 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 95 predicate places. [2024-05-12 12:24:26,604 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 201 transitions, 2381 flow [2024-05-12 12:24:26,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:26,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:26,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:26,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:24:26,605 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:26,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 254855568, now seen corresponding path program 2 times [2024-05-12 12:24:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:26,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748948557] [2024-05-12 12:24:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:32,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748948557] [2024-05-12 12:24:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748948557] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:32,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79005221] [2024-05-12 12:24:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:32,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:32,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:24:32,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 201 transitions, 2381 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:32,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:32,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:24:32,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:34,794 INFO L124 PetriNetUnfolderBase]: 5753/8692 cut-off events. [2024-05-12 12:24:34,795 INFO L125 PetriNetUnfolderBase]: For 154452/154462 co-relation queries the response was YES. [2024-05-12 12:24:34,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52721 conditions, 8692 events. 5753/8692 cut-off events. For 154452/154462 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 51244 event pairs, 1416 based on Foata normal form. 14/8534 useless extension candidates. Maximal degree in co-relation 52649. Up to 7891 conditions per place. [2024-05-12 12:24:34,859 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 215 selfloop transitions, 37 changer transitions 0/259 dead transitions. [2024-05-12 12:24:34,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 259 transitions, 3109 flow [2024-05-12 12:24:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-05-12 12:24:34,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940898345153664 [2024-05-12 12:24:34,861 INFO L175 Difference]: Start difference. First operand has 148 places, 201 transitions, 2381 flow. Second operand 9 states and 209 transitions. [2024-05-12 12:24:34,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 259 transitions, 3109 flow [2024-05-12 12:24:35,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 259 transitions, 2905 flow, removed 67 selfloop flow, removed 5 redundant places. [2024-05-12 12:24:35,064 INFO L231 Difference]: Finished difference. Result has 152 places, 201 transitions, 2260 flow [2024-05-12 12:24:35,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2260, PETRI_PLACES=152, PETRI_TRANSITIONS=201} [2024-05-12 12:24:35,064 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 99 predicate places. [2024-05-12 12:24:35,064 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 201 transitions, 2260 flow [2024-05-12 12:24:35,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:35,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:35,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:35,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:24:35,065 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:35,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash 372943372, now seen corresponding path program 2 times [2024-05-12 12:24:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:35,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015418647] [2024-05-12 12:24:35,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:40,921 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 12:24:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015418647] [2024-05-12 12:24:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015418647] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:40,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640753570] [2024-05-12 12:24:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:40,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:40,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:41,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:24:41,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 201 transitions, 2260 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:41,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:41,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:24:41,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:43,199 INFO L124 PetriNetUnfolderBase]: 5849/8787 cut-off events. [2024-05-12 12:24:43,199 INFO L125 PetriNetUnfolderBase]: For 155837/155839 co-relation queries the response was YES. [2024-05-12 12:24:43,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53010 conditions, 8787 events. 5849/8787 cut-off events. For 155837/155839 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 51548 event pairs, 1297 based on Foata normal form. 8/8637 useless extension candidates. Maximal degree in co-relation 52936. Up to 6863 conditions per place. [2024-05-12 12:24:43,284 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 192 selfloop transitions, 70 changer transitions 0/269 dead transitions. [2024-05-12 12:24:43,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 269 transitions, 3386 flow [2024-05-12 12:24:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:24:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:24:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-05-12 12:24:43,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 12:24:43,285 INFO L175 Difference]: Start difference. First operand has 152 places, 201 transitions, 2260 flow. Second operand 8 states and 208 transitions. [2024-05-12 12:24:43,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 269 transitions, 3386 flow [2024-05-12 12:24:43,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 269 transitions, 3301 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-05-12 12:24:43,465 INFO L231 Difference]: Finished difference. Result has 153 places, 207 transitions, 2446 flow [2024-05-12 12:24:43,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2446, PETRI_PLACES=153, PETRI_TRANSITIONS=207} [2024-05-12 12:24:43,465 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 100 predicate places. [2024-05-12 12:24:43,465 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 207 transitions, 2446 flow [2024-05-12 12:24:43,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:43,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:43,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:43,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:24:43,466 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:43,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1513872994, now seen corresponding path program 3 times [2024-05-12 12:24:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:43,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710950975] [2024-05-12 12:24:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:49,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 12:24:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710950975] [2024-05-12 12:24:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710950975] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559059488] [2024-05-12 12:24:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:49,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:49,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:49,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:49,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:24:49,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 207 transitions, 2446 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:49,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:49,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:24:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:51,752 INFO L124 PetriNetUnfolderBase]: 5945/8943 cut-off events. [2024-05-12 12:24:51,753 INFO L125 PetriNetUnfolderBase]: For 173169/173171 co-relation queries the response was YES. [2024-05-12 12:24:51,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55742 conditions, 8943 events. 5945/8943 cut-off events. For 173169/173171 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 52737 event pairs, 1310 based on Foata normal form. 8/8785 useless extension candidates. Maximal degree in co-relation 55666. Up to 7267 conditions per place. [2024-05-12 12:24:51,848 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 199 selfloop transitions, 63 changer transitions 0/269 dead transitions. [2024-05-12 12:24:51,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 269 transitions, 3450 flow [2024-05-12 12:24:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:24:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:24:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 12:24:51,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345744680851063 [2024-05-12 12:24:51,849 INFO L175 Difference]: Start difference. First operand has 153 places, 207 transitions, 2446 flow. Second operand 8 states and 201 transitions. [2024-05-12 12:24:51,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 269 transitions, 3450 flow [2024-05-12 12:24:52,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 269 transitions, 3244 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-05-12 12:24:52,062 INFO L231 Difference]: Finished difference. Result has 155 places, 212 transitions, 2478 flow [2024-05-12 12:24:52,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2478, PETRI_PLACES=155, PETRI_TRANSITIONS=212} [2024-05-12 12:24:52,063 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 102 predicate places. [2024-05-12 12:24:52,063 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 212 transitions, 2478 flow [2024-05-12 12:24:52,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:52,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:52,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:52,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:24:52,064 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:52,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 373121002, now seen corresponding path program 4 times [2024-05-12 12:24:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014117702] [2024-05-12 12:24:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:57,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:57,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014117702] [2024-05-12 12:24:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014117702] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:57,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:57,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362395203] [2024-05-12 12:24:57,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:57,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:57,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:24:57,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 212 transitions, 2478 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:24:57,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:57,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:24:57,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:00,082 INFO L124 PetriNetUnfolderBase]: 6041/9076 cut-off events. [2024-05-12 12:25:00,083 INFO L125 PetriNetUnfolderBase]: For 183284/183294 co-relation queries the response was YES. [2024-05-12 12:25:00,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56770 conditions, 9076 events. 6041/9076 cut-off events. For 183284/183294 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 53531 event pairs, 1288 based on Foata normal form. 16/8924 useless extension candidates. Maximal degree in co-relation 56693. Up to 7399 conditions per place. [2024-05-12 12:25:00,162 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 205 selfloop transitions, 64 changer transitions 0/276 dead transitions. [2024-05-12 12:25:00,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 276 transitions, 3456 flow [2024-05-12 12:25:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:25:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:25:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-05-12 12:25:00,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130023640661938 [2024-05-12 12:25:00,164 INFO L175 Difference]: Start difference. First operand has 155 places, 212 transitions, 2478 flow. Second operand 9 states and 217 transitions. [2024-05-12 12:25:00,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 276 transitions, 3456 flow [2024-05-12 12:25:00,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 276 transitions, 3278 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:00,378 INFO L231 Difference]: Finished difference. Result has 158 places, 217 transitions, 2542 flow [2024-05-12 12:25:00,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2542, PETRI_PLACES=158, PETRI_TRANSITIONS=217} [2024-05-12 12:25:00,378 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 105 predicate places. [2024-05-12 12:25:00,379 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 217 transitions, 2542 flow [2024-05-12 12:25:00,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:25:00,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:00,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:00,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:25:00,379 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:00,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 373127946, now seen corresponding path program 1 times [2024-05-12 12:25:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717949589] [2024-05-12 12:25:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:06,366 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 12:25:06,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:06,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717949589] [2024-05-12 12:25:06,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717949589] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:06,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:06,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:25:06,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105997439] [2024-05-12 12:25:06,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:06,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:25:06,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:06,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:25:06,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:25:06,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:25:06,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 217 transitions, 2542 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 12:25:06,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:06,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:25:06,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:08,872 INFO L124 PetriNetUnfolderBase]: 6197/9345 cut-off events. [2024-05-12 12:25:08,872 INFO L125 PetriNetUnfolderBase]: For 200904/200906 co-relation queries the response was YES. [2024-05-12 12:25:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58691 conditions, 9345 events. 6197/9345 cut-off events. For 200904/200906 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 55670 event pairs, 1329 based on Foata normal form. 14/9179 useless extension candidates. Maximal degree in co-relation 58613. Up to 7575 conditions per place. [2024-05-12 12:25:08,955 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 211 selfloop transitions, 58 changer transitions 0/276 dead transitions. [2024-05-12 12:25:08,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 276 transitions, 3570 flow [2024-05-12 12:25:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:25:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:25:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-05-12 12:25:08,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292553191489362 [2024-05-12 12:25:08,958 INFO L175 Difference]: Start difference. First operand has 158 places, 217 transitions, 2542 flow. Second operand 8 states and 199 transitions. [2024-05-12 12:25:08,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 276 transitions, 3570 flow [2024-05-12 12:25:09,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 276 transitions, 3384 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:09,184 INFO L231 Difference]: Finished difference. Result has 160 places, 221 transitions, 2567 flow [2024-05-12 12:25:09,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2356, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2567, PETRI_PLACES=160, PETRI_TRANSITIONS=221} [2024-05-12 12:25:09,185 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 107 predicate places. [2024-05-12 12:25:09,185 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 221 transitions, 2567 flow [2024-05-12 12:25:09,186 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 12:25:09,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:09,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:09,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:25:09,186 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:09,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1107349392, now seen corresponding path program 1 times [2024-05-12 12:25:09,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:09,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328582322] [2024-05-12 12:25:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:09,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:25:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328582322] [2024-05-12 12:25:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328582322] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:15,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:25:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40020130] [2024-05-12 12:25:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:15,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:25:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:15,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:25:15,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:25:15,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:25:15,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 221 transitions, 2567 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:15,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:15,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:25:15,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:17,393 INFO L124 PetriNetUnfolderBase]: 6217/9414 cut-off events. [2024-05-12 12:25:17,393 INFO L125 PetriNetUnfolderBase]: For 204446/204446 co-relation queries the response was YES. [2024-05-12 12:25:17,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59785 conditions, 9414 events. 6217/9414 cut-off events. For 204446/204446 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 56315 event pairs, 1505 based on Foata normal form. 1/9219 useless extension candidates. Maximal degree in co-relation 59706. Up to 8756 conditions per place. [2024-05-12 12:25:17,482 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 227 selfloop transitions, 18 changer transitions 0/252 dead transitions. [2024-05-12 12:25:17,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 252 transitions, 3291 flow [2024-05-12 12:25:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:25:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:25:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-05-12 12:25:17,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2024-05-12 12:25:17,483 INFO L175 Difference]: Start difference. First operand has 160 places, 221 transitions, 2567 flow. Second operand 6 states and 134 transitions. [2024-05-12 12:25:17,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 252 transitions, 3291 flow [2024-05-12 12:25:17,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 252 transitions, 3108 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:17,748 INFO L231 Difference]: Finished difference. Result has 160 places, 224 transitions, 2480 flow [2024-05-12 12:25:17,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2480, PETRI_PLACES=160, PETRI_TRANSITIONS=224} [2024-05-12 12:25:17,749 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 107 predicate places. [2024-05-12 12:25:17,749 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 224 transitions, 2480 flow [2024-05-12 12:25:17,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:17,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:17,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:17,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:25:17,750 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:17,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash 235389152, now seen corresponding path program 2 times [2024-05-12 12:25:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:17,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518916780] [2024-05-12 12:25:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:23,267 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 12:25:23,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:23,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518916780] [2024-05-12 12:25:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518916780] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:25:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271668579] [2024-05-12 12:25:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:23,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:25:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:25:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:25:23,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:25:23,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 224 transitions, 2480 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:25:23,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:23,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:25:23,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:25,732 INFO L124 PetriNetUnfolderBase]: 6295/9654 cut-off events. [2024-05-12 12:25:25,733 INFO L125 PetriNetUnfolderBase]: For 207880/207880 co-relation queries the response was YES. [2024-05-12 12:25:25,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59258 conditions, 9654 events. 6295/9654 cut-off events. For 207880/207880 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 58614 event pairs, 1866 based on Foata normal form. 6/9422 useless extension candidates. Maximal degree in co-relation 59178. Up to 8736 conditions per place. [2024-05-12 12:25:25,818 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 233 selfloop transitions, 29 changer transitions 0/269 dead transitions. [2024-05-12 12:25:25,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 269 transitions, 3298 flow [2024-05-12 12:25:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:25:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:25:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-05-12 12:25:25,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-05-12 12:25:25,819 INFO L175 Difference]: Start difference. First operand has 160 places, 224 transitions, 2480 flow. Second operand 8 states and 180 transitions. [2024-05-12 12:25:25,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 269 transitions, 3298 flow [2024-05-12 12:25:26,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 269 transitions, 3151 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:26,106 INFO L231 Difference]: Finished difference. Result has 162 places, 227 transitions, 2483 flow [2024-05-12 12:25:26,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2483, PETRI_PLACES=162, PETRI_TRANSITIONS=227} [2024-05-12 12:25:26,107 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 109 predicate places. [2024-05-12 12:25:26,107 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 227 transitions, 2483 flow [2024-05-12 12:25:26,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:25:26,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:26,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:26,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:25:26,107 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:26,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash 235619792, now seen corresponding path program 3 times [2024-05-12 12:25:26,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:26,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219904930] [2024-05-12 12:25:26,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:31,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 12:25:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:31,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219904930] [2024-05-12 12:25:31,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219904930] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:31,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:31,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:25:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434220160] [2024-05-12 12:25:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:31,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:25:31,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:25:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:25:31,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:25:31,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 227 transitions, 2483 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 12:25:31,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:31,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:25:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:34,266 INFO L124 PetriNetUnfolderBase]: 6373/9768 cut-off events. [2024-05-12 12:25:34,266 INFO L125 PetriNetUnfolderBase]: For 221913/221913 co-relation queries the response was YES. [2024-05-12 12:25:34,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60874 conditions, 9768 events. 6373/9768 cut-off events. For 221913/221913 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 59293 event pairs, 1869 based on Foata normal form. 6/9536 useless extension candidates. Maximal degree in co-relation 60794. Up to 8723 conditions per place. [2024-05-12 12:25:34,342 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 222 selfloop transitions, 43 changer transitions 0/272 dead transitions. [2024-05-12 12:25:34,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 272 transitions, 3315 flow [2024-05-12 12:25:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:25:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:25:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-05-12 12:25:34,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48404255319148937 [2024-05-12 12:25:34,344 INFO L175 Difference]: Start difference. First operand has 162 places, 227 transitions, 2483 flow. Second operand 8 states and 182 transitions. [2024-05-12 12:25:34,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 272 transitions, 3315 flow [2024-05-12 12:25:34,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 272 transitions, 3195 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:34,572 INFO L231 Difference]: Finished difference. Result has 164 places, 230 transitions, 2551 flow [2024-05-12 12:25:34,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2363, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2551, PETRI_PLACES=164, PETRI_TRANSITIONS=230} [2024-05-12 12:25:34,573 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 111 predicate places. [2024-05-12 12:25:34,573 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 230 transitions, 2551 flow [2024-05-12 12:25:34,573 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 12:25:34,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:34,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:34,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:25:34,574 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:34,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 235382208, now seen corresponding path program 5 times [2024-05-12 12:25:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:34,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765112105] [2024-05-12 12:25:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:40,025 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 12:25:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765112105] [2024-05-12 12:25:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765112105] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:40,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:40,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:25:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686809964] [2024-05-12 12:25:40,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:40,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:25:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:40,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:25:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:25:40,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:25:40,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 230 transitions, 2551 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:25:40,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:40,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:25:40,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:42,712 INFO L124 PetriNetUnfolderBase]: 6744/10291 cut-off events. [2024-05-12 12:25:42,712 INFO L125 PetriNetUnfolderBase]: For 245860/245870 co-relation queries the response was YES. [2024-05-12 12:25:42,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64427 conditions, 10291 events. 6744/10291 cut-off events. For 245860/245870 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 62658 event pairs, 1874 based on Foata normal form. 23/10068 useless extension candidates. Maximal degree in co-relation 64346. Up to 8735 conditions per place. [2024-05-12 12:25:42,801 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 262 selfloop transitions, 68 changer transitions 0/337 dead transitions. [2024-05-12 12:25:42,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 337 transitions, 4488 flow [2024-05-12 12:25:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:25:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:25:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-05-12 12:25:42,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-05-12 12:25:42,803 INFO L175 Difference]: Start difference. First operand has 164 places, 230 transitions, 2551 flow. Second operand 8 states and 200 transitions. [2024-05-12 12:25:42,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 337 transitions, 4488 flow [2024-05-12 12:25:43,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 337 transitions, 4296 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:43,083 INFO L231 Difference]: Finished difference. Result has 170 places, 276 transitions, 3360 flow [2024-05-12 12:25:43,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2397, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3360, PETRI_PLACES=170, PETRI_TRANSITIONS=276} [2024-05-12 12:25:43,083 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 117 predicate places. [2024-05-12 12:25:43,083 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 276 transitions, 3360 flow [2024-05-12 12:25:43,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:25:43,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:43,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:43,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:25:43,084 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:43,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1521032794, now seen corresponding path program 4 times [2024-05-12 12:25:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685428846] [2024-05-12 12:25:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:25:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685428846] [2024-05-12 12:25:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685428846] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:25:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885479074] [2024-05-12 12:25:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:48,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:25:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:48,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:25:48,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:25:48,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:25:48,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 276 transitions, 3360 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 12:25:48,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:48,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:25:48,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:51,151 INFO L124 PetriNetUnfolderBase]: 6848/10663 cut-off events. [2024-05-12 12:25:51,151 INFO L125 PetriNetUnfolderBase]: For 252975/252975 co-relation queries the response was YES. [2024-05-12 12:25:51,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68197 conditions, 10663 events. 6848/10663 cut-off events. For 252975/252975 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 66626 event pairs, 1861 based on Foata normal form. 6/10349 useless extension candidates. Maximal degree in co-relation 68111. Up to 9386 conditions per place. [2024-05-12 12:25:51,257 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 266 selfloop transitions, 58 changer transitions 0/331 dead transitions. [2024-05-12 12:25:51,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 331 transitions, 4402 flow [2024-05-12 12:25:51,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:25:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:25:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-05-12 12:25:51,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2024-05-12 12:25:51,258 INFO L175 Difference]: Start difference. First operand has 170 places, 276 transitions, 3360 flow. Second operand 8 states and 187 transitions. [2024-05-12 12:25:51,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 331 transitions, 4402 flow [2024-05-12 12:25:51,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 331 transitions, 4184 flow, removed 108 selfloop flow, removed 1 redundant places. [2024-05-12 12:25:51,793 INFO L231 Difference]: Finished difference. Result has 178 places, 284 transitions, 3454 flow [2024-05-12 12:25:51,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3164, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3454, PETRI_PLACES=178, PETRI_TRANSITIONS=284} [2024-05-12 12:25:51,793 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 125 predicate places. [2024-05-12 12:25:51,794 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 284 transitions, 3454 flow [2024-05-12 12:25:51,794 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 12:25:51,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:51,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:51,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:25:51,794 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:51,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 244556844, now seen corresponding path program 1 times [2024-05-12 12:25:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642192360] [2024-05-12 12:25:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:57,537 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 12:25:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642192360] [2024-05-12 12:25:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642192360] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:57,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:57,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:25:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665146140] [2024-05-12 12:25:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:57,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:25:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:25:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:25:57,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:25:57,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 284 transitions, 3454 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:25:57,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:57,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:25:57,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:00,316 INFO L124 PetriNetUnfolderBase]: 6855/10485 cut-off events. [2024-05-12 12:26:00,316 INFO L125 PetriNetUnfolderBase]: For 259827/259837 co-relation queries the response was YES. [2024-05-12 12:26:00,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68471 conditions, 10485 events. 6855/10485 cut-off events. For 259827/259837 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 64351 event pairs, 1907 based on Foata normal form. 13/10242 useless extension candidates. Maximal degree in co-relation 68381. Up to 9396 conditions per place. [2024-05-12 12:26:00,428 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 265 selfloop transitions, 55 changer transitions 0/327 dead transitions. [2024-05-12 12:26:00,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 327 transitions, 4454 flow [2024-05-12 12:26:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:26:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:26:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-05-12 12:26:00,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49544072948328266 [2024-05-12 12:26:00,429 INFO L175 Difference]: Start difference. First operand has 178 places, 284 transitions, 3454 flow. Second operand 7 states and 163 transitions. [2024-05-12 12:26:00,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 327 transitions, 4454 flow [2024-05-12 12:26:00,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 327 transitions, 4238 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-05-12 12:26:00,845 INFO L231 Difference]: Finished difference. Result has 180 places, 291 transitions, 3544 flow [2024-05-12 12:26:00,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3238, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3544, PETRI_PLACES=180, PETRI_TRANSITIONS=291} [2024-05-12 12:26:00,846 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 127 predicate places. [2024-05-12 12:26:00,846 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 291 transitions, 3544 flow [2024-05-12 12:26:00,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 12:26:00,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:00,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:26:00,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:26:00,846 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:00,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1786133014, now seen corresponding path program 5 times [2024-05-12 12:26:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753625315] [2024-05-12 12:26:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:26:06,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:06,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753625315] [2024-05-12 12:26:06,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753625315] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:06,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:06,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:26:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502150122] [2024-05-12 12:26:06,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:06,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:26:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:26:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:26:06,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:26:06,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 291 transitions, 3544 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 12:26:06,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:06,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:26:06,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:09,349 INFO L124 PetriNetUnfolderBase]: 6896/10521 cut-off events. [2024-05-12 12:26:09,349 INFO L125 PetriNetUnfolderBase]: For 269761/269761 co-relation queries the response was YES. [2024-05-12 12:26:09,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69476 conditions, 10521 events. 6896/10521 cut-off events. For 269761/269761 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 64242 event pairs, 1932 based on Foata normal form. 6/10277 useless extension candidates. Maximal degree in co-relation 69385. Up to 9411 conditions per place. [2024-05-12 12:26:09,458 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 298 selfloop transitions, 37 changer transitions 0/342 dead transitions. [2024-05-12 12:26:09,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 342 transitions, 4673 flow [2024-05-12 12:26:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:26:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:26:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-05-12 12:26:09,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2024-05-12 12:26:09,460 INFO L175 Difference]: Start difference. First operand has 180 places, 291 transitions, 3544 flow. Second operand 8 states and 185 transitions. [2024-05-12 12:26:09,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 342 transitions, 4673 flow [2024-05-12 12:26:09,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 342 transitions, 4481 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-05-12 12:26:09,930 INFO L231 Difference]: Finished difference. Result has 183 places, 294 transitions, 3540 flow [2024-05-12 12:26:09,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3352, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3540, PETRI_PLACES=183, PETRI_TRANSITIONS=294} [2024-05-12 12:26:09,931 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 130 predicate places. [2024-05-12 12:26:09,931 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 294 transitions, 3540 flow [2024-05-12 12:26:09,931 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 12:26:09,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:09,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:26:09,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:26:09,932 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:09,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -7329582, now seen corresponding path program 2 times [2024-05-12 12:26:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:09,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324499477] [2024-05-12 12:26:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:16,139 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 12:26:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324499477] [2024-05-12 12:26:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324499477] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:26:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748718910] [2024-05-12 12:26:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:26:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:26:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:26:16,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:26:16,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 294 transitions, 3540 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:16,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:16,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:26:16,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:18,671 INFO L124 PetriNetUnfolderBase]: 6893/10540 cut-off events. [2024-05-12 12:26:18,672 INFO L125 PetriNetUnfolderBase]: For 279327/279327 co-relation queries the response was YES. [2024-05-12 12:26:18,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70150 conditions, 10540 events. 6893/10540 cut-off events. For 279327/279327 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 64551 event pairs, 1948 based on Foata normal form. 1/10283 useless extension candidates. Maximal degree in co-relation 70058. Up to 9733 conditions per place. [2024-05-12 12:26:18,763 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 292 selfloop transitions, 13 changer transitions 0/312 dead transitions. [2024-05-12 12:26:18,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 312 transitions, 4224 flow [2024-05-12 12:26:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:26:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:26:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-05-12 12:26:18,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43617021276595747 [2024-05-12 12:26:18,764 INFO L175 Difference]: Start difference. First operand has 183 places, 294 transitions, 3540 flow. Second operand 6 states and 123 transitions. [2024-05-12 12:26:18,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 312 transitions, 4224 flow [2024-05-12 12:26:19,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 312 transitions, 4058 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-05-12 12:26:19,141 INFO L231 Difference]: Finished difference. Result has 183 places, 294 transitions, 3406 flow [2024-05-12 12:26:19,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3374, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3406, PETRI_PLACES=183, PETRI_TRANSITIONS=294} [2024-05-12 12:26:19,141 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 130 predicate places. [2024-05-12 12:26:19,141 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 294 transitions, 3406 flow [2024-05-12 12:26:19,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:19,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:19,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:26:19,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:26:19,142 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:19,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:19,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1100705999, now seen corresponding path program 1 times [2024-05-12 12:26:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:19,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070468193] [2024-05-12 12:26:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:27,232 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 12:26:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070468193] [2024-05-12 12:26:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070468193] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:27,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:26:27,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918948538] [2024-05-12 12:26:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:27,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:26:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:26:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:26:27,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:26:27,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 294 transitions, 3406 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:27,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:27,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:26:27,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:29,888 INFO L124 PetriNetUnfolderBase]: 6907/10779 cut-off events. [2024-05-12 12:26:29,888 INFO L125 PetriNetUnfolderBase]: For 277075/277075 co-relation queries the response was YES. [2024-05-12 12:26:29,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69502 conditions, 10779 events. 6907/10779 cut-off events. For 277075/277075 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 67695 event pairs, 1938 based on Foata normal form. 3/10451 useless extension candidates. Maximal degree in co-relation 69409. Up to 9601 conditions per place. [2024-05-12 12:26:30,010 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 269 selfloop transitions, 54 changer transitions 0/330 dead transitions. [2024-05-12 12:26:30,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 330 transitions, 4383 flow [2024-05-12 12:26:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:26:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:26:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-05-12 12:26:30,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858156028368794 [2024-05-12 12:26:30,012 INFO L175 Difference]: Start difference. First operand has 183 places, 294 transitions, 3406 flow. Second operand 6 states and 137 transitions. [2024-05-12 12:26:30,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 330 transitions, 4383 flow [2024-05-12 12:26:30,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 330 transitions, 4344 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 12:26:30,412 INFO L231 Difference]: Finished difference. Result has 184 places, 302 transitions, 3645 flow [2024-05-12 12:26:30,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3367, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3645, PETRI_PLACES=184, PETRI_TRANSITIONS=302} [2024-05-12 12:26:30,412 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 131 predicate places. [2024-05-12 12:26:30,413 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 302 transitions, 3645 flow [2024-05-12 12:26:30,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:30,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:30,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:26:30,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:26:30,413 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:30,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash -7322669, now seen corresponding path program 2 times [2024-05-12 12:26:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:30,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880161760] [2024-05-12 12:26:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:30,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:26:39,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:39,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880161760] [2024-05-12 12:26:39,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880161760] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:39,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:39,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:26:39,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064168512] [2024-05-12 12:26:39,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:39,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:26:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:39,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:26:39,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:26:39,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:26:39,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 302 transitions, 3645 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 12:26:39,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:39,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:26:39,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:41,973 INFO L124 PetriNetUnfolderBase]: 6870/10727 cut-off events. [2024-05-12 12:26:41,974 INFO L125 PetriNetUnfolderBase]: For 282116/282116 co-relation queries the response was YES. [2024-05-12 12:26:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69509 conditions, 10727 events. 6870/10727 cut-off events. For 282116/282116 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 67432 event pairs, 1973 based on Foata normal form. 1/10395 useless extension candidates. Maximal degree in co-relation 69416. Up to 9547 conditions per place. [2024-05-12 12:26:42,081 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 271 selfloop transitions, 60 changer transitions 0/338 dead transitions. [2024-05-12 12:26:42,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 338 transitions, 4456 flow [2024-05-12 12:26:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:26:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:26:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-05-12 12:26:42,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601063829787234 [2024-05-12 12:26:42,082 INFO L175 Difference]: Start difference. First operand has 184 places, 302 transitions, 3645 flow. Second operand 8 states and 173 transitions. [2024-05-12 12:26:42,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 338 transitions, 4456 flow [2024-05-12 12:26:42,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 338 transitions, 4358 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-05-12 12:26:42,508 INFO L231 Difference]: Finished difference. Result has 189 places, 302 transitions, 3680 flow [2024-05-12 12:26:42,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3547, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3680, PETRI_PLACES=189, PETRI_TRANSITIONS=302} [2024-05-12 12:26:42,509 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 136 predicate places. [2024-05-12 12:26:42,509 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 302 transitions, 3680 flow [2024-05-12 12:26:42,509 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 12:26:42,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:42,509 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 12:26:42,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:26:42,510 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:42,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:42,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2133134413, now seen corresponding path program 1 times [2024-05-12 12:26:42,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:42,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830006881] [2024-05-12 12:26:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:26:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830006881] [2024-05-12 12:26:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830006881] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:49,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:49,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:26:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087679468] [2024-05-12 12:26:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:49,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:26:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:26:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:26:49,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:26:49,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 302 transitions, 3680 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 12:26:49,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:49,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:26:49,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:52,596 INFO L124 PetriNetUnfolderBase]: 7874/12093 cut-off events. [2024-05-12 12:26:52,596 INFO L125 PetriNetUnfolderBase]: For 387367/387369 co-relation queries the response was YES. [2024-05-12 12:26:52,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83310 conditions, 12093 events. 7874/12093 cut-off events. For 387367/387369 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 76066 event pairs, 1056 based on Foata normal form. 26/11833 useless extension candidates. Maximal degree in co-relation 83216. Up to 7044 conditions per place. [2024-05-12 12:26:52,705 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 297 selfloop transitions, 101 changer transitions 0/405 dead transitions. [2024-05-12 12:26:52,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 405 transitions, 5663 flow [2024-05-12 12:26:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:26:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:26:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-05-12 12:26:52,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.557919621749409 [2024-05-12 12:26:52,707 INFO L175 Difference]: Start difference. First operand has 189 places, 302 transitions, 3680 flow. Second operand 9 states and 236 transitions. [2024-05-12 12:26:52,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 405 transitions, 5663 flow [2024-05-12 12:26:53,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 405 transitions, 5456 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 12:26:53,196 INFO L231 Difference]: Finished difference. Result has 192 places, 315 transitions, 4031 flow [2024-05-12 12:26:53,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3473, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4031, PETRI_PLACES=192, PETRI_TRANSITIONS=315} [2024-05-12 12:26:53,197 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 139 predicate places. [2024-05-12 12:26:53,197 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 315 transitions, 4031 flow [2024-05-12 12:26:53,198 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 12:26:53,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:53,198 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 12:26:53,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:26:53,198 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:53,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash 114630977, now seen corresponding path program 2 times [2024-05-12 12:26:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690653503] [2024-05-12 12:26:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:53,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:59,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 12:26:59,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:59,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690653503] [2024-05-12 12:26:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690653503] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:59,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:26:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668938836] [2024-05-12 12:26:59,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:59,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:26:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:26:59,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:26:59,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:26:59,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 315 transitions, 4031 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 12:26:59,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:59,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:26:59,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:03,011 INFO L124 PetriNetUnfolderBase]: 8393/12798 cut-off events. [2024-05-12 12:27:03,011 INFO L125 PetriNetUnfolderBase]: For 463294/463296 co-relation queries the response was YES. [2024-05-12 12:27:03,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92802 conditions, 12798 events. 8393/12798 cut-off events. For 463294/463296 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 81329 event pairs, 1738 based on Foata normal form. 32/12562 useless extension candidates. Maximal degree in co-relation 92705. Up to 9667 conditions per place. [2024-05-12 12:27:03,426 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 292 selfloop transitions, 100 changer transitions 0/399 dead transitions. [2024-05-12 12:27:03,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 399 transitions, 5592 flow [2024-05-12 12:27:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:27:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:27:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-05-12 12:27:03,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2024-05-12 12:27:03,427 INFO L175 Difference]: Start difference. First operand has 192 places, 315 transitions, 4031 flow. Second operand 9 states and 228 transitions. [2024-05-12 12:27:03,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 399 transitions, 5592 flow [2024-05-12 12:27:04,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 399 transitions, 5393 flow, removed 64 selfloop flow, removed 3 redundant places. [2024-05-12 12:27:04,283 INFO L231 Difference]: Finished difference. Result has 200 places, 328 transitions, 4283 flow [2024-05-12 12:27:04,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4283, PETRI_PLACES=200, PETRI_TRANSITIONS=328} [2024-05-12 12:27:04,283 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 147 predicate places. [2024-05-12 12:27:04,284 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 328 transitions, 4283 flow [2024-05-12 12:27:04,284 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 12:27:04,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:04,284 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 12:27:04,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:27:04,284 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:04,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash -689411027, now seen corresponding path program 3 times [2024-05-12 12:27:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:04,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060006173] [2024-05-12 12:27:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:09,875 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 12:27:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060006173] [2024-05-12 12:27:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060006173] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:09,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:09,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:27:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965582847] [2024-05-12 12:27:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:09,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:27:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:27:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:27:10,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:27:10,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 328 transitions, 4283 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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 12:27:10,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:10,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:27:10,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:12,638 INFO L124 PetriNetUnfolderBase]: 7815/12047 cut-off events. [2024-05-12 12:27:12,638 INFO L125 PetriNetUnfolderBase]: For 452520/452522 co-relation queries the response was YES. [2024-05-12 12:27:12,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90085 conditions, 12047 events. 7815/12047 cut-off events. For 452520/452522 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 78387 event pairs, 1748 based on Foata normal form. 26/11803 useless extension candidates. Maximal degree in co-relation 89984. Up to 8600 conditions per place. [2024-05-12 12:27:12,793 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 294 selfloop transitions, 104 changer transitions 0/406 dead transitions. [2024-05-12 12:27:12,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 406 transitions, 5953 flow [2024-05-12 12:27:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:27:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:27:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-05-12 12:27:12,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508274231678487 [2024-05-12 12:27:12,794 INFO L175 Difference]: Start difference. First operand has 200 places, 328 transitions, 4283 flow. Second operand 9 states and 233 transitions. [2024-05-12 12:27:12,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 406 transitions, 5953 flow [2024-05-12 12:27:13,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 406 transitions, 5749 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-05-12 12:27:13,868 INFO L231 Difference]: Finished difference. Result has 206 places, 336 transitions, 4532 flow [2024-05-12 12:27:13,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4079, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4532, PETRI_PLACES=206, PETRI_TRANSITIONS=336} [2024-05-12 12:27:13,869 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 153 predicate places. [2024-05-12 12:27:13,869 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 336 transitions, 4532 flow [2024-05-12 12:27:13,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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 12:27:13,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:13,870 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 12:27:13,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:27:13,870 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:13,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -602571347, now seen corresponding path program 4 times [2024-05-12 12:27:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:13,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127724335] [2024-05-12 12:27:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:18,921 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 12:27:18,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:18,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127724335] [2024-05-12 12:27:18,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127724335] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:18,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:18,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:27:18,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210336692] [2024-05-12 12:27:18,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:18,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:27:18,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:18,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:27:18,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:27:19,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:27:19,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 336 transitions, 4532 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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 12:27:19,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:19,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:27:19,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:22,627 INFO L124 PetriNetUnfolderBase]: 8993/13598 cut-off events. [2024-05-12 12:27:22,627 INFO L125 PetriNetUnfolderBase]: For 570903/570905 co-relation queries the response was YES. [2024-05-12 12:27:22,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101824 conditions, 13598 events. 8993/13598 cut-off events. For 570903/570905 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 87391 event pairs, 1993 based on Foata normal form. 78/13453 useless extension candidates. Maximal degree in co-relation 101721. Up to 10069 conditions per place. [2024-05-12 12:27:22,771 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 387 selfloop transitions, 106 changer transitions 0/501 dead transitions. [2024-05-12 12:27:22,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 501 transitions, 7826 flow [2024-05-12 12:27:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:27:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:27:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 228 transitions. [2024-05-12 12:27:22,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2024-05-12 12:27:22,773 INFO L175 Difference]: Start difference. First operand has 206 places, 336 transitions, 4532 flow. Second operand 8 states and 228 transitions. [2024-05-12 12:27:22,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 501 transitions, 7826 flow [2024-05-12 12:27:23,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 501 transitions, 7578 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-05-12 12:27:23,677 INFO L231 Difference]: Finished difference. Result has 213 places, 398 transitions, 5825 flow [2024-05-12 12:27:23,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4320, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5825, PETRI_PLACES=213, PETRI_TRANSITIONS=398} [2024-05-12 12:27:23,678 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 160 predicate places. [2024-05-12 12:27:23,678 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 398 transitions, 5825 flow [2024-05-12 12:27:23,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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 12:27:23,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27: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 12:27:23,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:27:23,679 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:23,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -602719217, now seen corresponding path program 5 times [2024-05-12 12:27:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781363577] [2024-05-12 12:27:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:29,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:29,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781363577] [2024-05-12 12:27:29,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781363577] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:29,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:27:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043907436] [2024-05-12 12:27:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:29,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:27:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:27:29,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:27:30,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:27:30,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 398 transitions, 5825 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 12:27:30,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:30,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:27:30,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:34,873 INFO L124 PetriNetUnfolderBase]: 11037/16774 cut-off events. [2024-05-12 12:27:34,873 INFO L125 PetriNetUnfolderBase]: For 698610/698612 co-relation queries the response was YES. [2024-05-12 12:27:35,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130855 conditions, 16774 events. 11037/16774 cut-off events. For 698610/698612 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 110828 event pairs, 2451 based on Foata normal form. 26/16500 useless extension candidates. Maximal degree in co-relation 130747. Up to 13109 conditions per place. [2024-05-12 12:27:35,100 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 368 selfloop transitions, 104 changer transitions 0/479 dead transitions. [2024-05-12 12:27:35,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 479 transitions, 7852 flow [2024-05-12 12:27:35,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:27:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:27:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-05-12 12:27:35,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541371158392435 [2024-05-12 12:27:35,102 INFO L175 Difference]: Start difference. First operand has 213 places, 398 transitions, 5825 flow. Second operand 9 states and 229 transitions. [2024-05-12 12:27:35,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 479 transitions, 7852 flow [2024-05-12 12:27:37,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 479 transitions, 7438 flow, removed 191 selfloop flow, removed 1 redundant places. [2024-05-12 12:27:37,477 INFO L231 Difference]: Finished difference. Result has 222 places, 404 transitions, 5941 flow [2024-05-12 12:27:37,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5477, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5941, PETRI_PLACES=222, PETRI_TRANSITIONS=404} [2024-05-12 12:27:37,478 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 169 predicate places. [2024-05-12 12:27:37,478 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 404 transitions, 5941 flow [2024-05-12 12:27:37,482 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 12:27:37,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:37,482 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 12:27:37,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:27:37,483 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:37,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash -602715497, now seen corresponding path program 6 times [2024-05-12 12:27:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:37,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548934056] [2024-05-12 12:27:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548934056] [2024-05-12 12:27:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548934056] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:44,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:27:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4507488] [2024-05-12 12:27:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:44,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:27:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:27:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:27:44,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:27:44,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 404 transitions, 5941 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 12:27:44,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:44,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:27:44,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:50,082 INFO L124 PetriNetUnfolderBase]: 11363/17328 cut-off events. [2024-05-12 12:27:50,082 INFO L125 PetriNetUnfolderBase]: For 756467/756469 co-relation queries the response was YES. [2024-05-12 12:27:50,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133439 conditions, 17328 events. 11363/17328 cut-off events. For 756467/756469 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 115825 event pairs, 2498 based on Foata normal form. 50/17058 useless extension candidates. Maximal degree in co-relation 133327. Up to 13903 conditions per place. [2024-05-12 12:27:50,444 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 367 selfloop transitions, 115 changer transitions 0/489 dead transitions. [2024-05-12 12:27:50,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 489 transitions, 7708 flow [2024-05-12 12:27:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:27:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:27:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 252 transitions. [2024-05-12 12:27:50,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361702127659574 [2024-05-12 12:27:50,445 INFO L175 Difference]: Start difference. First operand has 222 places, 404 transitions, 5941 flow. Second operand 10 states and 252 transitions. [2024-05-12 12:27:50,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 489 transitions, 7708 flow [2024-05-12 12:27:52,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 489 transitions, 7419 flow, removed 66 selfloop flow, removed 5 redundant places. [2024-05-12 12:27:52,044 INFO L231 Difference]: Finished difference. Result has 227 places, 412 transitions, 6146 flow [2024-05-12 12:27:52,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5658, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6146, PETRI_PLACES=227, PETRI_TRANSITIONS=412} [2024-05-12 12:27:52,045 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 174 predicate places. [2024-05-12 12:27:52,045 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 412 transitions, 6146 flow [2024-05-12 12:27:52,045 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 12:27:52,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:52,045 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 12:27:52,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:27:52,045 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:52,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1280601933, now seen corresponding path program 1 times [2024-05-12 12:27:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716541253] [2024-05-12 12:27:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:58,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 12:27:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:58,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716541253] [2024-05-12 12:27:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716541253] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:58,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:27:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092476388] [2024-05-12 12:27:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:58,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:27:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:27:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:27:58,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:27:58,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 412 transitions, 6146 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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 12:27:58,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:58,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:27:58,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:28:03,721 INFO L124 PetriNetUnfolderBase]: 11443/17526 cut-off events. [2024-05-12 12:28:03,721 INFO L125 PetriNetUnfolderBase]: For 693883/693885 co-relation queries the response was YES. [2024-05-12 12:28:03,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134360 conditions, 17526 events. 11443/17526 cut-off events. For 693883/693885 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 118126 event pairs, 2632 based on Foata normal form. 6/17182 useless extension candidates. Maximal degree in co-relation 134246. Up to 15315 conditions per place. [2024-05-12 12:28:03,902 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 363 selfloop transitions, 95 changer transitions 0/465 dead transitions. [2024-05-12 12:28:03,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 465 transitions, 7616 flow [2024-05-12 12:28:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:28:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:28:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 12:28:03,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 12:28:03,904 INFO L175 Difference]: Start difference. First operand has 227 places, 412 transitions, 6146 flow. Second operand 7 states and 173 transitions. [2024-05-12 12:28:03,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 465 transitions, 7616 flow [2024-05-12 12:28:05,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 465 transitions, 7223 flow, removed 55 selfloop flow, removed 11 redundant places. [2024-05-12 12:28:05,679 INFO L231 Difference]: Finished difference. Result has 223 places, 420 transitions, 6124 flow [2024-05-12 12:28:05,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5767, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6124, PETRI_PLACES=223, PETRI_TRANSITIONS=420} [2024-05-12 12:28:05,679 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 170 predicate places. [2024-05-12 12:28:05,679 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 420 transitions, 6124 flow [2024-05-12 12:28:05,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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 12:28:05,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:28:05,680 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 12:28:05,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:28:05,680 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:28:05,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:28:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1500759147, now seen corresponding path program 7 times [2024-05-12 12:28:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:28:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6835119] [2024-05-12 12:28:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:28:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:28:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:28:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:28:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:28:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6835119] [2024-05-12 12:28:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6835119] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:28:11,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:28:11,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:28:11,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696462786] [2024-05-12 12:28:11,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:28:11,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:28:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:28:11,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:28:11,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:28:11,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-05-12 12:28:11,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 420 transitions, 6124 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 12:28:11,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:28:11,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-05-12 12:28:11,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand