./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 15:48:42,354 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:48:42,424 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:48:42,427 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:48:42,427 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:48:42,440 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:48:42,440 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:48:42,441 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:48:42,441 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:48:42,441 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:48:42,442 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:48:42,442 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:48:42,442 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:48:42,442 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:48:42,443 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:48:42,443 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:48:42,443 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:48:42,443 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:48:42,444 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:48:42,444 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:48:42,444 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:48:42,444 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:48:42,445 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:48:42,445 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:48:42,445 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:48:42,445 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:48:42,445 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:48:42,445 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:48:42,446 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:48:42,446 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:48:42,446 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:48:42,446 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:48:42,446 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:48:42,446 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:48:42,447 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:48:42,447 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:48:42,447 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:48:42,447 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:48:42,447 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:48:42,447 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:48:42,447 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:48:42,456 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:48:42,456 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:48:42,457 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 15:48:42,604 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:48:42,619 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:48:42,621 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:48:42,621 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:48:42,622 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:48:42,622 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-14 15:48:42,798 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:48:42,798 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:48:42,799 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 15:48:43,753 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:48:43,946 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:48:43,947 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 15:48:43,963 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e3360ed/3a19009e2c5c42ffa3456133ff67ad69/FLAGb9dd383a1
[2024-06-14 15:48:43,972 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e3360ed/3a19009e2c5c42ffa3456133ff67ad69
[2024-06-14 15:48:43,972 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:48:43,973 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:48:43,974 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:48:43,974 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:48:43,977 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:48:43,978 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:48:42" (1/2) ...
[2024-06-14 15:48:43,978 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebdd39e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:43, skipping insertion in model container
[2024-06-14 15:48:43,979 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:48:42" (1/2) ...
[2024-06-14 15:48:43,979 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@37b82a8a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:43, skipping insertion in model container
[2024-06-14 15:48:43,980 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:48:43" (2/2) ...
[2024-06-14 15:48:43,980 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebdd39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:43, skipping insertion in model container
[2024-06-14 15:48:43,980 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:48:43" (2/2) ...
[2024-06-14 15:48:43,980 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:48:44,114 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:48:44,115 INFO  L97    edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))
[2024-06-14 15:48:44,116 INFO  L97    edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))
[2024-06-14 15:48:44,116 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))
[2024-06-14 15:48:44,117 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:48:44,117 INFO  L106   edCorrectnessWitness]: ghost_update [L845-L845] multithreaded = 1;
[2024-06-14 15:48:44,156 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:48:44,459 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:48:44,471 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 15:48:44,725 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:48:44,752 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:48:44,753 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44 WrapperNode
[2024-06-14 15:48:44,753 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:48:44,754 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:48:44,754 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:48:44,754 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:48:44,759 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:44,799 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:44,935 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-14 15:48:44,935 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:48:44,936 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:48:44,936 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:48:44,937 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:48:44,945 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:44,945 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:44,966 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,013 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 15:48:45,013 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,013 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,065 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,067 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,080 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,085 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,104 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:48:45,105 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:48:45,105 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:48:45,106 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:48:45,106 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (1/1) ...
[2024-06-14 15:48:45,110 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:48:45,116 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:48:45,127 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 15:48:45,148 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 15:48:45,160 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:48:45,160 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:48:45,160 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:48:45,160 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:48:45,160 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:48:45,160 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:48:45,161 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:48:45,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:48:45,161 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:48:45,161 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:48:45,161 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:48:45,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:48:45,162 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 15:48:45,293 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:48:45,295 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:48:46,122 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:48:46,124 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:48:46,399 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:48:46,400 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:48:46,400 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:48:46 BoogieIcfgContainer
[2024-06-14 15:48:46,400 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:48:46,404 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:48:46,404 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:48:46,406 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:48:46,406 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:48:42" (1/4) ...
[2024-06-14 15:48:46,407 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13232e2b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:48:46, skipping insertion in model container
[2024-06-14 15:48:46,407 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:48:43" (2/4) ...
[2024-06-14 15:48:46,408 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13232e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:48:46, skipping insertion in model container
[2024-06-14 15:48:46,408 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:44" (3/4) ...
[2024-06-14 15:48:46,408 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13232e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:48:46, skipping insertion in model container
[2024-06-14 15:48:46,409 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:48:46" (4/4) ...
[2024-06-14 15:48:46,410 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 15:48:46,421 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:48:46,422 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 15:48:46,422 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:48:46,499 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:48:46,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:48:46,565 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-14 15:48:46,565 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:48:46,566 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 15:48:46,567 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:48:46,569 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-14 15:48:46,575 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:48:46,579 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;@7ebd0a46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:48:46,580 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 15:48:46,584 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:48:46,585 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 15:48:46,585 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:48:46,585 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:46,585 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:46,586 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:46,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:46,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 768558868, now seen corresponding path program 1 times
[2024-06-14 15:48:46,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:46,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264430257]
[2024-06-14 15:48:46,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:46,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:46,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:51,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:51,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:51,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264430257]
[2024-06-14 15:48:51,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264430257] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:51,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:51,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:48:51,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181583420]
[2024-06-14 15:48:51,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:51,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:48:51,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:51,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:48:51,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:48:51,195 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:48:51,198 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:51,198 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:51,198 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:48:51,199 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:52,074 INFO  L124   PetriNetUnfolderBase]: 1650/2466 cut-off events.
[2024-06-14 15:48:52,074 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-14 15:48:52,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 2466 events. 1650/2466 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11597 event pairs, 881 based on Foata normal form. 4/2429 useless extension candidates. Maximal degree in co-relation 5005. Up to 2444 conditions per place. 
[2024-06-14 15:48:52,089 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-06-14 15:48:52,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 189 flow
[2024-06-14 15:48:52,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:48:52,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:48:52,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions.
[2024-06-14 15:48:52,098 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5609756097560976
[2024-06-14 15:48:52,100 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 69 transitions.
[2024-06-14 15:48:52,100 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 189 flow
[2024-06-14 15:48:52,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 15:48:52,104 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-14 15:48:52,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-14 15:48:52,111 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-14 15:48:52,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-14 15:48:52,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:52,111 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:52,111 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:52,112 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:48:52,112 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:52,113 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:52,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -149255181, now seen corresponding path program 1 times
[2024-06-14 15:48:52,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:52,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535711836]
[2024-06-14 15:48:52,113 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:52,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:52,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:55,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:55,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:55,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535711836]
[2024-06-14 15:48:55,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535711836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:55,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:55,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 15:48:55,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389452299]
[2024-06-14 15:48:55,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:55,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 15:48:55,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:55,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 15:48:55,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-14 15:48:55,622 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:48:55,622 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:55,622 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:55,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:48:55,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:56,391 INFO  L124   PetriNetUnfolderBase]: 1659/2478 cut-off events.
[2024-06-14 15:48:56,392 INFO  L125   PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES.
[2024-06-14 15:48:56,396 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5690 conditions, 2478 events. 1659/2478 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11335 event pairs, 955 based on Foata normal form. 6/2483 useless extension candidates. Maximal degree in co-relation 5675. Up to 2441 conditions per place. 
[2024-06-14 15:48:56,405 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 48 selfloop transitions, 7 changer transitions 0/58 dead transitions.
[2024-06-14 15:48:56,405 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 274 flow
[2024-06-14 15:48:56,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:48:56,406 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:48:56,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions.
[2024-06-14 15:48:56,407 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5304878048780488
[2024-06-14 15:48:56,407 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions.
[2024-06-14 15:48:56,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 274 flow
[2024-06-14 15:48:56,408 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:48:56,409 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 156 flow
[2024-06-14 15:48:56,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2024-06-14 15:48:56,410 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-14 15:48:56,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 156 flow
[2024-06-14 15:48:56,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:56,411 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:56,411 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:56,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:48:56,411 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:56,412 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:56,412 INFO  L85        PathProgramCache]: Analyzing trace with hash -331941767, now seen corresponding path program 1 times
[2024-06-14 15:48:56,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:56,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239572138]
[2024-06-14 15:48:56,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:56,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:56,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:59,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:59,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:59,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239572138]
[2024-06-14 15:48:59,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239572138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:59,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:59,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:48:59,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791177920]
[2024-06-14 15:48:59,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:59,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:48:59,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:59,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:48:59,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:48:59,398 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:48:59,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 156 flow. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:59,399 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:59,399 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:48:59,399 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:00,250 INFO  L124   PetriNetUnfolderBase]: 1751/2608 cut-off events.
[2024-06-14 15:49:00,251 INFO  L125   PetriNetUnfolderBase]: For 1276/1276 co-relation queries the response was YES.
[2024-06-14 15:49:00,254 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6762 conditions, 2608 events. 1751/2608 cut-off events. For 1276/1276 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12092 event pairs, 770 based on Foata normal form. 11/2618 useless extension candidates. Maximal degree in co-relation 6744. Up to 2426 conditions per place. 
[2024-06-14 15:49:00,263 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 64 selfloop transitions, 16 changer transitions 0/83 dead transitions.
[2024-06-14 15:49:00,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 450 flow
[2024-06-14 15:49:00,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:49:00,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:49:00,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions.
[2024-06-14 15:49:00,265 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5658536585365853
[2024-06-14 15:49:00,265 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 156 flow. Second operand 5 states and 116 transitions.
[2024-06-14 15:49:00,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 450 flow
[2024-06-14 15:49:00,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 440 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-14 15:49:00,268 INFO  L231             Difference]: Finished difference. Result has 52 places, 52 transitions, 259 flow
[2024-06-14 15:49:00,268 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=52, PETRI_TRANSITIONS=52}
[2024-06-14 15:49:00,269 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places.
[2024-06-14 15:49:00,269 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 259 flow
[2024-06-14 15:49:00,269 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:00,269 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:00,269 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:00,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:49:00,270 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:00,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:00,270 INFO  L85        PathProgramCache]: Analyzing trace with hash -1700258606, now seen corresponding path program 1 times
[2024-06-14 15:49:00,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:00,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67422249]
[2024-06-14 15:49:00,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:00,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:00,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:03,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:03,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:03,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67422249]
[2024-06-14 15:49:03,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67422249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:03,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:03,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:49:03,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672234487]
[2024-06-14 15:49:03,654 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:03,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:49:03,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:03,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:49:03,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:49:03,758 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:49:03,758 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 259 flow. Second operand  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:03,758 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:03,759 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:49:03,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:04,677 INFO  L124   PetriNetUnfolderBase]: 1819/2709 cut-off events.
[2024-06-14 15:49:04,678 INFO  L125   PetriNetUnfolderBase]: For 3454/3454 co-relation queries the response was YES.
[2024-06-14 15:49:04,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8344 conditions, 2709 events. 1819/2709 cut-off events. For 3454/3454 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12468 event pairs, 572 based on Foata normal form. 9/2716 useless extension candidates. Maximal degree in co-relation 8322. Up to 2426 conditions per place. 
[2024-06-14 15:49:04,692 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 85 selfloop transitions, 25 changer transitions 0/113 dead transitions.
[2024-06-14 15:49:04,692 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 113 transitions, 723 flow
[2024-06-14 15:49:04,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:49:04,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:49:04,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-06-14 15:49:04,698 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5650406504065041
[2024-06-14 15:49:04,699 INFO  L175             Difference]: Start difference. First operand has 52 places, 52 transitions, 259 flow. Second operand 6 states and 139 transitions.
[2024-06-14 15:49:04,699 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 113 transitions, 723 flow
[2024-06-14 15:49:04,704 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 711 flow, removed 6 selfloop flow, removed 0 redundant places.
[2024-06-14 15:49:04,706 INFO  L231             Difference]: Finished difference. Result has 61 places, 72 transitions, 465 flow
[2024-06-14 15:49:04,707 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=61, PETRI_TRANSITIONS=72}
[2024-06-14 15:49:04,708 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places.
[2024-06-14 15:49:04,708 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 72 transitions, 465 flow
[2024-06-14 15:49:04,708 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:04,708 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:04,708 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:04,708 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:49:04,709 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:04,709 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:04,709 INFO  L85        PathProgramCache]: Analyzing trace with hash -1168407624, now seen corresponding path program 1 times
[2024-06-14 15:49:04,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:04,709 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192512883]
[2024-06-14 15:49:04,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:04,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:04,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:08,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:08,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:08,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192512883]
[2024-06-14 15:49:08,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192512883] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:08,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:08,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:49:08,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601431905]
[2024-06-14 15:49:08,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:08,646 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:49:08,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:08,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:49:08,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:49:08,775 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:49:08,775 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 72 transitions, 465 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:08,775 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:08,776 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:49:08,776 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:09,819 INFO  L124   PetriNetUnfolderBase]: 1990/2972 cut-off events.
[2024-06-14 15:49:09,819 INFO  L125   PetriNetUnfolderBase]: For 6904/6906 co-relation queries the response was YES.
[2024-06-14 15:49:09,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10773 conditions, 2972 events. 1990/2972 cut-off events. For 6904/6906 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13996 event pairs, 523 based on Foata normal form. 46/3017 useless extension candidates. Maximal degree in co-relation 10745. Up to 2548 conditions per place. 
[2024-06-14 15:49:09,839 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 94 selfloop transitions, 34 changer transitions 0/131 dead transitions.
[2024-06-14 15:49:09,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 131 transitions, 955 flow
[2024-06-14 15:49:09,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:49:09,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:49:09,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions.
[2024-06-14 15:49:09,841 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5574912891986062
[2024-06-14 15:49:09,841 INFO  L175             Difference]: Start difference. First operand has 61 places, 72 transitions, 465 flow. Second operand 7 states and 160 transitions.
[2024-06-14 15:49:09,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 131 transitions, 955 flow
[2024-06-14 15:49:09,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 131 transitions, 923 flow, removed 16 selfloop flow, removed 0 redundant places.
[2024-06-14 15:49:09,851 INFO  L231             Difference]: Finished difference. Result has 68 places, 82 transitions, 612 flow
[2024-06-14 15:49:09,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=68, PETRI_TRANSITIONS=82}
[2024-06-14 15:49:09,852 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places.
[2024-06-14 15:49:09,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 82 transitions, 612 flow
[2024-06-14 15:49:09,852 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:09,852 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:09,853 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:09,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:49:09,853 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:09,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:09,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -2123205461, now seen corresponding path program 1 times
[2024-06-14 15:49:09,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:09,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953758440]
[2024-06-14 15:49:09,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:09,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:09,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:16,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:16,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:16,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953758440]
[2024-06-14 15:49:16,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953758440] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:16,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:16,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:49:16,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782207560]
[2024-06-14 15:49:16,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:16,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:49:16,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:16,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:49:16,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:49:16,503 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:16,504 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 82 transitions, 612 flow. Second operand  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:16,504 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:16,504 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:16,504 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:17,401 INFO  L124   PetriNetUnfolderBase]: 1976/2952 cut-off events.
[2024-06-14 15:49:17,401 INFO  L125   PetriNetUnfolderBase]: For 10214/10214 co-relation queries the response was YES.
[2024-06-14 15:49:17,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12329 conditions, 2952 events. 1976/2952 cut-off events. For 10214/10214 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13794 event pairs, 706 based on Foata normal form. 5/2956 useless extension candidates. Maximal degree in co-relation 12297. Up to 2906 conditions per place. 
[2024-06-14 15:49:17,420 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 85 selfloop transitions, 12 changer transitions 0/100 dead transitions.
[2024-06-14 15:49:17,420 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 876 flow
[2024-06-14 15:49:17,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:49:17,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:49:17,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions.
[2024-06-14 15:49:17,421 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4292682926829268
[2024-06-14 15:49:17,421 INFO  L175             Difference]: Start difference. First operand has 68 places, 82 transitions, 612 flow. Second operand 5 states and 88 transitions.
[2024-06-14 15:49:17,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 876 flow
[2024-06-14 15:49:17,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 827 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:17,430 INFO  L231             Difference]: Finished difference. Result has 70 places, 85 transitions, 630 flow
[2024-06-14 15:49:17,430 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=70, PETRI_TRANSITIONS=85}
[2024-06-14 15:49:17,430 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places.
[2024-06-14 15:49:17,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 85 transitions, 630 flow
[2024-06-14 15:49:17,431 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:17,431 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:17,431 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:17,431 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:49:17,431 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:17,431 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:17,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -1395089477, now seen corresponding path program 1 times
[2024-06-14 15:49:17,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:17,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236417475]
[2024-06-14 15:49:17,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:17,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:17,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:21,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:21,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:21,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236417475]
[2024-06-14 15:49:21,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236417475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:21,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:21,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:49:21,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129226826]
[2024-06-14 15:49:21,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:21,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:49:21,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:21,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:49:21,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:49:21,977 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:21,978 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 85 transitions, 630 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:21,978 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:21,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:21,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:22,949 INFO  L124   PetriNetUnfolderBase]: 1996/2980 cut-off events.
[2024-06-14 15:49:22,949 INFO  L125   PetriNetUnfolderBase]: For 11981/11981 co-relation queries the response was YES.
[2024-06-14 15:49:22,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12879 conditions, 2980 events. 1996/2980 cut-off events. For 11981/11981 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13896 event pairs, 692 based on Foata normal form. 10/2989 useless extension candidates. Maximal degree in co-relation 12844. Up to 2894 conditions per place. 
[2024-06-14 15:49:22,963 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 88 selfloop transitions, 19 changer transitions 0/110 dead transitions.
[2024-06-14 15:49:22,963 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 110 transitions, 934 flow
[2024-06-14 15:49:22,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:49:22,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:49:22,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-14 15:49:22,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-14 15:49:22,965 INFO  L175             Difference]: Start difference. First operand has 70 places, 85 transitions, 630 flow. Second operand 6 states and 106 transitions.
[2024-06-14 15:49:22,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 110 transitions, 934 flow
[2024-06-14 15:49:22,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 110 transitions, 907 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:22,973 INFO  L231             Difference]: Finished difference. Result has 73 places, 89 transitions, 694 flow
[2024-06-14 15:49:22,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=73, PETRI_TRANSITIONS=89}
[2024-06-14 15:49:22,973 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places.
[2024-06-14 15:49:22,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 89 transitions, 694 flow
[2024-06-14 15:49:22,974 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:22,974 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:22,974 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:22,974 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:49:22,974 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:22,974 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:22,974 INFO  L85        PathProgramCache]: Analyzing trace with hash -497761048, now seen corresponding path program 1 times
[2024-06-14 15:49:22,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:22,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803213649]
[2024-06-14 15:49:22,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:22,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:23,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:27,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:27,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:27,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803213649]
[2024-06-14 15:49:27,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803213649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:27,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:27,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:49:27,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138283050]
[2024-06-14 15:49:27,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:27,693 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:49:27,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:27,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:49:27,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:49:27,781 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:27,781 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 89 transitions, 694 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:27,781 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:27,781 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:27,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:28,662 INFO  L124   PetriNetUnfolderBase]: 2008/2999 cut-off events.
[2024-06-14 15:49:28,662 INFO  L125   PetriNetUnfolderBase]: For 14055/14057 co-relation queries the response was YES.
[2024-06-14 15:49:28,669 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13681 conditions, 2999 events. 2008/2999 cut-off events. For 14055/14057 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14075 event pairs, 668 based on Foata normal form. 12/3010 useless extension candidates. Maximal degree in co-relation 13645. Up to 2805 conditions per place. 
[2024-06-14 15:49:28,680 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 94 selfloop transitions, 23 changer transitions 0/120 dead transitions.
[2024-06-14 15:49:28,680 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 120 transitions, 1081 flow
[2024-06-14 15:49:28,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:49:28,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:49:28,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-14 15:49:28,681 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-14 15:49:28,681 INFO  L175             Difference]: Start difference. First operand has 73 places, 89 transitions, 694 flow. Second operand 6 states and 111 transitions.
[2024-06-14 15:49:28,681 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 120 transitions, 1081 flow
[2024-06-14 15:49:28,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 120 transitions, 1024 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-14 15:49:28,692 INFO  L231             Difference]: Finished difference. Result has 75 places, 93 transitions, 738 flow
[2024-06-14 15:49:28,692 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=75, PETRI_TRANSITIONS=93}
[2024-06-14 15:49:28,693 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places.
[2024-06-14 15:49:28,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 93 transitions, 738 flow
[2024-06-14 15:49:28,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:28,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:28,693 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:28,693 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:49:28,694 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:28,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:28,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -290957878, now seen corresponding path program 2 times
[2024-06-14 15:49:28,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:28,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45560083]
[2024-06-14 15:49:28,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:28,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:28,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:34,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:34,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:34,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45560083]
[2024-06-14 15:49:34,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45560083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:34,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:34,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:49:34,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786607182]
[2024-06-14 15:49:34,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:34,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:49:34,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:34,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:49:34,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:49:34,164 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:34,165 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 93 transitions, 738 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:34,165 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:34,165 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:34,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:35,053 INFO  L124   PetriNetUnfolderBase]: 1953/2910 cut-off events.
[2024-06-14 15:49:35,053 INFO  L125   PetriNetUnfolderBase]: For 15274/15274 co-relation queries the response was YES.
[2024-06-14 15:49:35,059 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13487 conditions, 2910 events. 1953/2910 cut-off events. For 15274/15274 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13535 event pairs, 691 based on Foata normal form. 5/2914 useless extension candidates. Maximal degree in co-relation 13450. Up to 2870 conditions per place. 
[2024-06-14 15:49:35,068 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 96 selfloop transitions, 12 changer transitions 0/111 dead transitions.
[2024-06-14 15:49:35,069 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 111 transitions, 1007 flow
[2024-06-14 15:49:35,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:49:35,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:49:35,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions.
[2024-06-14 15:49:35,070 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-14 15:49:35,070 INFO  L175             Difference]: Start difference. First operand has 75 places, 93 transitions, 738 flow. Second operand 6 states and 99 transitions.
[2024-06-14 15:49:35,070 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 111 transitions, 1007 flow
[2024-06-14 15:49:35,079 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 974 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:35,080 INFO  L231             Difference]: Finished difference. Result has 78 places, 93 transitions, 738 flow
[2024-06-14 15:49:35,080 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=78, PETRI_TRANSITIONS=93}
[2024-06-14 15:49:35,081 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places.
[2024-06-14 15:49:35,081 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 738 flow
[2024-06-14 15:49:35,081 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:35,081 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:35,082 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:35,082 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:49:35,082 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:35,082 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:35,082 INFO  L85        PathProgramCache]: Analyzing trace with hash 1749277710, now seen corresponding path program 1 times
[2024-06-14 15:49:35,082 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:35,082 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37691823]
[2024-06-14 15:49:35,083 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:35,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:35,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:41,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:41,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:41,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37691823]
[2024-06-14 15:49:41,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37691823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:41,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:41,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:49:41,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849329054]
[2024-06-14 15:49:41,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:41,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:49:41,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:41,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:49:41,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:49:41,358 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:41,358 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 738 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:41,358 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:41,358 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:41,358 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:42,343 INFO  L124   PetriNetUnfolderBase]: 2025/3017 cut-off events.
[2024-06-14 15:49:42,344 INFO  L125   PetriNetUnfolderBase]: For 17866/17868 co-relation queries the response was YES.
[2024-06-14 15:49:42,350 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14064 conditions, 3017 events. 2025/3017 cut-off events. For 17866/17868 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14080 event pairs, 550 based on Foata normal form. 14/3030 useless extension candidates. Maximal degree in co-relation 14026. Up to 2643 conditions per place. 
[2024-06-14 15:49:42,364 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 103 selfloop transitions, 39 changer transitions 0/145 dead transitions.
[2024-06-14 15:49:42,365 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 145 transitions, 1313 flow
[2024-06-14 15:49:42,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:42,366 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:42,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-14 15:49:42,367 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4420731707317073
[2024-06-14 15:49:42,368 INFO  L175             Difference]: Start difference. First operand has 78 places, 93 transitions, 738 flow. Second operand 8 states and 145 transitions.
[2024-06-14 15:49:42,368 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 145 transitions, 1313 flow
[2024-06-14 15:49:42,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 145 transitions, 1243 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 15:49:42,381 INFO  L231             Difference]: Finished difference. Result has 82 places, 109 transitions, 924 flow
[2024-06-14 15:49:42,381 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=924, PETRI_PLACES=82, PETRI_TRANSITIONS=109}
[2024-06-14 15:49:42,383 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places.
[2024-06-14 15:49:42,383 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 109 transitions, 924 flow
[2024-06-14 15:49:42,383 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:42,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:42,384 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:42,384 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:49:42,384 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:42,384 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:42,384 INFO  L85        PathProgramCache]: Analyzing trace with hash -429521462, now seen corresponding path program 2 times
[2024-06-14 15:49:42,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:42,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952986176]
[2024-06-14 15:49:42,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:42,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:42,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:47,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:47,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:47,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952986176]
[2024-06-14 15:49:47,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952986176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:47,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:47,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:49:47,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017321619]
[2024-06-14 15:49:47,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:47,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:49:47,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:47,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:49:47,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:49:48,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:48,014 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 109 transitions, 924 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:48,014 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:48,014 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:48,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:48,948 INFO  L124   PetriNetUnfolderBase]: 2047/3048 cut-off events.
[2024-06-14 15:49:48,948 INFO  L125   PetriNetUnfolderBase]: For 20808/20808 co-relation queries the response was YES.
[2024-06-14 15:49:48,956 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15266 conditions, 3048 events. 2047/3048 cut-off events. For 20808/20808 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14227 event pairs, 610 based on Foata normal form. 4/3051 useless extension candidates. Maximal degree in co-relation 15226. Up to 2990 conditions per place. 
[2024-06-14 15:49:48,966 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 119 selfloop transitions, 17 changer transitions 0/139 dead transitions.
[2024-06-14 15:49:48,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 139 transitions, 1306 flow
[2024-06-14 15:49:48,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:48,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:48,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-14 15:49:48,968 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38109756097560976
[2024-06-14 15:49:48,968 INFO  L175             Difference]: Start difference. First operand has 82 places, 109 transitions, 924 flow. Second operand 8 states and 125 transitions.
[2024-06-14 15:49:48,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 139 transitions, 1306 flow
[2024-06-14 15:49:48,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 1262 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:48,987 INFO  L231             Difference]: Finished difference. Result has 88 places, 115 transitions, 984 flow
[2024-06-14 15:49:48,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=984, PETRI_PLACES=88, PETRI_TRANSITIONS=115}
[2024-06-14 15:49:48,988 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places.
[2024-06-14 15:49:48,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 115 transitions, 984 flow
[2024-06-14 15:49:48,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:48,988 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:48,988 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:48,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:49:48,989 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:48,989 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:48,989 INFO  L85        PathProgramCache]: Analyzing trace with hash -651403652, now seen corresponding path program 3 times
[2024-06-14 15:49:48,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:48,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954624458]
[2024-06-14 15:49:48,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:48,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:49,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:54,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:54,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:54,597 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954624458]
[2024-06-14 15:49:54,597 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954624458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:54,597 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:54,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:49:54,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047899734]
[2024-06-14 15:49:54,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:54,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:49:54,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:54,598 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:49:54,598 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:49:54,717 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:54,718 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 115 transitions, 984 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:54,719 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:54,719 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:54,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:55,678 INFO  L124   PetriNetUnfolderBase]: 2053/3057 cut-off events.
[2024-06-14 15:49:55,679 INFO  L125   PetriNetUnfolderBase]: For 22910/22910 co-relation queries the response was YES.
[2024-06-14 15:49:55,686 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15725 conditions, 3057 events. 2053/3057 cut-off events. For 22910/22910 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14262 event pairs, 608 based on Foata normal form. 4/3060 useless extension candidates. Maximal degree in co-relation 15683. Up to 2961 conditions per place. 
[2024-06-14 15:49:55,694 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 120 selfloop transitions, 24 changer transitions 0/147 dead transitions.
[2024-06-14 15:49:55,695 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 147 transitions, 1439 flow
[2024-06-14 15:49:55,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:55,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:55,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions.
[2024-06-14 15:49:55,697 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39634146341463417
[2024-06-14 15:49:55,697 INFO  L175             Difference]: Start difference. First operand has 88 places, 115 transitions, 984 flow. Second operand 8 states and 130 transitions.
[2024-06-14 15:49:55,697 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 147 transitions, 1439 flow
[2024-06-14 15:49:55,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 147 transitions, 1405 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-14 15:49:55,715 INFO  L231             Difference]: Finished difference. Result has 92 places, 120 transitions, 1072 flow
[2024-06-14 15:49:55,715 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1072, PETRI_PLACES=92, PETRI_TRANSITIONS=120}
[2024-06-14 15:49:55,715 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places.
[2024-06-14 15:49:55,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 120 transitions, 1072 flow
[2024-06-14 15:49:55,716 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:55,716 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:55,716 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:55,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:49:55,716 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:55,716 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:55,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -651157574, now seen corresponding path program 1 times
[2024-06-14 15:49:55,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:55,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242854478]
[2024-06-14 15:49:55,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:55,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:55,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:03,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:03,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:03,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242854478]
[2024-06-14 15:50:03,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242854478] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:03,118 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:03,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:03,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889458347]
[2024-06-14 15:50:03,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:03,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:03,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:03,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:03,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:03,254 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:03,254 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 120 transitions, 1072 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:03,255 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:03,255 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:03,255 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:04,357 INFO  L124   PetriNetUnfolderBase]: 2097/3125 cut-off events.
[2024-06-14 15:50:04,357 INFO  L125   PetriNetUnfolderBase]: For 26583/26583 co-relation queries the response was YES.
[2024-06-14 15:50:04,365 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16299 conditions, 3125 events. 2097/3125 cut-off events. For 26583/26583 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14558 event pairs, 576 based on Foata normal form. 18/3142 useless extension candidates. Maximal degree in co-relation 16255. Up to 2963 conditions per place. 
[2024-06-14 15:50:04,372 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 127 selfloop transitions, 24 changer transitions 0/154 dead transitions.
[2024-06-14 15:50:04,372 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 154 transitions, 1512 flow
[2024-06-14 15:50:04,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:50:04,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:50:04,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 15:50:04,373 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:50:04,374 INFO  L175             Difference]: Start difference. First operand has 92 places, 120 transitions, 1072 flow. Second operand 7 states and 126 transitions.
[2024-06-14 15:50:04,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 154 transitions, 1512 flow
[2024-06-14 15:50:04,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 1484 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-14 15:50:04,395 INFO  L231             Difference]: Finished difference. Result has 95 places, 123 transitions, 1140 flow
[2024-06-14 15:50:04,395 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1140, PETRI_PLACES=95, PETRI_TRANSITIONS=123}
[2024-06-14 15:50:04,396 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places.
[2024-06-14 15:50:04,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 123 transitions, 1140 flow
[2024-06-14 15:50:04,396 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:04,396 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:04,396 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:04,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:50:04,396 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:04,397 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:04,397 INFO  L85        PathProgramCache]: Analyzing trace with hash -1610780025, now seen corresponding path program 1 times
[2024-06-14 15:50:04,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:04,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158520426]
[2024-06-14 15:50:04,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:04,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:04,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:11,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:11,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:11,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158520426]
[2024-06-14 15:50:11,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158520426] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:11,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:11,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:50:11,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289960597]
[2024-06-14 15:50:11,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:11,043 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:50:11,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:11,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:50:11,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:50:11,162 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:11,162 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 123 transitions, 1140 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:11,162 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:11,162 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:11,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:12,185 INFO  L124   PetriNetUnfolderBase]: 2147/3196 cut-off events.
[2024-06-14 15:50:12,186 INFO  L125   PetriNetUnfolderBase]: For 29049/29051 co-relation queries the response was YES.
[2024-06-14 15:50:12,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17303 conditions, 3196 events. 2147/3196 cut-off events. For 29049/29051 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14978 event pairs, 607 based on Foata normal form. 7/3202 useless extension candidates. Maximal degree in co-relation 17257. Up to 2926 conditions per place. 
[2024-06-14 15:50:12,203 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 123 selfloop transitions, 43 changer transitions 0/169 dead transitions.
[2024-06-14 15:50:12,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 169 transitions, 1769 flow
[2024-06-14 15:50:12,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:50:12,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:50:12,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-14 15:50:12,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4564459930313589
[2024-06-14 15:50:12,205 INFO  L175             Difference]: Start difference. First operand has 95 places, 123 transitions, 1140 flow. Second operand 7 states and 131 transitions.
[2024-06-14 15:50:12,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 169 transitions, 1769 flow
[2024-06-14 15:50:12,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 169 transitions, 1715 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-14 15:50:12,228 INFO  L231             Difference]: Finished difference. Result has 98 places, 136 transitions, 1357 flow
[2024-06-14 15:50:12,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1357, PETRI_PLACES=98, PETRI_TRANSITIONS=136}
[2024-06-14 15:50:12,228 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places.
[2024-06-14 15:50:12,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 136 transitions, 1357 flow
[2024-06-14 15:50:12,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:12,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:12,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:12,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:50:12,229 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:12,229 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:12,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -1551690341, now seen corresponding path program 2 times
[2024-06-14 15:50:12,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:12,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535734242]
[2024-06-14 15:50:12,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:12,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:12,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:19,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:19,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:19,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535734242]
[2024-06-14 15:50:19,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535734242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:19,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:19,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:50:19,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679579333]
[2024-06-14 15:50:19,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:19,236 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:50:19,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:19,236 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:50:19,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:50:19,308 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:19,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 136 transitions, 1357 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:19,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:19,309 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:19,309 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:20,272 INFO  L124   PetriNetUnfolderBase]: 2127/3167 cut-off events.
[2024-06-14 15:50:20,272 INFO  L125   PetriNetUnfolderBase]: For 33085/33087 co-relation queries the response was YES.
[2024-06-14 15:50:20,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18020 conditions, 3167 events. 2127/3167 cut-off events. For 33085/33087 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14822 event pairs, 609 based on Foata normal form. 7/3173 useless extension candidates. Maximal degree in co-relation 17972. Up to 2969 conditions per place. 
[2024-06-14 15:50:20,289 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 129 selfloop transitions, 33 changer transitions 0/165 dead transitions.
[2024-06-14 15:50:20,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 165 transitions, 1792 flow
[2024-06-14 15:50:20,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:50:20,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:50:20,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 15:50:20,291 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:50:20,291 INFO  L175             Difference]: Start difference. First operand has 98 places, 136 transitions, 1357 flow. Second operand 7 states and 126 transitions.
[2024-06-14 15:50:20,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 165 transitions, 1792 flow
[2024-06-14 15:50:20,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 165 transitions, 1695 flow, removed 37 selfloop flow, removed 3 redundant places.
[2024-06-14 15:50:20,322 INFO  L231             Difference]: Finished difference. Result has 102 places, 136 transitions, 1339 flow
[2024-06-14 15:50:20,323 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1339, PETRI_PLACES=102, PETRI_TRANSITIONS=136}
[2024-06-14 15:50:20,323 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places.
[2024-06-14 15:50:20,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 136 transitions, 1339 flow
[2024-06-14 15:50:20,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:20,323 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:20,324 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:20,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:50:20,324 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:20,324 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:20,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -1547965536, now seen corresponding path program 1 times
[2024-06-14 15:50:20,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:20,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110768887]
[2024-06-14 15:50:20,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:20,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:20,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:25,419 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:25,419 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:25,419 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110768887]
[2024-06-14 15:50:25,419 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110768887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:25,419 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:25,419 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:50:25,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689863639]
[2024-06-14 15:50:25,420 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:25,420 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:50:25,420 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:25,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:50:25,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:50:25,492 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:25,492 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 136 transitions, 1339 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:25,492 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:25,492 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:25,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:26,567 INFO  L124   PetriNetUnfolderBase]: 2181/3245 cut-off events.
[2024-06-14 15:50:26,567 INFO  L125   PetriNetUnfolderBase]: For 36595/36597 co-relation queries the response was YES.
[2024-06-14 15:50:26,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18700 conditions, 3245 events. 2181/3245 cut-off events. For 36595/36597 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15230 event pairs, 562 based on Foata normal form. 6/3250 useless extension candidates. Maximal degree in co-relation 18650. Up to 2786 conditions per place. 
[2024-06-14 15:50:26,588 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 116 selfloop transitions, 57 changer transitions 0/176 dead transitions.
[2024-06-14 15:50:26,589 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 176 transitions, 1952 flow
[2024-06-14 15:50:26,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:50:26,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:50:26,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 15:50:26,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329268292682927
[2024-06-14 15:50:26,591 INFO  L175             Difference]: Start difference. First operand has 102 places, 136 transitions, 1339 flow. Second operand 8 states and 142 transitions.
[2024-06-14 15:50:26,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 176 transitions, 1952 flow
[2024-06-14 15:50:26,628 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 176 transitions, 1851 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 15:50:26,631 INFO  L231             Difference]: Finished difference. Result has 105 places, 143 transitions, 1455 flow
[2024-06-14 15:50:26,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1455, PETRI_PLACES=105, PETRI_TRANSITIONS=143}
[2024-06-14 15:50:26,631 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places.
[2024-06-14 15:50:26,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 143 transitions, 1455 flow
[2024-06-14 15:50:26,633 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:26,633 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:26,633 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:26,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 15:50:26,634 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:26,634 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:26,634 INFO  L85        PathProgramCache]: Analyzing trace with hash -1606970590, now seen corresponding path program 2 times
[2024-06-14 15:50:26,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:26,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014226726]
[2024-06-14 15:50:26,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:26,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:26,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:31,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:31,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:31,697 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014226726]
[2024-06-14 15:50:31,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014226726] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:31,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:31,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:50:31,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241092508]
[2024-06-14 15:50:31,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:31,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:50:31,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:31,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:50:31,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:50:31,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:50:31,797 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 143 transitions, 1455 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:31,797 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:31,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:50:31,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:32,735 INFO  L124   PetriNetUnfolderBase]: 2161/3218 cut-off events.
[2024-06-14 15:50:32,736 INFO  L125   PetriNetUnfolderBase]: For 40034/40036 co-relation queries the response was YES.
[2024-06-14 15:50:32,747 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18966 conditions, 3218 events. 2161/3218 cut-off events. For 40034/40036 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15117 event pairs, 566 based on Foata normal form. 8/3225 useless extension candidates. Maximal degree in co-relation 18914. Up to 2774 conditions per place. 
[2024-06-14 15:50:32,758 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 116 selfloop transitions, 56 changer transitions 0/175 dead transitions.
[2024-06-14 15:50:32,758 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 175 transitions, 2015 flow
[2024-06-14 15:50:32,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:50:32,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:50:32,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-06-14 15:50:32,761 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.540650406504065
[2024-06-14 15:50:32,761 INFO  L175             Difference]: Start difference. First operand has 105 places, 143 transitions, 1455 flow. Second operand 6 states and 133 transitions.
[2024-06-14 15:50:32,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 175 transitions, 2015 flow
[2024-06-14 15:50:32,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 175 transitions, 1949 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-14 15:50:32,805 INFO  L231             Difference]: Finished difference. Result has 107 places, 143 transitions, 1513 flow
[2024-06-14 15:50:32,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1513, PETRI_PLACES=107, PETRI_TRANSITIONS=143}
[2024-06-14 15:50:32,806 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places.
[2024-06-14 15:50:32,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 143 transitions, 1513 flow
[2024-06-14 15:50:32,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:32,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:32,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:32,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 15:50:32,807 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:32,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:32,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -430262606, now seen corresponding path program 3 times
[2024-06-14 15:50:32,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:32,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987132561]
[2024-06-14 15:50:32,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:32,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:32,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:37,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:37,762 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:37,762 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987132561]
[2024-06-14 15:50:37,762 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987132561] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:37,762 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:37,762 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:50:37,762 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037910790]
[2024-06-14 15:50:37,762 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:37,763 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:50:37,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:37,763 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:50:37,763 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:50:37,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:50:37,877 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 143 transitions, 1513 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:37,877 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:37,877 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:50:37,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:38,789 INFO  L124   PetriNetUnfolderBase]: 2164/3222 cut-off events.
[2024-06-14 15:50:38,789 INFO  L125   PetriNetUnfolderBase]: For 43234/43236 co-relation queries the response was YES.
[2024-06-14 15:50:38,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19272 conditions, 3222 events. 2164/3222 cut-off events. For 43234/43236 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15111 event pairs, 619 based on Foata normal form. 6/3227 useless extension candidates. Maximal degree in co-relation 19220. Up to 3139 conditions per place. 
[2024-06-14 15:50:38,810 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 146 selfloop transitions, 18 changer transitions 0/167 dead transitions.
[2024-06-14 15:50:38,810 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 167 transitions, 1931 flow
[2024-06-14 15:50:38,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:50:38,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:50:38,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions.
[2024-06-14 15:50:38,812 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45934959349593496
[2024-06-14 15:50:38,812 INFO  L175             Difference]: Start difference. First operand has 107 places, 143 transitions, 1513 flow. Second operand 6 states and 113 transitions.
[2024-06-14 15:50:38,813 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 167 transitions, 1931 flow
[2024-06-14 15:50:38,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 167 transitions, 1824 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 15:50:38,852 INFO  L231             Difference]: Finished difference. Result has 109 places, 146 transitions, 1490 flow
[2024-06-14 15:50:38,852 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=109, PETRI_TRANSITIONS=146}
[2024-06-14 15:50:38,852 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 67 predicate places.
[2024-06-14 15:50:38,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 146 transitions, 1490 flow
[2024-06-14 15:50:38,853 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:38,853 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:38,853 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:38,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 15:50:38,853 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:38,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:38,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -429995479, now seen corresponding path program 1 times
[2024-06-14 15:50:38,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:38,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037149192]
[2024-06-14 15:50:38,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:38,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:38,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:45,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:45,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:45,174 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037149192]
[2024-06-14 15:50:45,174 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037149192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:45,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:45,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:45,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129681026]
[2024-06-14 15:50:45,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:45,175 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:45,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:45,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:45,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:45,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:45,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 146 transitions, 1490 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:45,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:45,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:45,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:46,361 INFO  L124   PetriNetUnfolderBase]: 2159/3213 cut-off events.
[2024-06-14 15:50:46,361 INFO  L125   PetriNetUnfolderBase]: For 45533/45533 co-relation queries the response was YES.
[2024-06-14 15:50:46,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19220 conditions, 3213 events. 2159/3213 cut-off events. For 45533/45533 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15042 event pairs, 609 based on Foata normal form. 2/3214 useless extension candidates. Maximal degree in co-relation 19167. Up to 3146 conditions per place. 
[2024-06-14 15:50:46,380 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 145 selfloop transitions, 19 changer transitions 0/167 dead transitions.
[2024-06-14 15:50:46,380 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 1885 flow
[2024-06-14 15:50:46,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:50:46,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:50:46,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-14 15:50:46,383 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:50:46,383 INFO  L175             Difference]: Start difference. First operand has 109 places, 146 transitions, 1490 flow. Second operand 7 states and 112 transitions.
[2024-06-14 15:50:46,383 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 1885 flow
[2024-06-14 15:50:46,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 167 transitions, 1845 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-14 15:50:46,427 INFO  L231             Difference]: Finished difference. Result has 112 places, 147 transitions, 1517 flow
[2024-06-14 15:50:46,427 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1517, PETRI_PLACES=112, PETRI_TRANSITIONS=147}
[2024-06-14 15:50:46,428 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places.
[2024-06-14 15:50:46,428 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 147 transitions, 1517 flow
[2024-06-14 15:50:46,428 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:46,428 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:46,428 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:46,428 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 15:50:46,428 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:46,429 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:46,429 INFO  L85        PathProgramCache]: Analyzing trace with hash -860616385, now seen corresponding path program 1 times
[2024-06-14 15:50:46,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:46,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463088060]
[2024-06-14 15:50:46,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:46,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:46,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:53,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:53,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:53,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463088060]
[2024-06-14 15:50:53,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463088060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:53,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:53,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:53,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635296544]
[2024-06-14 15:50:53,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:53,090 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:53,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:53,091 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:53,091 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:53,270 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:53,271 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 147 transitions, 1517 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:53,271 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:53,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:53,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:54,452 INFO  L124   PetriNetUnfolderBase]: 2287/3423 cut-off events.
[2024-06-14 15:50:54,452 INFO  L125   PetriNetUnfolderBase]: For 54441/54443 co-relation queries the response was YES.
[2024-06-14 15:50:54,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20648 conditions, 3423 events. 2287/3423 cut-off events. For 54441/54443 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16449 event pairs, 453 based on Foata normal form. 4/3426 useless extension candidates. Maximal degree in co-relation 20593. Up to 2732 conditions per place. 
[2024-06-14 15:50:54,474 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 134 selfloop transitions, 59 changer transitions 0/196 dead transitions.
[2024-06-14 15:50:54,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 196 transitions, 2335 flow
[2024-06-14 15:50:54,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:50:54,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:50:54,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 15:50:54,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603658536585366
[2024-06-14 15:50:54,477 INFO  L175             Difference]: Start difference. First operand has 112 places, 147 transitions, 1517 flow. Second operand 8 states and 151 transitions.
[2024-06-14 15:50:54,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 196 transitions, 2335 flow
[2024-06-14 15:50:54,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 196 transitions, 2303 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-14 15:50:54,533 INFO  L231             Difference]: Finished difference. Result has 116 places, 153 transitions, 1706 flow
[2024-06-14 15:50:54,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1706, PETRI_PLACES=116, PETRI_TRANSITIONS=153}
[2024-06-14 15:50:54,534 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places.
[2024-06-14 15:50:54,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 153 transitions, 1706 flow
[2024-06-14 15:50:54,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:54,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:54,534 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:54,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 15:50:54,534 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:54,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:54,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -860555935, now seen corresponding path program 2 times
[2024-06-14 15:50:54,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:54,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636065702]
[2024-06-14 15:50:54,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:54,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:54,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:01,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:01,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:01,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636065702]
[2024-06-14 15:51:01,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636065702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:01,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:01,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:51:01,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031125142]
[2024-06-14 15:51:01,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:01,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:51:01,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:01,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:51:01,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:51:01,695 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:01,695 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 153 transitions, 1706 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:01,695 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:01,695 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:01,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:03,019 INFO  L124   PetriNetUnfolderBase]: 2504/3740 cut-off events.
[2024-06-14 15:51:03,019 INFO  L125   PetriNetUnfolderBase]: For 70563/70565 co-relation queries the response was YES.
[2024-06-14 15:51:03,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23477 conditions, 3740 events. 2504/3740 cut-off events. For 70563/70565 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18251 event pairs, 606 based on Foata normal form. 31/3770 useless extension candidates. Maximal degree in co-relation 23420. Up to 3150 conditions per place. 
[2024-06-14 15:51:03,043 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 152 selfloop transitions, 74 changer transitions 0/229 dead transitions.
[2024-06-14 15:51:03,043 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 229 transitions, 2750 flow
[2024-06-14 15:51:03,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:03,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:03,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 15:51:03,045 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715447154471545
[2024-06-14 15:51:03,045 INFO  L175             Difference]: Start difference. First operand has 116 places, 153 transitions, 1706 flow. Second operand 9 states and 174 transitions.
[2024-06-14 15:51:03,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 229 transitions, 2750 flow
[2024-06-14 15:51:03,108 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 229 transitions, 2669 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-14 15:51:03,110 INFO  L231             Difference]: Finished difference. Result has 127 places, 179 transitions, 2239 flow
[2024-06-14 15:51:03,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2239, PETRI_PLACES=127, PETRI_TRANSITIONS=179}
[2024-06-14 15:51:03,111 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places.
[2024-06-14 15:51:03,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 179 transitions, 2239 flow
[2024-06-14 15:51:03,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:03,111 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:03,111 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:03,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 15:51:03,111 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:03,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:03,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -857754651, now seen corresponding path program 1 times
[2024-06-14 15:51:03,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:03,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882056798]
[2024-06-14 15:51:03,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:03,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:03,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:09,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:09,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:09,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882056798]
[2024-06-14 15:51:09,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882056798] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:09,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:09,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:51:09,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855188101]
[2024-06-14 15:51:09,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:09,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:51:09,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:09,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:51:09,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:51:09,686 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:09,687 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 179 transitions, 2239 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:09,687 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:09,687 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:09,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:10,852 INFO  L124   PetriNetUnfolderBase]: 2494/3726 cut-off events.
[2024-06-14 15:51:10,852 INFO  L125   PetriNetUnfolderBase]: For 83753/83755 co-relation queries the response was YES.
[2024-06-14 15:51:10,868 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26342 conditions, 3726 events. 2494/3726 cut-off events. For 83753/83755 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18170 event pairs, 599 based on Foata normal form. 6/3731 useless extension candidates. Maximal degree in co-relation 26278. Up to 3416 conditions per place. 
[2024-06-14 15:51:10,882 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 159 selfloop transitions, 48 changer transitions 0/210 dead transitions.
[2024-06-14 15:51:10,882 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 210 transitions, 2825 flow
[2024-06-14 15:51:10,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:51:10,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:51:10,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-14 15:51:10,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-14 15:51:10,884 INFO  L175             Difference]: Start difference. First operand has 127 places, 179 transitions, 2239 flow. Second operand 8 states and 140 transitions.
[2024-06-14 15:51:10,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 210 transitions, 2825 flow
[2024-06-14 15:51:11,004 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 210 transitions, 2725 flow, removed 49 selfloop flow, removed 1 redundant places.
[2024-06-14 15:51:11,006 INFO  L231             Difference]: Finished difference. Result has 134 places, 179 transitions, 2247 flow
[2024-06-14 15:51:11,007 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2139, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2247, PETRI_PLACES=134, PETRI_TRANSITIONS=179}
[2024-06-14 15:51:11,007 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places.
[2024-06-14 15:51:11,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 179 transitions, 2247 flow
[2024-06-14 15:51:11,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:11,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:11,007 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:11,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 15:51:11,008 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:11,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:11,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -742283557, now seen corresponding path program 1 times
[2024-06-14 15:51:11,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:11,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270019353]
[2024-06-14 15:51:11,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:11,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:11,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:17,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:17,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:17,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270019353]
[2024-06-14 15:51:17,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270019353] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:17,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:17,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:51:17,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433773180]
[2024-06-14 15:51:17,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:17,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:51:17,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:17,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:51:17,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:51:17,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:17,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 179 transitions, 2247 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:17,650 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:17,650 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:17,650 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:18,893 INFO  L124   PetriNetUnfolderBase]: 2603/3905 cut-off events.
[2024-06-14 15:51:18,893 INFO  L125   PetriNetUnfolderBase]: For 95623/95625 co-relation queries the response was YES.
[2024-06-14 15:51:18,908 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27174 conditions, 3905 events. 2603/3905 cut-off events. For 95623/95625 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19427 event pairs, 583 based on Foata normal form. 30/3934 useless extension candidates. Maximal degree in co-relation 27107. Up to 3315 conditions per place. 
[2024-06-14 15:51:18,920 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 158 selfloop transitions, 61 changer transitions 0/222 dead transitions.
[2024-06-14 15:51:18,920 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 222 transitions, 2939 flow
[2024-06-14 15:51:18,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:18,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:18,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-14 15:51:18,922 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:51:18,923 INFO  L175             Difference]: Start difference. First operand has 134 places, 179 transitions, 2247 flow. Second operand 9 states and 162 transitions.
[2024-06-14 15:51:18,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 222 transitions, 2939 flow
[2024-06-14 15:51:19,004 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 222 transitions, 2852 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 15:51:19,007 INFO  L231             Difference]: Finished difference. Result has 138 places, 182 transitions, 2336 flow
[2024-06-14 15:51:19,007 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2336, PETRI_PLACES=138, PETRI_TRANSITIONS=182}
[2024-06-14 15:51:19,007 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-14 15:51:19,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 182 transitions, 2336 flow
[2024-06-14 15:51:19,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:19,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:19,007 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:19,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 15:51:19,008 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:19,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:19,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -681132245, now seen corresponding path program 2 times
[2024-06-14 15:51:19,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:19,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314212201]
[2024-06-14 15:51:19,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:19,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:19,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:26,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:26,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:26,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314212201]
[2024-06-14 15:51:26,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314212201] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:26,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:26,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:26,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916390245]
[2024-06-14 15:51:26,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:26,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:26,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:26,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:26,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:26,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:26,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 182 transitions, 2336 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:26,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:26,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:26,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:27,521 INFO  L124   PetriNetUnfolderBase]: 2620/3931 cut-off events.
[2024-06-14 15:51:27,521 INFO  L125   PetriNetUnfolderBase]: For 95261/95261 co-relation queries the response was YES.
[2024-06-14 15:51:27,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27979 conditions, 3931 events. 2620/3931 cut-off events. For 95261/95261 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19571 event pairs, 664 based on Foata normal form. 4/3934 useless extension candidates. Maximal degree in co-relation 27911. Up to 3819 conditions per place. 
[2024-06-14 15:51:27,554 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 184 selfloop transitions, 27 changer transitions 0/214 dead transitions.
[2024-06-14 15:51:27,554 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 214 transitions, 2868 flow
[2024-06-14 15:51:27,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:27,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:27,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-14 15:51:27,557 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-14 15:51:27,557 INFO  L175             Difference]: Start difference. First operand has 138 places, 182 transitions, 2336 flow. Second operand 9 states and 142 transitions.
[2024-06-14 15:51:27,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 214 transitions, 2868 flow
[2024-06-14 15:51:27,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 214 transitions, 2726 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-14 15:51:27,652 INFO  L231             Difference]: Finished difference. Result has 140 places, 184 transitions, 2291 flow
[2024-06-14 15:51:27,652 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2291, PETRI_PLACES=140, PETRI_TRANSITIONS=184}
[2024-06-14 15:51:27,653 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places.
[2024-06-14 15:51:27,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 184 transitions, 2291 flow
[2024-06-14 15:51:27,653 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:27,653 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:27,653 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:27,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 15:51:27,654 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:27,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:27,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 1294250265, now seen corresponding path program 3 times
[2024-06-14 15:51:27,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:27,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155508405]
[2024-06-14 15:51:27,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:27,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:27,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:33,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:33,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:33,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155508405]
[2024-06-14 15:51:33,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155508405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:33,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:33,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:33,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620635312]
[2024-06-14 15:51:33,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:33,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:33,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:33,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:33,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:34,072 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:34,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 184 transitions, 2291 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:34,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:34,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:34,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:35,349 INFO  L124   PetriNetUnfolderBase]: 2637/3958 cut-off events.
[2024-06-14 15:51:35,350 INFO  L125   PetriNetUnfolderBase]: For 101067/101067 co-relation queries the response was YES.
[2024-06-14 15:51:35,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28118 conditions, 3958 events. 2637/3958 cut-off events. For 101067/101067 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19724 event pairs, 664 based on Foata normal form. 4/3961 useless extension candidates. Maximal degree in co-relation 28049. Up to 3882 conditions per place. 
[2024-06-14 15:51:35,378 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 193 selfloop transitions, 19 changer transitions 0/215 dead transitions.
[2024-06-14 15:51:35,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 215 transitions, 2825 flow
[2024-06-14 15:51:35,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:35,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:35,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions.
[2024-06-14 15:51:35,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37669376693766937
[2024-06-14 15:51:35,381 INFO  L175             Difference]: Start difference. First operand has 140 places, 184 transitions, 2291 flow. Second operand 9 states and 139 transitions.
[2024-06-14 15:51:35,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 215 transitions, 2825 flow
[2024-06-14 15:51:35,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 215 transitions, 2746 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-14 15:51:35,481 INFO  L231             Difference]: Finished difference. Result has 142 places, 186 transitions, 2297 flow
[2024-06-14 15:51:35,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2297, PETRI_PLACES=142, PETRI_TRANSITIONS=186}
[2024-06-14 15:51:35,482 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places.
[2024-06-14 15:51:35,482 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 186 transitions, 2297 flow
[2024-06-14 15:51:35,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:35,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:35,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:35,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 15:51:35,483 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:35,483 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:35,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 1302524475, now seen corresponding path program 4 times
[2024-06-14 15:51:35,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:35,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827965680]
[2024-06-14 15:51:35,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:35,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:35,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:41,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:41,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:41,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827965680]
[2024-06-14 15:51:41,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827965680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:41,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:41,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:41,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627077132]
[2024-06-14 15:51:41,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:41,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:41,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:41,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:41,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:42,113 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:42,114 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 186 transitions, 2297 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:42,114 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:42,114 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:42,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:43,412 INFO  L124   PetriNetUnfolderBase]: 2654/3985 cut-off events.
[2024-06-14 15:51:43,412 INFO  L125   PetriNetUnfolderBase]: For 107529/107529 co-relation queries the response was YES.
[2024-06-14 15:51:43,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28572 conditions, 3985 events. 2654/3985 cut-off events. For 107529/107529 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19876 event pairs, 669 based on Foata normal form. 4/3988 useless extension candidates. Maximal degree in co-relation 28502. Up to 3882 conditions per place. 
[2024-06-14 15:51:43,446 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 187 selfloop transitions, 23 changer transitions 0/213 dead transitions.
[2024-06-14 15:51:43,446 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 213 transitions, 2821 flow
[2024-06-14 15:51:43,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:51:43,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:51:43,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-14 15:51:43,448 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38414634146341464
[2024-06-14 15:51:43,448 INFO  L175             Difference]: Start difference. First operand has 142 places, 186 transitions, 2297 flow. Second operand 8 states and 126 transitions.
[2024-06-14 15:51:43,448 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 213 transitions, 2821 flow
[2024-06-14 15:51:43,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 213 transitions, 2754 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-14 15:51:43,562 INFO  L231             Difference]: Finished difference. Result has 143 places, 188 transitions, 2330 flow
[2024-06-14 15:51:43,562 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2330, PETRI_PLACES=143, PETRI_TRANSITIONS=188}
[2024-06-14 15:51:43,562 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places.
[2024-06-14 15:51:43,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 188 transitions, 2330 flow
[2024-06-14 15:51:43,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:43,563 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:43,563 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:43,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 15:51:43,563 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:43,563 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:43,564 INFO  L85        PathProgramCache]: Analyzing trace with hash 1302524227, now seen corresponding path program 1 times
[2024-06-14 15:51:43,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:43,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065127896]
[2024-06-14 15:51:43,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:43,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:43,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:50,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:50,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:50,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065127896]
[2024-06-14 15:51:50,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065127896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:50,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:50,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:51:50,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518838253]
[2024-06-14 15:51:50,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:50,200 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:51:50,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:50,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:51:50,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:51:50,311 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:50,311 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 188 transitions, 2330 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:50,311 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:50,311 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:50,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:51,625 INFO  L124   PetriNetUnfolderBase]: 2646/3974 cut-off events.
[2024-06-14 15:51:51,626 INFO  L125   PetriNetUnfolderBase]: For 112808/112810 co-relation queries the response was YES.
[2024-06-14 15:51:51,641 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28763 conditions, 3974 events. 2646/3974 cut-off events. For 112808/112810 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19810 event pairs, 673 based on Foata normal form. 4/3977 useless extension candidates. Maximal degree in co-relation 28692. Up to 3874 conditions per place. 
[2024-06-14 15:51:51,654 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 183 selfloop transitions, 24 changer transitions 0/210 dead transitions.
[2024-06-14 15:51:51,654 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 210 transitions, 2814 flow
[2024-06-14 15:51:51,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:51:51,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:51:51,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-14 15:51:51,656 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-14 15:51:51,656 INFO  L175             Difference]: Start difference. First operand has 143 places, 188 transitions, 2330 flow. Second operand 7 states and 114 transitions.
[2024-06-14 15:51:51,656 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 210 transitions, 2814 flow
[2024-06-14 15:51:51,759 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 210 transitions, 2734 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-14 15:51:51,761 INFO  L231             Difference]: Finished difference. Result has 144 places, 189 transitions, 2326 flow
[2024-06-14 15:51:51,762 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2326, PETRI_PLACES=144, PETRI_TRANSITIONS=189}
[2024-06-14 15:51:51,762 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places.
[2024-06-14 15:51:51,762 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 189 transitions, 2326 flow
[2024-06-14 15:51:51,762 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:51,762 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:51,762 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:51,763 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 15:51:51,763 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:51,763 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:51,763 INFO  L85        PathProgramCache]: Analyzing trace with hash -444660215, now seen corresponding path program 5 times
[2024-06-14 15:51:51,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:51,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651316119]
[2024-06-14 15:51:51,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:51,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:51,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:57,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:57,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:57,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651316119]
[2024-06-14 15:51:57,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651316119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:57,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:57,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:57,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041669068]
[2024-06-14 15:51:57,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:57,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:57,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:57,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:57,818 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:58,022 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:58,022 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 189 transitions, 2326 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:58,022 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:58,022 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:58,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:59,465 INFO  L124   PetriNetUnfolderBase]: 2718/4085 cut-off events.
[2024-06-14 15:51:59,465 INFO  L125   PetriNetUnfolderBase]: For 116453/116453 co-relation queries the response was YES.
[2024-06-14 15:51:59,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29030 conditions, 4085 events. 2718/4085 cut-off events. For 116453/116453 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20427 event pairs, 639 based on Foata normal form. 18/4102 useless extension candidates. Maximal degree in co-relation 28958. Up to 3832 conditions per place. 
[2024-06-14 15:51:59,492 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 198 selfloop transitions, 32 changer transitions 0/233 dead transitions.
[2024-06-14 15:51:59,492 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 233 transitions, 3043 flow
[2024-06-14 15:51:59,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:51:59,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:51:59,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 15:51:59,493 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-14 15:51:59,493 INFO  L175             Difference]: Start difference. First operand has 144 places, 189 transitions, 2326 flow. Second operand 8 states and 146 transitions.
[2024-06-14 15:51:59,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 233 transitions, 3043 flow
[2024-06-14 15:51:59,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 233 transitions, 2993 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-14 15:51:59,611 INFO  L231             Difference]: Finished difference. Result has 148 places, 195 transitions, 2446 flow
[2024-06-14 15:51:59,612 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2446, PETRI_PLACES=148, PETRI_TRANSITIONS=195}
[2024-06-14 15:51:59,612 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places.
[2024-06-14 15:51:59,612 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 195 transitions, 2446 flow
[2024-06-14 15:51:59,612 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:59,612 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:59,613 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:59,613 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 15:51:59,613 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:59,613 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:59,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 446957159, now seen corresponding path program 1 times
[2024-06-14 15:51:59,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:59,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522984873]
[2024-06-14 15:51:59,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:59,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:59,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:07,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:07,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:07,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522984873]
[2024-06-14 15:52:07,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522984873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:07,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:07,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:52:07,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080528794]
[2024-06-14 15:52:07,304 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:07,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:52:07,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:07,305 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:52:07,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:52:07,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:07,391 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 195 transitions, 2446 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:07,391 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:07,391 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:07,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:08,572 INFO  L124   PetriNetUnfolderBase]: 2697/4055 cut-off events.
[2024-06-14 15:52:08,572 INFO  L125   PetriNetUnfolderBase]: For 111078/111078 co-relation queries the response was YES.
[2024-06-14 15:52:08,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29515 conditions, 4055 events. 2697/4055 cut-off events. For 111078/111078 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 20357 event pairs, 677 based on Foata normal form. 4/4058 useless extension candidates. Maximal degree in co-relation 29441. Up to 3995 conditions per place. 
[2024-06-14 15:52:08,607 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 197 selfloop transitions, 18 changer transitions 0/218 dead transitions.
[2024-06-14 15:52:08,607 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 218 transitions, 3054 flow
[2024-06-14 15:52:08,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:52:08,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:52:08,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-14 15:52:08,608 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:52:08,608 INFO  L175             Difference]: Start difference. First operand has 148 places, 195 transitions, 2446 flow. Second operand 5 states and 90 transitions.
[2024-06-14 15:52:08,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 218 transitions, 3054 flow
[2024-06-14 15:52:08,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 218 transitions, 2954 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-14 15:52:08,736 INFO  L231             Difference]: Finished difference. Result has 148 places, 200 transitions, 2494 flow
[2024-06-14 15:52:08,737 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2494, PETRI_PLACES=148, PETRI_TRANSITIONS=200}
[2024-06-14 15:52:08,737 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places.
[2024-06-14 15:52:08,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 200 transitions, 2494 flow
[2024-06-14 15:52:08,738 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:08,738 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:08,738 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:08,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 15:52:08,738 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:08,738 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:08,738 INFO  L85        PathProgramCache]: Analyzing trace with hash -909303145, now seen corresponding path program 1 times
[2024-06-14 15:52:08,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:08,739 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536253055]
[2024-06-14 15:52:08,739 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:08,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:08,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:16,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:16,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:16,042 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536253055]
[2024-06-14 15:52:16,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536253055] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:16,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:16,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:16,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578073297]
[2024-06-14 15:52:16,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:16,043 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:16,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:16,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:16,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:16,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:16,153 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 200 transitions, 2494 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:16,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:16,154 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:16,154 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:18,261 INFO  L124   PetriNetUnfolderBase]: 4249/6488 cut-off events.
[2024-06-14 15:52:18,261 INFO  L125   PetriNetUnfolderBase]: For 252970/252972 co-relation queries the response was YES.
[2024-06-14 15:52:18,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47519 conditions, 6488 events. 4249/6488 cut-off events. For 252970/252972 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 36258 event pairs, 775 based on Foata normal form. 82/6569 useless extension candidates. Maximal degree in co-relation 47444. Up to 3099 conditions per place. 
[2024-06-14 15:52:18,321 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 209 selfloop transitions, 81 changer transitions 0/293 dead transitions.
[2024-06-14 15:52:18,322 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 293 transitions, 4076 flow
[2024-06-14 15:52:18,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:52:18,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:52:18,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-14 15:52:18,323 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5203252032520326
[2024-06-14 15:52:18,323 INFO  L175             Difference]: Start difference. First operand has 148 places, 200 transitions, 2494 flow. Second operand 9 states and 192 transitions.
[2024-06-14 15:52:18,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 293 transitions, 4076 flow
[2024-06-14 15:52:18,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 293 transitions, 4025 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-14 15:52:18,492 INFO  L231             Difference]: Finished difference. Result has 157 places, 220 transitions, 3101 flow
[2024-06-14 15:52:18,492 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3101, PETRI_PLACES=157, PETRI_TRANSITIONS=220}
[2024-06-14 15:52:18,493 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places.
[2024-06-14 15:52:18,493 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 220 transitions, 3101 flow
[2024-06-14 15:52:18,493 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:18,493 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:18,493 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:18,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 15:52:18,493 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:18,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:18,494 INFO  L85        PathProgramCache]: Analyzing trace with hash -907429195, now seen corresponding path program 2 times
[2024-06-14 15:52:18,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:18,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502941209]
[2024-06-14 15:52:18,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:18,494 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:18,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:25,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:25,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:25,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502941209]
[2024-06-14 15:52:25,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502941209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:25,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:25,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:25,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128302625]
[2024-06-14 15:52:25,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:25,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:25,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:25,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:25,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:25,928 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:25,929 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 220 transitions, 3101 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:25,929 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:25,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:25,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:28,633 INFO  L124   PetriNetUnfolderBase]: 5292/8111 cut-off events.
[2024-06-14 15:52:28,634 INFO  L125   PetriNetUnfolderBase]: For 357149/357151 co-relation queries the response was YES.
[2024-06-14 15:52:28,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63701 conditions, 8111 events. 5292/8111 cut-off events. For 357149/357151 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 47459 event pairs, 1393 based on Foata normal form. 82/8192 useless extension candidates. Maximal degree in co-relation 63622. Up to 5743 conditions per place. 
[2024-06-14 15:52:28,713 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 208 selfloop transitions, 87 changer transitions 6/304 dead transitions.
[2024-06-14 15:52:28,714 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 304 transitions, 4626 flow
[2024-06-14 15:52:28,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:28,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:28,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions.
[2024-06-14 15:52:28,715 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5024390243902439
[2024-06-14 15:52:28,715 INFO  L175             Difference]: Start difference. First operand has 157 places, 220 transitions, 3101 flow. Second operand 10 states and 206 transitions.
[2024-06-14 15:52:28,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 304 transitions, 4626 flow
[2024-06-14 15:52:29,155 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 304 transitions, 4498 flow, removed 60 selfloop flow, removed 2 redundant places.
[2024-06-14 15:52:29,159 INFO  L231             Difference]: Finished difference. Result has 166 places, 234 transitions, 3528 flow
[2024-06-14 15:52:29,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3528, PETRI_PLACES=166, PETRI_TRANSITIONS=234}
[2024-06-14 15:52:29,159 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 124 predicate places.
[2024-06-14 15:52:29,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 234 transitions, 3528 flow
[2024-06-14 15:52:29,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:29,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:29,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:29,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 15:52:29,160 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:29,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:29,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -1684509181, now seen corresponding path program 3 times
[2024-06-14 15:52:29,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:29,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061613044]
[2024-06-14 15:52:29,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:29,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:29,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:35,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:35,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:35,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061613044]
[2024-06-14 15:52:35,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061613044] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:35,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:35,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:35,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368443180]
[2024-06-14 15:52:35,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:35,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:35,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:35,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:35,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:35,779 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:35,779 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 234 transitions, 3528 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:35,779 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:35,779 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:35,779 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:38,330 INFO  L124   PetriNetUnfolderBase]: 5269/8078 cut-off events.
[2024-06-14 15:52:38,330 INFO  L125   PetriNetUnfolderBase]: For 340012/340014 co-relation queries the response was YES.
[2024-06-14 15:52:38,379 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64188 conditions, 8078 events. 5269/8078 cut-off events. For 340012/340014 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 47402 event pairs, 1873 based on Foata normal form. 22/8099 useless extension candidates. Maximal degree in co-relation 64106. Up to 7632 conditions per place. 
[2024-06-14 15:52:38,412 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 222 selfloop transitions, 53 changer transitions 0/278 dead transitions.
[2024-06-14 15:52:38,412 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 278 transitions, 4252 flow
[2024-06-14 15:52:38,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:38,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:38,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions.
[2024-06-14 15:52:38,415 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 15:52:38,415 INFO  L175             Difference]: Start difference. First operand has 166 places, 234 transitions, 3528 flow. Second operand 10 states and 170 transitions.
[2024-06-14 15:52:38,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 278 transitions, 4252 flow
[2024-06-14 15:52:38,845 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 278 transitions, 4095 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-14 15:52:38,848 INFO  L231             Difference]: Finished difference. Result has 171 places, 236 transitions, 3525 flow
[2024-06-14 15:52:38,848 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3371, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3525, PETRI_PLACES=171, PETRI_TRANSITIONS=236}
[2024-06-14 15:52:38,849 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places.
[2024-06-14 15:52:38,849 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 236 transitions, 3525 flow
[2024-06-14 15:52:38,849 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:38,849 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:38,849 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:38,849 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 15:52:38,850 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:38,850 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:38,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 435867703, now seen corresponding path program 4 times
[2024-06-14 15:52:38,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:38,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395049286]
[2024-06-14 15:52:38,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:38,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:38,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:45,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:45,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:45,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395049286]
[2024-06-14 15:52:45,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395049286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:45,037 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:45,037 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:52:45,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67872098]
[2024-06-14 15:52:45,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:45,037 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:52:45,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:45,038 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:52:45,038 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:52:45,184 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:52:45,184 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 236 transitions, 3525 flow. Second operand  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:45,184 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:45,184 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:52:45,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:47,705 INFO  L124   PetriNetUnfolderBase]: 5499/8461 cut-off events.
[2024-06-14 15:52:47,706 INFO  L125   PetriNetUnfolderBase]: For 367261/367263 co-relation queries the response was YES.
[2024-06-14 15:52:47,756 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67312 conditions, 8461 events. 5499/8461 cut-off events. For 367261/367263 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 50439 event pairs, 1812 based on Foata normal form. 16/8476 useless extension candidates. Maximal degree in co-relation 67228. Up to 7208 conditions per place. 
[2024-06-14 15:52:47,790 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 211 selfloop transitions, 68 changer transitions 0/282 dead transitions.
[2024-06-14 15:52:47,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 282 transitions, 4445 flow
[2024-06-14 15:52:47,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:52:47,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:52:47,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions.
[2024-06-14 15:52:47,793 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5296167247386759
[2024-06-14 15:52:47,793 INFO  L175             Difference]: Start difference. First operand has 171 places, 236 transitions, 3525 flow. Second operand 7 states and 152 transitions.
[2024-06-14 15:52:47,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 282 transitions, 4445 flow
[2024-06-14 15:52:48,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 282 transitions, 4351 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-14 15:52:48,278 INFO  L231             Difference]: Finished difference. Result has 173 places, 239 transitions, 3671 flow
[2024-06-14 15:52:48,278 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3431, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3671, PETRI_PLACES=173, PETRI_TRANSITIONS=239}
[2024-06-14 15:52:48,278 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places.
[2024-06-14 15:52:48,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 3671 flow
[2024-06-14 15:52:48,278 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:48,278 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:48,278 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:48,278 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 15:52:48,279 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:48,279 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:48,279 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889372939, now seen corresponding path program 5 times
[2024-06-14 15:52:48,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:48,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493037990]
[2024-06-14 15:52:48,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:48,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:48,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:53,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:53,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:53,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493037990]
[2024-06-14 15:52:53,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493037990] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:53,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:53,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:52:53,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059340542]
[2024-06-14 15:52:53,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:53,605 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:52:53,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:53,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:52:53,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:52:53,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:53,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 3671 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:53,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:53,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:53,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:56,465 INFO  L124   PetriNetUnfolderBase]: 5541/8535 cut-off events.
[2024-06-14 15:52:56,465 INFO  L125   PetriNetUnfolderBase]: For 388512/388514 co-relation queries the response was YES.
[2024-06-14 15:52:56,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68471 conditions, 8535 events. 5541/8535 cut-off events. For 388512/388514 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 51083 event pairs, 1957 based on Foata normal form. 24/8558 useless extension candidates. Maximal degree in co-relation 68386. Up to 7953 conditions per place. 
[2024-06-14 15:52:56,546 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 209 selfloop transitions, 66 changer transitions 0/278 dead transitions.
[2024-06-14 15:52:56,546 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 278 transitions, 4393 flow
[2024-06-14 15:52:56,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:52:56,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:52:56,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-14 15:52:56,548 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-14 15:52:56,548 INFO  L175             Difference]: Start difference. First operand has 173 places, 239 transitions, 3671 flow. Second operand 8 states and 148 transitions.
[2024-06-14 15:52:56,549 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 278 transitions, 4393 flow
[2024-06-14 15:52:57,108 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 278 transitions, 4294 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-14 15:52:57,111 INFO  L231             Difference]: Finished difference. Result has 178 places, 241 transitions, 3761 flow
[2024-06-14 15:52:57,112 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3574, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3761, PETRI_PLACES=178, PETRI_TRANSITIONS=241}
[2024-06-14 15:52:57,112 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places.
[2024-06-14 15:52:57,112 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 241 transitions, 3761 flow
[2024-06-14 15:52:57,112 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:57,112 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:57,112 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:57,112 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 15:52:57,112 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:57,113 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:57,113 INFO  L85        PathProgramCache]: Analyzing trace with hash 1895087231, now seen corresponding path program 1 times
[2024-06-14 15:52:57,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:57,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062269734]
[2024-06-14 15:52:57,113 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:57,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:57,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:04,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:04,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:04,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062269734]
[2024-06-14 15:53:04,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062269734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:04,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:04,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:53:04,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317009354]
[2024-06-14 15:53:04,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:04,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:53:04,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:04,673 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:53:04,673 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:53:04,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:04,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 241 transitions, 3761 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:04,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:04,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:04,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:07,875 INFO  L124   PetriNetUnfolderBase]: 5920/9073 cut-off events.
[2024-06-14 15:53:07,876 INFO  L125   PetriNetUnfolderBase]: For 431528/431530 co-relation queries the response was YES.
[2024-06-14 15:53:07,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74303 conditions, 9073 events. 5920/9073 cut-off events. For 431528/431530 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 54558 event pairs, 1956 based on Foata normal form. 26/9098 useless extension candidates. Maximal degree in co-relation 74215. Up to 8329 conditions per place. 
[2024-06-14 15:53:07,957 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 237 selfloop transitions, 79 changer transitions 0/319 dead transitions.
[2024-06-14 15:53:07,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 319 transitions, 5285 flow
[2024-06-14 15:53:07,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:07,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:07,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 15:53:07,959 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4742547425474255
[2024-06-14 15:53:07,959 INFO  L175             Difference]: Start difference. First operand has 178 places, 241 transitions, 3761 flow. Second operand 9 states and 175 transitions.
[2024-06-14 15:53:07,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 319 transitions, 5285 flow
[2024-06-14 15:53:08,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 319 transitions, 5132 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-14 15:53:08,482 INFO  L231             Difference]: Finished difference. Result has 184 places, 268 transitions, 4384 flow
[2024-06-14 15:53:08,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3608, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4384, PETRI_PLACES=184, PETRI_TRANSITIONS=268}
[2024-06-14 15:53:08,483 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places.
[2024-06-14 15:53:08,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 268 transitions, 4384 flow
[2024-06-14 15:53:08,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:08,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:08,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:08,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 15:53:08,483 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:08,483 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:08,483 INFO  L85        PathProgramCache]: Analyzing trace with hash -1536168161, now seen corresponding path program 6 times
[2024-06-14 15:53:08,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:08,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360218356]
[2024-06-14 15:53:08,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:08,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:08,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:15,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:15,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:15,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360218356]
[2024-06-14 15:53:15,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360218356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:15,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:15,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:53:15,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121017295]
[2024-06-14 15:53:15,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:15,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:53:15,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:15,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:53:15,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:53:15,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:15,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 268 transitions, 4384 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:15,405 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:15,405 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:15,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:18,272 INFO  L124   PetriNetUnfolderBase]: 5848/8961 cut-off events.
[2024-06-14 15:53:18,272 INFO  L125   PetriNetUnfolderBase]: For 463300/463302 co-relation queries the response was YES.
[2024-06-14 15:53:18,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75421 conditions, 8961 events. 5848/8961 cut-off events. For 463300/463302 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 53536 event pairs, 1869 based on Foata normal form. 42/9002 useless extension candidates. Maximal degree in co-relation 75329. Up to 8312 conditions per place. 
[2024-06-14 15:53:18,355 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 247 selfloop transitions, 62 changer transitions 0/312 dead transitions.
[2024-06-14 15:53:18,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 312 transitions, 5150 flow
[2024-06-14 15:53:18,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:18,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:18,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-14 15:53:18,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 15:53:18,357 INFO  L175             Difference]: Start difference. First operand has 184 places, 268 transitions, 4384 flow. Second operand 9 states and 164 transitions.
[2024-06-14 15:53:18,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 312 transitions, 5150 flow
[2024-06-14 15:53:19,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 312 transitions, 4944 flow, removed 98 selfloop flow, removed 2 redundant places.
[2024-06-14 15:53:19,052 INFO  L231             Difference]: Finished difference. Result has 191 places, 268 transitions, 4316 flow
[2024-06-14 15:53:19,052 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4178, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4316, PETRI_PLACES=191, PETRI_TRANSITIONS=268}
[2024-06-14 15:53:19,052 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places.
[2024-06-14 15:53:19,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 268 transitions, 4316 flow
[2024-06-14 15:53:19,053 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:19,053 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:19,053 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:19,053 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 15:53:19,053 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:19,053 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:19,053 INFO  L85        PathProgramCache]: Analyzing trace with hash 1895094671, now seen corresponding path program 2 times
[2024-06-14 15:53:19,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:19,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166536527]
[2024-06-14 15:53:19,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:19,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:19,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:26,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:26,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:26,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166536527]
[2024-06-14 15:53:26,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166536527] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:26,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:26,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:53:26,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235314350]
[2024-06-14 15:53:26,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:26,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:53:26,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:26,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:53:26,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:53:26,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:26,734 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 268 transitions, 4316 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:26,734 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:26,734 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:26,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:29,736 INFO  L124   PetriNetUnfolderBase]: 6081/9316 cut-off events.
[2024-06-14 15:53:29,736 INFO  L125   PetriNetUnfolderBase]: For 491782/491784 co-relation queries the response was YES.
[2024-06-14 15:53:29,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78727 conditions, 9316 events. 6081/9316 cut-off events. For 491782/491784 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 56305 event pairs, 1918 based on Foata normal form. 20/9335 useless extension candidates. Maximal degree in co-relation 78633. Up to 8172 conditions per place. 
[2024-06-14 15:53:29,837 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 242 selfloop transitions, 89 changer transitions 0/334 dead transitions.
[2024-06-14 15:53:29,838 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 334 transitions, 5715 flow
[2024-06-14 15:53:29,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:29,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:29,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-14 15:53:29,839 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4823848238482385
[2024-06-14 15:53:29,839 INFO  L175             Difference]: Start difference. First operand has 191 places, 268 transitions, 4316 flow. Second operand 9 states and 178 transitions.
[2024-06-14 15:53:29,839 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 334 transitions, 5715 flow
[2024-06-14 15:53:30,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 334 transitions, 5597 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 15:53:30,631 INFO  L231             Difference]: Finished difference. Result has 194 places, 276 transitions, 4596 flow
[2024-06-14 15:53:30,632 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4198, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4596, PETRI_PLACES=194, PETRI_TRANSITIONS=276}
[2024-06-14 15:53:30,632 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places.
[2024-06-14 15:53:30,632 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 276 transitions, 4596 flow
[2024-06-14 15:53:30,633 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:30,633 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:30,633 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:30,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 15:53:30,633 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:30,633 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:30,634 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331908111, now seen corresponding path program 3 times
[2024-06-14 15:53:30,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:30,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161070233]
[2024-06-14 15:53:30,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:30,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:30,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:37,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:37,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:37,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161070233]
[2024-06-14 15:53:37,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161070233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:37,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:37,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:53:37,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962193067]
[2024-06-14 15:53:37,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:37,935 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:53:37,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:37,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:53:37,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:53:38,052 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:38,052 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 276 transitions, 4596 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:38,052 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:38,052 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:38,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:41,344 INFO  L124   PetriNetUnfolderBase]: 6232/9545 cut-off events.
[2024-06-14 15:53:41,344 INFO  L125   PetriNetUnfolderBase]: For 533531/533533 co-relation queries the response was YES.
[2024-06-14 15:53:41,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82553 conditions, 9545 events. 6232/9545 cut-off events. For 533531/533533 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 57804 event pairs, 2140 based on Foata normal form. 26/9570 useless extension candidates. Maximal degree in co-relation 82457. Up to 9244 conditions per place. 
[2024-06-14 15:53:41,440 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 284 selfloop transitions, 46 changer transitions 0/333 dead transitions.
[2024-06-14 15:53:41,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 333 transitions, 5799 flow
[2024-06-14 15:53:41,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:41,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:41,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-14 15:53:41,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44986449864498645
[2024-06-14 15:53:41,442 INFO  L175             Difference]: Start difference. First operand has 194 places, 276 transitions, 4596 flow. Second operand 9 states and 166 transitions.
[2024-06-14 15:53:41,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 333 transitions, 5799 flow
[2024-06-14 15:53:42,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 333 transitions, 5636 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-14 15:53:42,162 INFO  L231             Difference]: Finished difference. Result has 201 places, 292 transitions, 4885 flow
[2024-06-14 15:53:42,163 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4444, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4885, PETRI_PLACES=201, PETRI_TRANSITIONS=292}
[2024-06-14 15:53:42,163 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places.
[2024-06-14 15:53:42,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 292 transitions, 4885 flow
[2024-06-14 15:53:42,163 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:42,164 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:42,164 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:42,164 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 15:53:42,164 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:42,164 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:42,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1165261229, now seen corresponding path program 4 times
[2024-06-14 15:53:42,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:42,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757542976]
[2024-06-14 15:53:42,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:42,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:42,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:49,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:49,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:49,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757542976]
[2024-06-14 15:53:49,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757542976] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:49,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:49,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:53:49,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268896780]
[2024-06-14 15:53:49,360 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:49,360 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:53:49,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:49,360 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:53:49,360 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:53:49,442 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:49,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 292 transitions, 4885 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:49,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:49,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:49,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:52,597 INFO  L124   PetriNetUnfolderBase]: 6249/9572 cut-off events.
[2024-06-14 15:53:52,597 INFO  L125   PetriNetUnfolderBase]: For 564945/564947 co-relation queries the response was YES.
[2024-06-14 15:53:52,665 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85198 conditions, 9572 events. 6249/9572 cut-off events. For 564945/564947 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 57938 event pairs, 2157 based on Foata normal form. 6/9577 useless extension candidates. Maximal degree in co-relation 85097. Up to 9431 conditions per place. 
[2024-06-14 15:53:52,706 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 298 selfloop transitions, 24 changer transitions 0/325 dead transitions.
[2024-06-14 15:53:52,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 325 transitions, 5686 flow
[2024-06-14 15:53:52,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:52,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:52,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-14 15:53:52,708 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-14 15:53:52,708 INFO  L175             Difference]: Start difference. First operand has 201 places, 292 transitions, 4885 flow. Second operand 9 states and 142 transitions.
[2024-06-14 15:53:52,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 325 transitions, 5686 flow
[2024-06-14 15:53:53,526 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 325 transitions, 5507 flow, removed 75 selfloop flow, removed 3 redundant places.
[2024-06-14 15:53:53,531 INFO  L231             Difference]: Finished difference. Result has 208 places, 295 transitions, 4852 flow
[2024-06-14 15:53:53,531 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4722, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4852, PETRI_PLACES=208, PETRI_TRANSITIONS=295}
[2024-06-14 15:53:53,531 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places.
[2024-06-14 15:53:53,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 295 transitions, 4852 flow
[2024-06-14 15:53:53,532 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:53,532 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:53,532 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:53,532 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 15:53:53,532 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:53,532 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:53,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -908768159, now seen corresponding path program 5 times
[2024-06-14 15:53:53,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:53,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873076638]
[2024-06-14 15:53:53,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:53,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:53,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:01,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:01,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:01,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873076638]
[2024-06-14 15:54:01,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873076638] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:01,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:01,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:01,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789672920]
[2024-06-14 15:54:01,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:01,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:01,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:01,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:01,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:01,305 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:54:01,306 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 295 transitions, 4852 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-06-14 15:54:01,306 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:01,306 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:54:01,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:04,610 INFO  L124   PetriNetUnfolderBase]: 6308/9669 cut-off events.
[2024-06-14 15:54:04,610 INFO  L125   PetriNetUnfolderBase]: For 596734/596736 co-relation queries the response was YES.
[2024-06-14 15:54:04,680 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85352 conditions, 9669 events. 6308/9669 cut-off events. For 596734/596736 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 58658 event pairs, 2140 based on Foata normal form. 24/9692 useless extension candidates. Maximal degree in co-relation 85248. Up to 9208 conditions per place. 
[2024-06-14 15:54:04,725 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 278 selfloop transitions, 60 changer transitions 0/341 dead transitions.
[2024-06-14 15:54:04,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 341 transitions, 6027 flow
[2024-06-14 15:54:04,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:54:04,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:54:04,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-14 15:54:04,726 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-14 15:54:04,727 INFO  L175             Difference]: Start difference. First operand has 208 places, 295 transitions, 4852 flow. Second operand 8 states and 156 transitions.
[2024-06-14 15:54:04,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 341 transitions, 6027 flow
[2024-06-14 15:54:05,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 341 transitions, 5930 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-14 15:54:05,493 INFO  L231             Difference]: Finished difference. Result has 212 places, 305 transitions, 5203 flow
[2024-06-14 15:54:05,494 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4755, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5203, PETRI_PLACES=212, PETRI_TRANSITIONS=305}
[2024-06-14 15:54:05,494 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-14 15:54:05,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 305 transitions, 5203 flow
[2024-06-14 15:54:05,494 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-06-14 15:54:05,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:05,495 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:05,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 15:54:05,495 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:05,495 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:05,495 INFO  L85        PathProgramCache]: Analyzing trace with hash -908760719, now seen corresponding path program 6 times
[2024-06-14 15:54:05,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:05,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135987479]
[2024-06-14 15:54:05,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:05,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:05,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:12,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:12,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:12,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135987479]
[2024-06-14 15:54:12,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135987479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:12,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:12,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:54:12,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727646]
[2024-06-14 15:54:12,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:12,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:54:12,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:12,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:54:12,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:54:13,115 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:54:13,115 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 305 transitions, 5203 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:13,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:13,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:54:13,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:16,312 INFO  L124   PetriNetUnfolderBase]: 6481/9936 cut-off events.
[2024-06-14 15:54:16,312 INFO  L125   PetriNetUnfolderBase]: For 664851/664853 co-relation queries the response was YES.
[2024-06-14 15:54:16,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90441 conditions, 9936 events. 6481/9936 cut-off events. For 664851/664853 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 60667 event pairs, 2143 based on Foata normal form. 20/9955 useless extension candidates. Maximal degree in co-relation 90334. Up to 9177 conditions per place. 
[2024-06-14 15:54:16,430 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 282 selfloop transitions, 66 changer transitions 0/351 dead transitions.
[2024-06-14 15:54:16,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 351 transitions, 6431 flow
[2024-06-14 15:54:16,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:54:16,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:54:16,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions.
[2024-06-14 15:54:16,431 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5296167247386759
[2024-06-14 15:54:16,431 INFO  L175             Difference]: Start difference. First operand has 212 places, 305 transitions, 5203 flow. Second operand 7 states and 152 transitions.
[2024-06-14 15:54:16,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 351 transitions, 6431 flow
[2024-06-14 15:54:17,482 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 351 transitions, 6244 flow, removed 79 selfloop flow, removed 3 redundant places.
[2024-06-14 15:54:17,487 INFO  L231             Difference]: Finished difference. Result has 217 places, 310 transitions, 5359 flow
[2024-06-14 15:54:17,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5032, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5359, PETRI_PLACES=217, PETRI_TRANSITIONS=310}
[2024-06-14 15:54:17,488 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places.
[2024-06-14 15:54:17,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 310 transitions, 5359 flow
[2024-06-14 15:54:17,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:17,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:17,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:17,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 15:54:17,489 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:17,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:17,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -899563949, now seen corresponding path program 7 times
[2024-06-14 15:54:17,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:17,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712081564]
[2024-06-14 15:54:17,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:17,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:17,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:24,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:24,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:24,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712081564]
[2024-06-14 15:54:24,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712081564] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:24,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:24,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:24,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721833475]
[2024-06-14 15:54:24,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:24,163 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:24,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:24,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:24,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:24,309 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:24,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 310 transitions, 5359 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:24,310 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:24,310 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:24,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:27,468 INFO  L124   PetriNetUnfolderBase]: 6473/9924 cut-off events.
[2024-06-14 15:54:27,468 INFO  L125   PetriNetUnfolderBase]: For 628104/628106 co-relation queries the response was YES.
[2024-06-14 15:54:27,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89526 conditions, 9924 events. 6473/9924 cut-off events. For 628104/628106 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 60541 event pairs, 2200 based on Foata normal form. 6/9929 useless extension candidates. Maximal degree in co-relation 89417. Up to 9819 conditions per place. 
[2024-06-14 15:54:27,595 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 318 selfloop transitions, 20 changer transitions 0/341 dead transitions.
[2024-06-14 15:54:27,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 341 transitions, 6210 flow
[2024-06-14 15:54:27,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:54:27,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:54:27,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions.
[2024-06-14 15:54:27,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36314363143631434
[2024-06-14 15:54:27,597 INFO  L175             Difference]: Start difference. First operand has 217 places, 310 transitions, 5359 flow. Second operand 9 states and 134 transitions.
[2024-06-14 15:54:27,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 341 transitions, 6210 flow
[2024-06-14 15:54:28,698 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 341 transitions, 6060 flow, removed 47 selfloop flow, removed 3 redundant places.
[2024-06-14 15:54:28,702 INFO  L231             Difference]: Finished difference. Result has 226 places, 316 transitions, 5388 flow
[2024-06-14 15:54:28,703 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5214, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5388, PETRI_PLACES=226, PETRI_TRANSITIONS=316}
[2024-06-14 15:54:28,703 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places.
[2024-06-14 15:54:28,703 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 316 transitions, 5388 flow
[2024-06-14 15:54:28,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:28,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:28,704 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:28,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 15:54:28,704 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:28,704 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:28,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 1612757647, now seen corresponding path program 1 times
[2024-06-14 15:54:28,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:28,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268142125]
[2024-06-14 15:54:28,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:28,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:28,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:36,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:36,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:36,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268142125]
[2024-06-14 15:54:36,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268142125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:36,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:36,533 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:54:36,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110957439]
[2024-06-14 15:54:36,533 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:36,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:54:36,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:36,534 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:54:36,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:54:36,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:36,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 316 transitions, 5388 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:36,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:36,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:36,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:39,704 INFO  L124   PetriNetUnfolderBase]: 6444/9885 cut-off events.
[2024-06-14 15:54:39,704 INFO  L125   PetriNetUnfolderBase]: For 620767/620769 co-relation queries the response was YES.
[2024-06-14 15:54:39,783 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88090 conditions, 9885 events. 6444/9885 cut-off events. For 620767/620769 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60458 event pairs, 1990 based on Foata normal form. 14/9898 useless extension candidates. Maximal degree in co-relation 87975. Up to 9523 conditions per place. 
[2024-06-14 15:54:39,828 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 281 selfloop transitions, 66 changer transitions 0/350 dead transitions.
[2024-06-14 15:54:39,828 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 350 transitions, 6488 flow
[2024-06-14 15:54:39,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:54:39,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:54:39,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-14 15:54:39,829 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46747967479674796
[2024-06-14 15:54:39,829 INFO  L175             Difference]: Start difference. First operand has 226 places, 316 transitions, 5388 flow. Second operand 6 states and 115 transitions.
[2024-06-14 15:54:39,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 350 transitions, 6488 flow
[2024-06-14 15:54:40,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 350 transitions, 6398 flow, removed 34 selfloop flow, removed 3 redundant places.
[2024-06-14 15:54:40,978 INFO  L231             Difference]: Finished difference. Result has 230 places, 325 transitions, 5724 flow
[2024-06-14 15:54:40,978 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5298, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5724, PETRI_PLACES=230, PETRI_TRANSITIONS=325}
[2024-06-14 15:54:40,979 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 188 predicate places.
[2024-06-14 15:54:40,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 325 transitions, 5724 flow
[2024-06-14 15:54:40,979 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:40,979 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:40,979 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:40,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 15:54:40,980 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:40,980 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:40,980 INFO  L85        PathProgramCache]: Analyzing trace with hash 558532967, now seen corresponding path program 1 times
[2024-06-14 15:54:40,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:40,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104198393]
[2024-06-14 15:54:40,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:40,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:41,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:49,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:49,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:49,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104198393]
[2024-06-14 15:54:49,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104198393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:49,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:49,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:54:49,618 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604618959]
[2024-06-14 15:54:49,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:49,618 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:54:49,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:49,619 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:54:49,619 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:54:49,830 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:49,830 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 325 transitions, 5724 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:49,830 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:49,830 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:49,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:53,136 INFO  L124   PetriNetUnfolderBase]: 6438/9876 cut-off events.
[2024-06-14 15:54:53,136 INFO  L125   PetriNetUnfolderBase]: For 635842/635842 co-relation queries the response was YES.
[2024-06-14 15:54:53,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89075 conditions, 9876 events. 6438/9876 cut-off events. For 635842/635842 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60362 event pairs, 2268 based on Foata normal form. 2/9877 useless extension candidates. Maximal degree in co-relation 88957. Up to 9779 conditions per place. 
[2024-06-14 15:54:53,242 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 313 selfloop transitions, 32 changer transitions 0/348 dead transitions.
[2024-06-14 15:54:53,242 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 348 transitions, 6542 flow
[2024-06-14 15:54:53,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:54:53,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:54:53,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-14 15:54:53,243 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38109756097560976
[2024-06-14 15:54:53,243 INFO  L175             Difference]: Start difference. First operand has 230 places, 325 transitions, 5724 flow. Second operand 8 states and 125 transitions.
[2024-06-14 15:54:53,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 348 transitions, 6542 flow
[2024-06-14 15:54:54,036 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 348 transitions, 6398 flow, removed 42 selfloop flow, removed 3 redundant places.
[2024-06-14 15:54:54,041 INFO  L231             Difference]: Finished difference. Result has 235 places, 328 transitions, 5715 flow
[2024-06-14 15:54:54,041 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5580, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5715, PETRI_PLACES=235, PETRI_TRANSITIONS=328}
[2024-06-14 15:54:54,041 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places.
[2024-06-14 15:54:54,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 328 transitions, 5715 flow
[2024-06-14 15:54:54,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:54,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:54,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:54,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 15:54:54,042 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:54,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:54,042 INFO  L85        PathProgramCache]: Analyzing trace with hash 971201951, now seen corresponding path program 1 times
[2024-06-14 15:54:54,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:54,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305898684]
[2024-06-14 15:54:54,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:54,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:54,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:03,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:03,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:03,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305898684]
[2024-06-14 15:55:03,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305898684] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:03,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:03,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:03,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482432195]
[2024-06-14 15:55:03,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:03,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:03,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:03,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:03,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:03,633 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:03,633 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 328 transitions, 5715 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:03,633 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:03,633 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:03,633 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:06,598 INFO  L124   PetriNetUnfolderBase]: 6433/9869 cut-off events.
[2024-06-14 15:55:06,598 INFO  L125   PetriNetUnfolderBase]: For 657719/657719 co-relation queries the response was YES.
[2024-06-14 15:55:06,681 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89499 conditions, 9869 events. 6433/9869 cut-off events. For 657719/657719 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60114 event pairs, 2281 based on Foata normal form. 2/9870 useless extension candidates. Maximal degree in co-relation 89380. Up to 9841 conditions per place. 
[2024-06-14 15:55:06,727 INFO  L140   encePairwiseOnDemand]: 35/41 looper letters, 326 selfloop transitions, 11 changer transitions 0/340 dead transitions.
[2024-06-14 15:55:06,727 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 340 transitions, 6457 flow
[2024-06-14 15:55:06,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:55:06,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:55:06,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2024-06-14 15:55:06,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3951219512195122
[2024-06-14 15:55:06,728 INFO  L175             Difference]: Start difference. First operand has 235 places, 328 transitions, 5715 flow. Second operand 5 states and 81 transitions.
[2024-06-14 15:55:06,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 340 transitions, 6457 flow
[2024-06-14 15:55:07,903 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 340 transitions, 6345 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-14 15:55:07,908 INFO  L231             Difference]: Finished difference. Result has 234 places, 330 transitions, 5670 flow
[2024-06-14 15:55:07,908 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5603, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5670, PETRI_PLACES=234, PETRI_TRANSITIONS=330}
[2024-06-14 15:55:07,909 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places.
[2024-06-14 15:55:07,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 330 transitions, 5670 flow
[2024-06-14 15:55:07,909 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:07,909 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:07,909 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:07,909 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 15:55:07,910 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:07,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:07,910 INFO  L85        PathProgramCache]: Analyzing trace with hash -679991688, now seen corresponding path program 1 times
[2024-06-14 15:55:07,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:07,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798088438]
[2024-06-14 15:55:07,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:07,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:07,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:15,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:15,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:15,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798088438]
[2024-06-14 15:55:15,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798088438] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:15,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:15,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:15,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427870459]
[2024-06-14 15:55:15,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:15,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:15,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:15,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:15,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:15,731 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:55:15,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 330 transitions, 5670 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:15,732 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:15,732 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:55:15,732 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:18,951 INFO  L124   PetriNetUnfolderBase]: 6413/9839 cut-off events.
[2024-06-14 15:55:18,951 INFO  L125   PetriNetUnfolderBase]: For 675611/675613 co-relation queries the response was YES.
[2024-06-14 15:55:19,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89318 conditions, 9839 events. 6413/9839 cut-off events. For 675611/675613 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 60020 event pairs, 2096 based on Foata normal form. 12/9850 useless extension candidates. Maximal degree in co-relation 89199. Up to 9457 conditions per place. 
[2024-06-14 15:55:19,071 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 315 selfloop transitions, 47 changer transitions 0/365 dead transitions.
[2024-06-14 15:55:19,071 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 365 transitions, 6504 flow
[2024-06-14 15:55:19,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:55:19,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:55:19,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 15:55:19,073 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4695121951219512
[2024-06-14 15:55:19,073 INFO  L175             Difference]: Start difference. First operand has 234 places, 330 transitions, 5670 flow. Second operand 8 states and 154 transitions.
[2024-06-14 15:55:19,074 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 365 transitions, 6504 flow
[2024-06-14 15:55:20,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 365 transitions, 6453 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-14 15:55:20,167 INFO  L231             Difference]: Finished difference. Result has 239 places, 330 transitions, 5719 flow
[2024-06-14 15:55:20,167 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5619, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5719, PETRI_PLACES=239, PETRI_TRANSITIONS=330}
[2024-06-14 15:55:20,167 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 197 predicate places.
[2024-06-14 15:55:20,167 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 330 transitions, 5719 flow
[2024-06-14 15:55:20,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:20,168 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:20,168 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:20,168 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 15:55:20,168 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:20,168 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:20,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 349104932, now seen corresponding path program 1 times
[2024-06-14 15:55:20,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:20,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206110273]
[2024-06-14 15:55:20,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:20,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:20,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:30,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:30,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:30,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206110273]
[2024-06-14 15:55:30,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206110273] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:30,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:30,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:30,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508776633]
[2024-06-14 15:55:30,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:30,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:30,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:30,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:30,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:30,551 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:30,551 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 330 transitions, 5719 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:30,551 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:30,551 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:30,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:33,730 INFO  L124   PetriNetUnfolderBase]: 6445/9883 cut-off events.
[2024-06-14 15:55:33,730 INFO  L125   PetriNetUnfolderBase]: For 691973/691975 co-relation queries the response was YES.
[2024-06-14 15:55:33,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90358 conditions, 9883 events. 6445/9883 cut-off events. For 691973/691975 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 60329 event pairs, 2095 based on Foata normal form. 4/9886 useless extension candidates. Maximal degree in co-relation 90239. Up to 9621 conditions per place. 
[2024-06-14 15:55:33,850 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 322 selfloop transitions, 48 changer transitions 0/373 dead transitions.
[2024-06-14 15:55:33,850 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 373 transitions, 6743 flow
[2024-06-14 15:55:33,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:55:33,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:55:33,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-14 15:55:33,853 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4281842818428184
[2024-06-14 15:55:33,853 INFO  L175             Difference]: Start difference. First operand has 239 places, 330 transitions, 5719 flow. Second operand 9 states and 158 transitions.
[2024-06-14 15:55:33,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 373 transitions, 6743 flow
[2024-06-14 15:55:34,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 373 transitions, 6639 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-14 15:55:34,987 INFO  L231             Difference]: Finished difference. Result has 244 places, 338 transitions, 5890 flow
[2024-06-14 15:55:34,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5615, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5890, PETRI_PLACES=244, PETRI_TRANSITIONS=338}
[2024-06-14 15:55:34,988 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places.
[2024-06-14 15:55:34,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 338 transitions, 5890 flow
[2024-06-14 15:55:34,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:34,988 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:34,988 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:34,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 15:55:34,988 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:34,989 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:34,989 INFO  L85        PathProgramCache]: Analyzing trace with hash -1388093234, now seen corresponding path program 2 times
[2024-06-14 15:55:34,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:34,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912661326]
[2024-06-14 15:55:34,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:34,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:35,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:42,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:42,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:42,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912661326]
[2024-06-14 15:55:42,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912661326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:42,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:42,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:55:42,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537666603]
[2024-06-14 15:55:42,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:42,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:55:42,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:42,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:55:42,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:55:42,401 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:42,401 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 338 transitions, 5890 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:42,401 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:42,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:42,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:45,641 INFO  L124   PetriNetUnfolderBase]: 6405/9820 cut-off events.
[2024-06-14 15:55:45,641 INFO  L125   PetriNetUnfolderBase]: For 713597/713599 co-relation queries the response was YES.
[2024-06-14 15:55:45,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90023 conditions, 9820 events. 6405/9820 cut-off events. For 713597/713599 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 59781 event pairs, 2064 based on Foata normal form. 24/9843 useless extension candidates. Maximal degree in co-relation 89902. Up to 9313 conditions per place. 
[2024-06-14 15:55:45,775 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 321 selfloop transitions, 60 changer transitions 0/384 dead transitions.
[2024-06-14 15:55:45,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 384 transitions, 6820 flow
[2024-06-14 15:55:45,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:55:45,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:55:45,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions.
[2024-06-14 15:55:45,777 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4195121951219512
[2024-06-14 15:55:45,778 INFO  L175             Difference]: Start difference. First operand has 244 places, 338 transitions, 5890 flow. Second operand 10 states and 172 transitions.
[2024-06-14 15:55:45,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 384 transitions, 6820 flow
[2024-06-14 15:55:47,127 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 384 transitions, 6617 flow, removed 57 selfloop flow, removed 6 redundant places.
[2024-06-14 15:55:47,132 INFO  L231             Difference]: Finished difference. Result has 249 places, 340 transitions, 5857 flow
[2024-06-14 15:55:47,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5687, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5857, PETRI_PLACES=249, PETRI_TRANSITIONS=340}
[2024-06-14 15:55:47,133 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places.
[2024-06-14 15:55:47,133 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 340 transitions, 5857 flow
[2024-06-14 15:55:47,133 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:47,133 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:47,133 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:47,133 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 15:55:47,134 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:47,134 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:47,134 INFO  L85        PathProgramCache]: Analyzing trace with hash -1381606484, now seen corresponding path program 3 times
[2024-06-14 15:55:47,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:47,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389617620]
[2024-06-14 15:55:47,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:47,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:47,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:54,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:54,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:54,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389617620]
[2024-06-14 15:55:54,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389617620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:54,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:54,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:55:54,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290686224]
[2024-06-14 15:55:54,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:54,911 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:55:54,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:54,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:55:54,912 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:55:55,132 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:55,132 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 340 transitions, 5857 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:55,132 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:55,132 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:55,132 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:58,447 INFO  L124   PetriNetUnfolderBase]: 6717/10317 cut-off events.
[2024-06-14 15:55:58,447 INFO  L125   PetriNetUnfolderBase]: For 748224/748226 co-relation queries the response was YES.
[2024-06-14 15:55:58,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94292 conditions, 10317 events. 6717/10317 cut-off events. For 748224/748226 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 63345 event pairs, 2194 based on Foata normal form. 26/10342 useless extension candidates. Maximal degree in co-relation 94169. Up to 9651 conditions per place. 
[2024-06-14 15:55:58,601 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 337 selfloop transitions, 66 changer transitions 0/406 dead transitions.
[2024-06-14 15:55:58,601 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 406 transitions, 7467 flow
[2024-06-14 15:55:58,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:55:58,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:55:58,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-06-14 15:55:58,603 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 15:55:58,603 INFO  L175             Difference]: Start difference. First operand has 249 places, 340 transitions, 5857 flow. Second operand 10 states and 155 transitions.
[2024-06-14 15:55:58,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 406 transitions, 7467 flow
[2024-06-14 15:55:59,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 406 transitions, 7171 flow, removed 19 selfloop flow, removed 9 redundant places.
[2024-06-14 15:55:59,949 INFO  L231             Difference]: Finished difference. Result has 253 places, 366 transitions, 6366 flow
[2024-06-14 15:55:59,949 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5629, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6366, PETRI_PLACES=253, PETRI_TRANSITIONS=366}
[2024-06-14 15:55:59,949 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places.
[2024-06-14 15:55:59,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 366 transitions, 6366 flow
[2024-06-14 15:55:59,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:59,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:59,949 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:59,950 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 15:55:59,950 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:59,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:59,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 1191179032, now seen corresponding path program 1 times
[2024-06-14 15:55:59,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:59,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30086942]
[2024-06-14 15:55:59,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:59,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:00,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:09,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:09,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:09,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30086942]
[2024-06-14 15:56:09,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30086942] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:09,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:09,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:56:09,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616422054]
[2024-06-14 15:56:09,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:09,041 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:56:09,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:09,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:56:09,042 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:56:09,164 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:09,164 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 366 transitions, 6366 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:09,164 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:09,164 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:09,164 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:12,477 INFO  L124   PetriNetUnfolderBase]: 6762/10379 cut-off events.
[2024-06-14 15:56:12,477 INFO  L125   PetriNetUnfolderBase]: For 758065/758065 co-relation queries the response was YES.
[2024-06-14 15:56:12,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95633 conditions, 10379 events. 6762/10379 cut-off events. For 758065/758065 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 63528 event pairs, 2381 based on Foata normal form. 6/10384 useless extension candidates. Maximal degree in co-relation 95506. Up to 10299 conditions per place. 
[2024-06-14 15:56:12,597 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 363 selfloop transitions, 30 changer transitions 0/396 dead transitions.
[2024-06-14 15:56:12,597 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 396 transitions, 7489 flow
[2024-06-14 15:56:12,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:12,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:12,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions.
[2024-06-14 15:56:12,598 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36890243902439024
[2024-06-14 15:56:12,598 INFO  L175             Difference]: Start difference. First operand has 253 places, 366 transitions, 6366 flow. Second operand 8 states and 121 transitions.
[2024-06-14 15:56:12,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 396 transitions, 7489 flow
[2024-06-14 15:56:13,956 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 396 transitions, 7358 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-14 15:56:13,961 INFO  L231             Difference]: Finished difference. Result has 256 places, 378 transitions, 6569 flow
[2024-06-14 15:56:13,962 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6235, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6569, PETRI_PLACES=256, PETRI_TRANSITIONS=378}
[2024-06-14 15:56:13,962 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 214 predicate places.
[2024-06-14 15:56:13,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 378 transitions, 6569 flow
[2024-06-14 15:56:13,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:13,962 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:13,962 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:13,963 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 15:56:13,963 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:13,963 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:13,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 211185322, now seen corresponding path program 4 times
[2024-06-14 15:56:13,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:13,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284002835]
[2024-06-14 15:56:13,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:13,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:14,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:21,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:21,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:21,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284002835]
[2024-06-14 15:56:21,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284002835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:21,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:21,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:56:21,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112655783]
[2024-06-14 15:56:21,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:21,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:56:21,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:21,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:56:21,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:56:21,246 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:21,247 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 378 transitions, 6569 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:21,247 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:21,247 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:21,247 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:24,509 INFO  L124   PetriNetUnfolderBase]: 6742/10349 cut-off events.
[2024-06-14 15:56:24,509 INFO  L125   PetriNetUnfolderBase]: For 773053/773055 co-relation queries the response was YES.
[2024-06-14 15:56:24,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94929 conditions, 10349 events. 6742/10349 cut-off events. For 773053/773055 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 63287 event pairs, 2270 based on Foata normal form. 12/10360 useless extension candidates. Maximal degree in co-relation 94801. Up to 10165 conditions per place. 
[2024-06-14 15:56:24,849 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 384 selfloop transitions, 19 changer transitions 0/406 dead transitions.
[2024-06-14 15:56:24,850 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 406 transitions, 7459 flow
[2024-06-14 15:56:24,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:24,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:24,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-14 15:56:24,852 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:56:24,852 INFO  L175             Difference]: Start difference. First operand has 256 places, 378 transitions, 6569 flow. Second operand 8 states and 128 transitions.
[2024-06-14 15:56:24,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 406 transitions, 7459 flow
[2024-06-14 15:56:26,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 406 transitions, 7306 flow, removed 52 selfloop flow, removed 5 redundant places.
[2024-06-14 15:56:26,172 INFO  L231             Difference]: Finished difference. Result has 259 places, 378 transitions, 6460 flow
[2024-06-14 15:56:26,172 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6416, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6460, PETRI_PLACES=259, PETRI_TRANSITIONS=378}
[2024-06-14 15:56:26,173 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-14 15:56:26,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 378 transitions, 6460 flow
[2024-06-14 15:56:26,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:26,173 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:26,173 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:26,173 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 15:56:26,173 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:26,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:26,174 INFO  L85        PathProgramCache]: Analyzing trace with hash -394721190, now seen corresponding path program 2 times
[2024-06-14 15:56:26,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:26,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850862090]
[2024-06-14 15:56:26,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:26,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:26,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:33,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:33,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:33,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850862090]
[2024-06-14 15:56:33,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850862090] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:33,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:33,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:56:33,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312612040]
[2024-06-14 15:56:33,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:33,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:56:33,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:33,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:56:33,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:56:33,949 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:33,950 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 378 transitions, 6460 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:33,950 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:33,950 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:33,950 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:37,255 INFO  L124   PetriNetUnfolderBase]: 6722/10319 cut-off events.
[2024-06-14 15:56:37,255 INFO  L125   PetriNetUnfolderBase]: For 786267/786267 co-relation queries the response was YES.
[2024-06-14 15:56:37,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94670 conditions, 10319 events. 6722/10319 cut-off events. For 786267/786267 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 63121 event pairs, 2359 based on Foata normal form. 6/10324 useless extension candidates. Maximal degree in co-relation 94541. Up to 10203 conditions per place. 
[2024-06-14 15:56:37,412 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 357 selfloop transitions, 40 changer transitions 0/400 dead transitions.
[2024-06-14 15:56:37,412 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 400 transitions, 7428 flow
[2024-06-14 15:56:37,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:56:37,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:56:37,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions.
[2024-06-14 15:56:37,413 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42276422764227645
[2024-06-14 15:56:37,413 INFO  L175             Difference]: Start difference. First operand has 259 places, 378 transitions, 6460 flow. Second operand 6 states and 104 transitions.
[2024-06-14 15:56:37,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 400 transitions, 7428 flow
[2024-06-14 15:56:39,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 400 transitions, 7319 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-14 15:56:39,142 INFO  L231             Difference]: Finished difference. Result has 258 places, 381 transitions, 6551 flow
[2024-06-14 15:56:39,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6351, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6551, PETRI_PLACES=258, PETRI_TRANSITIONS=381}
[2024-06-14 15:56:39,142 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 216 predicate places.
[2024-06-14 15:56:39,142 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 381 transitions, 6551 flow
[2024-06-14 15:56:39,142 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:39,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:39,143 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:39,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 15:56:39,143 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:39,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:39,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 749476946, now seen corresponding path program 2 times
[2024-06-14 15:56:39,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:39,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972655572]
[2024-06-14 15:56:39,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:39,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:39,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:47,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:47,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:47,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972655572]
[2024-06-14 15:56:47,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972655572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:47,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:47,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:56:47,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826603594]
[2024-06-14 15:56:47,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:47,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:56:47,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:47,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:56:47,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:56:48,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:48,085 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 381 transitions, 6551 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:48,085 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:48,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:48,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:51,580 INFO  L124   PetriNetUnfolderBase]: 6833/10472 cut-off events.
[2024-06-14 15:56:51,580 INFO  L125   PetriNetUnfolderBase]: For 825779/825787 co-relation queries the response was YES.
[2024-06-14 15:56:51,666 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96525 conditions, 10472 events. 6833/10472 cut-off events. For 825779/825787 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 64131 event pairs, 2045 based on Foata normal form. 22/10493 useless extension candidates. Maximal degree in co-relation 96396. Up to 9386 conditions per place. 
[2024-06-14 15:56:51,713 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 287 selfloop transitions, 153 changer transitions 0/443 dead transitions.
[2024-06-14 15:56:51,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 443 transitions, 8202 flow
[2024-06-14 15:56:51,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:51,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:51,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-14 15:56:51,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49085365853658536
[2024-06-14 15:56:51,714 INFO  L175             Difference]: Start difference. First operand has 258 places, 381 transitions, 6551 flow. Second operand 8 states and 161 transitions.
[2024-06-14 15:56:51,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 443 transitions, 8202 flow
[2024-06-14 15:56:53,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 443 transitions, 8071 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-14 15:56:53,203 INFO  L231             Difference]: Finished difference. Result has 263 places, 401 transitions, 7330 flow
[2024-06-14 15:56:53,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6440, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7330, PETRI_PLACES=263, PETRI_TRANSITIONS=401}
[2024-06-14 15:56:53,204 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 221 predicate places.
[2024-06-14 15:56:53,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 401 transitions, 7330 flow
[2024-06-14 15:56:53,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:53,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:53,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:53,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 15:56:53,204 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:53,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:53,205 INFO  L85        PathProgramCache]: Analyzing trace with hash 1069352936, now seen corresponding path program 5 times
[2024-06-14 15:56:53,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:53,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387457172]
[2024-06-14 15:56:53,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:53,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:53,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:01,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:01,896 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:01,896 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387457172]
[2024-06-14 15:57:01,896 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387457172] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:01,896 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:01,896 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:57:01,896 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102767750]
[2024-06-14 15:57:01,896 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:01,897 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:57:01,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:01,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:57:01,897 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:57:02,054 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:02,055 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 401 transitions, 7330 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:02,055 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:02,055 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:02,055 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:06,259 INFO  L124   PetriNetUnfolderBase]: 8222/12581 cut-off events.
[2024-06-14 15:57:06,260 INFO  L125   PetriNetUnfolderBase]: For 1067425/1067427 co-relation queries the response was YES.
[2024-06-14 15:57:06,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120583 conditions, 12581 events. 8222/12581 cut-off events. For 1067425/1067427 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 78825 event pairs, 2298 based on Foata normal form. 68/12648 useless extension candidates. Maximal degree in co-relation 120452. Up to 10463 conditions per place. 
[2024-06-14 15:57:06,446 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 445 selfloop transitions, 105 changer transitions 0/553 dead transitions.
[2024-06-14 15:57:06,446 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 553 transitions, 10884 flow
[2024-06-14 15:57:06,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:57:06,447 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:57:06,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-14 15:57:06,448 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48048780487804876
[2024-06-14 15:57:06,448 INFO  L175             Difference]: Start difference. First operand has 263 places, 401 transitions, 7330 flow. Second operand 10 states and 197 transitions.
[2024-06-14 15:57:06,448 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 553 transitions, 10884 flow
[2024-06-14 15:57:09,095 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 553 transitions, 10521 flow, removed 71 selfloop flow, removed 9 redundant places.
[2024-06-14 15:57:09,102 INFO  L231             Difference]: Finished difference. Result has 268 places, 472 transitions, 8863 flow
[2024-06-14 15:57:09,102 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6951, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8863, PETRI_PLACES=268, PETRI_TRANSITIONS=472}
[2024-06-14 15:57:09,103 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places.
[2024-06-14 15:57:09,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 268 places, 472 transitions, 8863 flow
[2024-06-14 15:57:09,103 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:09,103 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:09,103 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:09,103 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:57:09,103 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:09,103 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:09,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 134654113, now seen corresponding path program 1 times
[2024-06-14 15:57:09,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:09,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604075971]
[2024-06-14 15:57:09,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:09,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:09,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:19,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:19,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:19,810 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604075971]
[2024-06-14 15:57:19,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604075971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:19,811 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:19,811 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:57:19,811 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758020673]
[2024-06-14 15:57:19,811 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:19,811 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:57:19,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:19,812 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:57:19,812 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:57:20,054 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:20,054 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 472 transitions, 8863 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:20,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:20,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:20,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:23,992 INFO  L124   PetriNetUnfolderBase]: 8242/12609 cut-off events.
[2024-06-14 15:57:23,992 INFO  L125   PetriNetUnfolderBase]: For 894505/894505 co-relation queries the response was YES.
[2024-06-14 15:57:24,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120596 conditions, 12609 events. 8242/12609 cut-off events. For 894505/894505 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 79112 event pairs, 3114 based on Foata normal form. 4/12612 useless extension candidates. Maximal degree in co-relation 120464. Up to 12446 conditions per place. 
[2024-06-14 15:57:24,177 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 458 selfloop transitions, 41 changer transitions 0/502 dead transitions.
[2024-06-14 15:57:24,177 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 502 transitions, 10169 flow
[2024-06-14 15:57:24,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:57:24,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:57:24,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-14 15:57:24,178 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37398373983739835
[2024-06-14 15:57:24,179 INFO  L175             Difference]: Start difference. First operand has 268 places, 472 transitions, 8863 flow. Second operand 9 states and 138 transitions.
[2024-06-14 15:57:24,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 502 transitions, 10169 flow
[2024-06-14 15:57:26,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 502 transitions, 9951 flow, removed 70 selfloop flow, removed 3 redundant places.
[2024-06-14 15:57:26,424 INFO  L231             Difference]: Finished difference. Result has 274 places, 478 transitions, 8857 flow
[2024-06-14 15:57:26,424 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8647, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8857, PETRI_PLACES=274, PETRI_TRANSITIONS=478}
[2024-06-14 15:57:26,425 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places.
[2024-06-14 15:57:26,425 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 478 transitions, 8857 flow
[2024-06-14 15:57:26,425 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:26,425 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:26,425 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:26,425 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:57:26,425 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:26,425 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:26,425 INFO  L85        PathProgramCache]: Analyzing trace with hash 1560463935, now seen corresponding path program 2 times
[2024-06-14 15:57:26,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:26,426 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65337521]
[2024-06-14 15:57:26,426 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:26,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:26,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:36,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:36,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:36,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65337521]
[2024-06-14 15:57:36,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65337521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:36,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:36,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:57:36,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800351322]
[2024-06-14 15:57:36,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:36,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:57:36,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:36,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:57:36,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:57:36,272 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:36,273 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 478 transitions, 8857 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:36,273 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:36,273 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:36,273 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:40,602 INFO  L124   PetriNetUnfolderBase]: 8297/12686 cut-off events.
[2024-06-14 15:57:40,602 INFO  L125   PetriNetUnfolderBase]: For 891482/891482 co-relation queries the response was YES.
[2024-06-14 15:57:40,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120522 conditions, 12686 events. 8297/12686 cut-off events. For 891482/891482 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 79631 event pairs, 3114 based on Foata normal form. 4/12689 useless extension candidates. Maximal degree in co-relation 120389. Up to 12579 conditions per place. 
[2024-06-14 15:57:40,795 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 476 selfloop transitions, 32 changer transitions 0/511 dead transitions.
[2024-06-14 15:57:40,795 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 511 transitions, 10143 flow
[2024-06-14 15:57:40,796 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:57:40,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:57:40,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-14 15:57:40,797 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38414634146341464
[2024-06-14 15:57:40,797 INFO  L175             Difference]: Start difference. First operand has 274 places, 478 transitions, 8857 flow. Second operand 8 states and 126 transitions.
[2024-06-14 15:57:40,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 511 transitions, 10143 flow
[2024-06-14 15:57:42,783 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 511 transitions, 10038 flow, removed 37 selfloop flow, removed 5 redundant places.
[2024-06-14 15:57:42,790 INFO  L231             Difference]: Finished difference. Result has 278 places, 488 transitions, 9022 flow
[2024-06-14 15:57:42,791 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8762, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9022, PETRI_PLACES=278, PETRI_TRANSITIONS=488}
[2024-06-14 15:57:42,791 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 236 predicate places.
[2024-06-14 15:57:42,791 INFO  L495      AbstractCegarLoop]: Abstraction has has 278 places, 488 transitions, 9022 flow
[2024-06-14 15:57:42,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:42,792 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:42,792 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:42,792 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:57:42,792 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:42,792 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:42,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -1036699757, now seen corresponding path program 3 times
[2024-06-14 15:57:42,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:42,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840088233]
[2024-06-14 15:57:42,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:42,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:42,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:52,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:52,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:52,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840088233]
[2024-06-14 15:57:52,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840088233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:52,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:52,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:57:52,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192739060]
[2024-06-14 15:57:52,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:52,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:57:52,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:52,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:57:52,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:57:52,577 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:52,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 488 transitions, 9022 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:52,578 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:52,578 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:52,578 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:56,803 INFO  L124   PetriNetUnfolderBase]: 8285/12670 cut-off events.
[2024-06-14 15:57:56,804 INFO  L125   PetriNetUnfolderBase]: For 914031/914031 co-relation queries the response was YES.
[2024-06-14 15:57:56,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120777 conditions, 12670 events. 8285/12670 cut-off events. For 914031/914031 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 79538 event pairs, 3106 based on Foata normal form. 4/12673 useless extension candidates. Maximal degree in co-relation 120641. Up to 12504 conditions per place. 
[2024-06-14 15:57:56,998 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 460 selfloop transitions, 46 changer transitions 0/509 dead transitions.
[2024-06-14 15:57:56,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 509 transitions, 10118 flow
[2024-06-14 15:57:56,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:56,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:56,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-14 15:57:56,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4076655052264808
[2024-06-14 15:57:56,999 INFO  L175             Difference]: Start difference. First operand has 278 places, 488 transitions, 9022 flow. Second operand 7 states and 117 transitions.
[2024-06-14 15:57:56,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 509 transitions, 10118 flow
[2024-06-14 15:57:59,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 509 transitions, 9994 flow, removed 37 selfloop flow, removed 5 redundant places.
[2024-06-14 15:57:59,344 INFO  L231             Difference]: Finished difference. Result has 280 places, 488 transitions, 9002 flow
[2024-06-14 15:57:59,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8898, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9002, PETRI_PLACES=280, PETRI_TRANSITIONS=488}
[2024-06-14 15:57:59,345 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places.
[2024-06-14 15:57:59,345 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 488 transitions, 9002 flow
[2024-06-14 15:57:59,345 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:59,345 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:59,345 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:59,345 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 15:57:59,345 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:59,346 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:59,346 INFO  L85        PathProgramCache]: Analyzing trace with hash -423598362, now seen corresponding path program 1 times
[2024-06-14 15:57:59,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:59,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002731570]
[2024-06-14 15:57:59,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:59,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:59,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:09,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:09,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:09,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002731570]
[2024-06-14 15:58:09,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002731570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:09,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:09,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:58:09,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749875814]
[2024-06-14 15:58:09,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:09,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:58:09,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:09,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:58:09,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:58:09,645 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:09,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 488 transitions, 9002 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:09,645 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:09,645 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:09,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:14,480 INFO  L124   PetriNetUnfolderBase]: 8472/12951 cut-off events.
[2024-06-14 15:58:14,481 INFO  L125   PetriNetUnfolderBase]: For 972025/972035 co-relation queries the response was YES.
[2024-06-14 15:58:14,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 124656 conditions, 12951 events. 8472/12951 cut-off events. For 972025/972035 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 81356 event pairs, 2135 based on Foata normal form. 14/12964 useless extension candidates. Maximal degree in co-relation 124519. Up to 11913 conditions per place. 
[2024-06-14 15:58:14,649 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 418 selfloop transitions, 123 changer transitions 0/544 dead transitions.
[2024-06-14 15:58:14,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 544 transitions, 10768 flow
[2024-06-14 15:58:14,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:58:14,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:58:14,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-14 15:58:14,650 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45257452574525747
[2024-06-14 15:58:14,650 INFO  L175             Difference]: Start difference. First operand has 280 places, 488 transitions, 9002 flow. Second operand 9 states and 167 transitions.
[2024-06-14 15:58:14,650 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 544 transitions, 10768 flow
[2024-06-14 15:58:16,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 544 transitions, 10636 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 15:58:16,776 INFO  L231             Difference]: Finished difference. Result has 285 places, 499 transitions, 9493 flow
[2024-06-14 15:58:16,776 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8876, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9493, PETRI_PLACES=285, PETRI_TRANSITIONS=499}
[2024-06-14 15:58:16,776 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places.
[2024-06-14 15:58:16,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 285 places, 499 transitions, 9493 flow
[2024-06-14 15:58:16,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:16,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:16,777 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:16,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 15:58:16,777 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:16,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:16,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -423359042, now seen corresponding path program 1 times
[2024-06-14 15:58:16,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:16,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445588628]
[2024-06-14 15:58:16,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:16,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:16,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:27,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:27,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:27,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445588628]
[2024-06-14 15:58:27,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445588628] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:27,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:27,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:58:27,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464642069]
[2024-06-14 15:58:27,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:27,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:58:27,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:27,305 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:58:27,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:58:27,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:27,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 499 transitions, 9493 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:27,524 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:27,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:27,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:32,066 INFO  L124   PetriNetUnfolderBase]: 8508/13001 cut-off events.
[2024-06-14 15:58:32,066 INFO  L125   PetriNetUnfolderBase]: For 984822/984832 co-relation queries the response was YES.
[2024-06-14 15:58:32,215 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 126687 conditions, 13001 events. 8508/13001 cut-off events. For 984822/984832 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 81952 event pairs, 2399 based on Foata normal form. 14/13014 useless extension candidates. Maximal degree in co-relation 126547. Up to 12259 conditions per place. 
[2024-06-14 15:58:32,286 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 422 selfloop transitions, 118 changer transitions 0/543 dead transitions.
[2024-06-14 15:58:32,286 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 543 transitions, 11027 flow
[2024-06-14 15:58:32,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:58:32,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:58:32,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-14 15:58:32,287 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-14 15:58:32,287 INFO  L175             Difference]: Start difference. First operand has 285 places, 499 transitions, 9493 flow. Second operand 9 states and 159 transitions.
[2024-06-14 15:58:32,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 543 transitions, 11027 flow
[2024-06-14 15:58:35,390 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 543 transitions, 10885 flow, removed 49 selfloop flow, removed 3 redundant places.
[2024-06-14 15:58:35,398 INFO  L231             Difference]: Finished difference. Result has 291 places, 507 transitions, 9814 flow
[2024-06-14 15:58:35,398 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9351, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9814, PETRI_PLACES=291, PETRI_TRANSITIONS=507}
[2024-06-14 15:58:35,398 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 249 predicate places.
[2024-06-14 15:58:35,399 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 507 transitions, 9814 flow
[2024-06-14 15:58:35,399 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:35,399 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:35,399 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:35,399 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 15:58:35,399 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:35,399 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:35,399 INFO  L85        PathProgramCache]: Analyzing trace with hash 2050242190, now seen corresponding path program 2 times
[2024-06-14 15:58:35,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:35,400 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467166893]
[2024-06-14 15:58:35,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:35,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:35,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:45,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:45,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:45,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467166893]
[2024-06-14 15:58:45,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467166893] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:45,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:45,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:58:45,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57589101]
[2024-06-14 15:58:45,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:45,093 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:58:45,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:45,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:58:45,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:58:45,196 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:45,196 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 507 transitions, 9814 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:45,196 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:45,196 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:45,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:49,809 INFO  L124   PetriNetUnfolderBase]: 8524/13025 cut-off events.
[2024-06-14 15:58:49,809 INFO  L125   PetriNetUnfolderBase]: For 1027534/1027544 co-relation queries the response was YES.
[2024-06-14 15:58:49,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128797 conditions, 13025 events. 8524/13025 cut-off events. For 1027534/1027544 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 82117 event pairs, 2528 based on Foata normal form. 14/13038 useless extension candidates. Maximal degree in co-relation 128655. Up to 12518 conditions per place. 
[2024-06-14 15:58:50,030 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 471 selfloop transitions, 70 changer transitions 0/544 dead transitions.
[2024-06-14 15:58:50,030 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 544 transitions, 11107 flow
[2024-06-14 15:58:50,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:58:50,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:58:50,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-14 15:58:50,031 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42005420054200543
[2024-06-14 15:58:50,031 INFO  L175             Difference]: Start difference. First operand has 291 places, 507 transitions, 9814 flow. Second operand 9 states and 155 transitions.
[2024-06-14 15:58:50,031 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 544 transitions, 11107 flow
[2024-06-14 15:58:53,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 544 transitions, 10932 flow, removed 57 selfloop flow, removed 4 redundant places.
[2024-06-14 15:58:53,501 INFO  L231             Difference]: Finished difference. Result has 296 places, 510 transitions, 9878 flow
[2024-06-14 15:58:53,501 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9639, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9878, PETRI_PLACES=296, PETRI_TRANSITIONS=510}
[2024-06-14 15:58:53,501 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places.
[2024-06-14 15:58:53,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 296 places, 510 transitions, 9878 flow
[2024-06-14 15:58:53,502 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:53,502 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:53,502 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:53,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 15:58:53,502 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:53,503 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:53,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 2058574370, now seen corresponding path program 2 times
[2024-06-14 15:58:53,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:53,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216870758]
[2024-06-14 15:58:53,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:53,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:53,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:04,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:04,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:04,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216870758]
[2024-06-14 15:59:04,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216870758] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:04,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:04,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:59:04,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041707448]
[2024-06-14 15:59:04,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:04,063 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:59:04,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:04,063 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:59:04,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:59:04,277 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:04,277 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 510 transitions, 9878 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:04,277 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:04,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:04,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:09,062 INFO  L124   PetriNetUnfolderBase]: 8574/13095 cut-off events.
[2024-06-14 15:59:09,063 INFO  L125   PetriNetUnfolderBase]: For 1061106/1061116 co-relation queries the response was YES.
[2024-06-14 15:59:09,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 130340 conditions, 13095 events. 8574/13095 cut-off events. For 1061106/1061116 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 82533 event pairs, 2528 based on Foata normal form. 14/13108 useless extension candidates. Maximal degree in co-relation 130196. Up to 12659 conditions per place. 
[2024-06-14 15:59:09,227 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 480 selfloop transitions, 66 changer transitions 0/549 dead transitions.
[2024-06-14 15:59:09,227 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 549 transitions, 11289 flow
[2024-06-14 15:59:09,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:09,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:09,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-14 15:59:09,228 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4092140921409214
[2024-06-14 15:59:09,228 INFO  L175             Difference]: Start difference. First operand has 296 places, 510 transitions, 9878 flow. Second operand 9 states and 151 transitions.
[2024-06-14 15:59:09,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 549 transitions, 11289 flow
[2024-06-14 15:59:11,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 549 transitions, 11071 flow, removed 36 selfloop flow, removed 7 redundant places.
[2024-06-14 15:59:11,938 INFO  L231             Difference]: Finished difference. Result has 299 places, 519 transitions, 10023 flow
[2024-06-14 15:59:11,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9670, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10023, PETRI_PLACES=299, PETRI_TRANSITIONS=519}
[2024-06-14 15:59:11,939 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places.
[2024-06-14 15:59:11,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 519 transitions, 10023 flow
[2024-06-14 15:59:11,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:11,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:11,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:11,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 15:59:11,939 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:11,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:11,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -1944557144, now seen corresponding path program 1 times
[2024-06-14 15:59:11,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:11,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937735504]
[2024-06-14 15:59:11,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:11,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:11,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:20,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:20,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:20,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937735504]
[2024-06-14 15:59:20,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937735504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:20,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:20,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:59:20,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749516251]
[2024-06-14 15:59:20,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:20,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:59:20,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:20,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:59:20,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:59:20,717 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:20,717 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 519 transitions, 10023 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:20,717 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:20,717 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:20,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:25,362 INFO  L124   PetriNetUnfolderBase]: 8668/13230 cut-off events.
[2024-06-14 15:59:25,362 INFO  L125   PetriNetUnfolderBase]: For 1113232/1113234 co-relation queries the response was YES.
[2024-06-14 15:59:25,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 132700 conditions, 13230 events. 8668/13230 cut-off events. For 1113232/1113234 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 83285 event pairs, 2563 based on Foata normal form. 8/13237 useless extension candidates. Maximal degree in co-relation 132554. Up to 11872 conditions per place. 
[2024-06-14 15:59:25,600 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 502 selfloop transitions, 160 changer transitions 2/667 dead transitions.
[2024-06-14 15:59:25,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 667 transitions, 14259 flow
[2024-06-14 15:59:25,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:25,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:25,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-14 15:59:25,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:59:25,602 INFO  L175             Difference]: Start difference. First operand has 299 places, 519 transitions, 10023 flow. Second operand 9 states and 162 transitions.
[2024-06-14 15:59:25,602 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 667 transitions, 14259 flow
[2024-06-14 15:59:28,835 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 667 transitions, 14037 flow, removed 47 selfloop flow, removed 5 redundant places.
[2024-06-14 15:59:28,845 INFO  L231             Difference]: Finished difference. Result has 307 places, 590 transitions, 11962 flow
[2024-06-14 15:59:28,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9838, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11962, PETRI_PLACES=307, PETRI_TRANSITIONS=590}
[2024-06-14 15:59:28,845 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places.
[2024-06-14 15:59:28,845 INFO  L495      AbstractCegarLoop]: Abstraction has has 307 places, 590 transitions, 11962 flow
[2024-06-14 15:59:28,845 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:28,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:28,845 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:28,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 15:59:28,846 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:28,846 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:28,846 INFO  L85        PathProgramCache]: Analyzing trace with hash -305148540, now seen corresponding path program 2 times
[2024-06-14 15:59:28,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:28,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141440181]
[2024-06-14 15:59:28,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:28,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:28,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:37,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-06-14 15:59:37,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:37,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141440181]
[2024-06-14 15:59:37,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141440181] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:37,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:37,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:37,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730643559]
[2024-06-14 15:59:37,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:37,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:37,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:37,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:37,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:37,135 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:37,135 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 590 transitions, 11962 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:37,135 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:37,135 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:37,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:42,228 INFO  L124   PetriNetUnfolderBase]: 8855/13481 cut-off events.
[2024-06-14 15:59:42,229 INFO  L125   PetriNetUnfolderBase]: For 1217399/1217401 co-relation queries the response was YES.
[2024-06-14 15:59:42,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139927 conditions, 13481 events. 8855/13481 cut-off events. For 1217399/1217401 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 84392 event pairs, 2414 based on Foata normal form. 32/13512 useless extension candidates. Maximal degree in co-relation 139776. Up to 12872 conditions per place. 
[2024-06-14 15:59:42,426 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 555 selfloop transitions, 97 changer transitions 0/655 dead transitions.
[2024-06-14 15:59:42,426 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 655 transitions, 14362 flow
[2024-06-14 15:59:42,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:42,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:42,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-14 15:59:42,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 15:59:42,428 INFO  L175             Difference]: Start difference. First operand has 307 places, 590 transitions, 11962 flow. Second operand 9 states and 153 transitions.
[2024-06-14 15:59:42,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 655 transitions, 14362 flow
[2024-06-14 15:59:45,504 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 655 transitions, 14147 flow, removed 103 selfloop flow, removed 2 redundant places.
[2024-06-14 15:59:45,514 INFO  L231             Difference]: Finished difference. Result has 315 places, 626 transitions, 12892 flow
[2024-06-14 15:59:45,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11759, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12892, PETRI_PLACES=315, PETRI_TRANSITIONS=626}
[2024-06-14 15:59:45,515 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 273 predicate places.
[2024-06-14 15:59:45,515 INFO  L495      AbstractCegarLoop]: Abstraction has has 315 places, 626 transitions, 12892 flow
[2024-06-14 15:59:45,515 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:45,515 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:45,515 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:45,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 15:59:45,516 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:45,516 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:45,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -1750102606, now seen corresponding path program 3 times
[2024-06-14 15:59:45,516 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:45,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237915634]
[2024-06-14 15:59:45,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:45,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:45,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:53,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:53,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:53,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237915634]
[2024-06-14 15:59:53,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237915634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:53,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:53,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:53,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608720725]
[2024-06-14 15:59:53,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:53,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:53,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:53,971 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:53,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:54,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:54,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 626 transitions, 12892 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:54,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:54,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:54,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:59,116 INFO  L124   PetriNetUnfolderBase]: 8797/13409 cut-off events.
[2024-06-14 15:59:59,116 INFO  L125   PetriNetUnfolderBase]: For 1216169/1216171 co-relation queries the response was YES.
[2024-06-14 15:59:59,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 138867 conditions, 13409 events. 8797/13409 cut-off events. For 1216169/1216171 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 83964 event pairs, 2307 based on Foata normal form. 32/13440 useless extension candidates. Maximal degree in co-relation 138713. Up to 12224 conditions per place. 
[2024-06-14 15:59:59,352 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 513 selfloop transitions, 144 changer transitions 0/660 dead transitions.
[2024-06-14 15:59:59,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 660 transitions, 14720 flow
[2024-06-14 15:59:59,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:59:59,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:59:59,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions.
[2024-06-14 15:59:59,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40487804878048783
[2024-06-14 15:59:59,355 INFO  L175             Difference]: Start difference. First operand has 315 places, 626 transitions, 12892 flow. Second operand 10 states and 166 transitions.
[2024-06-14 15:59:59,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 660 transitions, 14720 flow
[2024-06-14 16:00:03,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 660 transitions, 14361 flow, removed 137 selfloop flow, removed 4 redundant places.
[2024-06-14 16:00:03,188 INFO  L231             Difference]: Finished difference. Result has 321 places, 631 transitions, 12990 flow
[2024-06-14 16:00:03,188 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12533, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12990, PETRI_PLACES=321, PETRI_TRANSITIONS=631}
[2024-06-14 16:00:03,188 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 279 predicate places.
[2024-06-14 16:00:03,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 631 transitions, 12990 flow
[2024-06-14 16:00:03,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:03,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:03,189 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:03,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 16:00:03,189 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:03,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:03,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -1767428476, now seen corresponding path program 3 times
[2024-06-14 16:00:03,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:03,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003667134]
[2024-06-14 16:00:03,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:03,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:03,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:13,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:13,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:13,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003667134]
[2024-06-14 16:00:13,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003667134] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:13,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:13,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:13,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553146195]
[2024-06-14 16:00:13,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:13,400 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:13,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:13,400 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:13,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:13,529 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:13,529 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 631 transitions, 12990 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:13,529 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:13,529 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:13,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:18,888 INFO  L124   PetriNetUnfolderBase]: 9117/13851 cut-off events.
[2024-06-14 16:00:18,888 INFO  L125   PetriNetUnfolderBase]: For 1285406/1285408 co-relation queries the response was YES.
[2024-06-14 16:00:19,049 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 146064 conditions, 13851 events. 9117/13851 cut-off events. For 1285406/1285408 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 86828 event pairs, 2339 based on Foata normal form. 10/13860 useless extension candidates. Maximal degree in co-relation 145908. Up to 12655 conditions per place. 
[2024-06-14 16:00:19,124 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 561 selfloop transitions, 143 changer transitions 0/707 dead transitions.
[2024-06-14 16:00:19,124 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 707 transitions, 15992 flow
[2024-06-14 16:00:19,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:00:19,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:00:19,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions.
[2024-06-14 16:00:19,125 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3946784922394678
[2024-06-14 16:00:19,125 INFO  L175             Difference]: Start difference. First operand has 321 places, 631 transitions, 12990 flow. Second operand 11 states and 178 transitions.
[2024-06-14 16:00:19,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 707 transitions, 15992 flow
[2024-06-14 16:00:23,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 707 transitions, 15066 flow, removed 221 selfloop flow, removed 11 redundant places.
[2024-06-14 16:00:23,985 INFO  L231             Difference]: Finished difference. Result has 323 places, 670 transitions, 13478 flow
[2024-06-14 16:00:23,985 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12174, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13478, PETRI_PLACES=323, PETRI_TRANSITIONS=670}
[2024-06-14 16:00:23,986 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 281 predicate places.
[2024-06-14 16:00:23,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 670 transitions, 13478 flow
[2024-06-14 16:00:23,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:23,986 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:23,986 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:23,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 16:00:23,986 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:23,987 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:23,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -1767059390, now seen corresponding path program 1 times
[2024-06-14 16:00:23,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:23,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611271961]
[2024-06-14 16:00:23,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:23,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:24,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:34,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:34,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:34,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611271961]
[2024-06-14 16:00:34,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611271961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:34,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:34,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:34,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025842518]
[2024-06-14 16:00:34,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:34,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:34,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:34,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:34,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:34,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:34,798 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 670 transitions, 13478 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:34,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:34,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:34,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:40,156 INFO  L124   PetriNetUnfolderBase]: 9107/13827 cut-off events.
[2024-06-14 16:00:40,157 INFO  L125   PetriNetUnfolderBase]: For 1315906/1315912 co-relation queries the response was YES.
[2024-06-14 16:00:40,304 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 146047 conditions, 13827 events. 9107/13827 cut-off events. For 1315906/1315912 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 86755 event pairs, 2693 based on Foata normal form. 10/13836 useless extension candidates. Maximal degree in co-relation 145894. Up to 13756 conditions per place. 
[2024-06-14 16:00:40,368 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 670 selfloop transitions, 21 changer transitions 0/694 dead transitions.
[2024-06-14 16:00:40,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 694 transitions, 15049 flow
[2024-06-14 16:00:40,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:40,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:40,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions.
[2024-06-14 16:00:40,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3567073170731707
[2024-06-14 16:00:40,369 INFO  L175             Difference]: Start difference. First operand has 323 places, 670 transitions, 13478 flow. Second operand 8 states and 117 transitions.
[2024-06-14 16:00:40,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 694 transitions, 15049 flow
[2024-06-14 16:00:44,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 694 transitions, 14639 flow, removed 172 selfloop flow, removed 5 redundant places.
[2024-06-14 16:00:44,596 INFO  L231             Difference]: Finished difference. Result has 327 places, 675 transitions, 13256 flow
[2024-06-14 16:00:44,597 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13070, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13256, PETRI_PLACES=327, PETRI_TRANSITIONS=675}
[2024-06-14 16:00:44,597 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 285 predicate places.
[2024-06-14 16:00:44,597 INFO  L495      AbstractCegarLoop]: Abstraction has has 327 places, 675 transitions, 13256 flow
[2024-06-14 16:00:44,597 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:44,597 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:44,597 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:44,598 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 16:00:44,598 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:44,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:44,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 775109032, now seen corresponding path program 4 times
[2024-06-14 16:00:44,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:44,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617738355]
[2024-06-14 16:00:44,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:44,599 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:44,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:53,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:53,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:53,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617738355]
[2024-06-14 16:00:53,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617738355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:53,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:53,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:53,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121525520]
[2024-06-14 16:00:53,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:53,169 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:53,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:53,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:53,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:53,265 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:53,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 675 transitions, 13256 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:53,265 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:53,265 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:53,265 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:58,593 INFO  L124   PetriNetUnfolderBase]: 9117/13851 cut-off events.
[2024-06-14 16:00:58,593 INFO  L125   PetriNetUnfolderBase]: For 1308101/1308101 co-relation queries the response was YES.
[2024-06-14 16:00:58,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 144839 conditions, 13851 events. 9117/13851 cut-off events. For 1308101/1308101 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 87008 event pairs, 3068 based on Foata normal form. 2/13852 useless extension candidates. Maximal degree in co-relation 144685. Up to 13615 conditions per place. 
[2024-06-14 16:00:58,804 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 659 selfloop transitions, 72 changer transitions 0/734 dead transitions.
[2024-06-14 16:00:58,804 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 734 transitions, 15753 flow
[2024-06-14 16:00:58,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:00:58,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:00:58,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-06-14 16:00:58,806 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 16:00:58,806 INFO  L175             Difference]: Start difference. First operand has 327 places, 675 transitions, 13256 flow. Second operand 10 states and 155 transitions.
[2024-06-14 16:00:58,806 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 734 transitions, 15753 flow
[2024-06-14 16:01:02,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 734 transitions, 15523 flow, removed 48 selfloop flow, removed 7 redundant places.
[2024-06-14 16:01:02,244 INFO  L231             Difference]: Finished difference. Result has 333 places, 700 transitions, 13937 flow
[2024-06-14 16:01:02,244 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13026, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13937, PETRI_PLACES=333, PETRI_TRANSITIONS=700}
[2024-06-14 16:01:02,245 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 291 predicate places.
[2024-06-14 16:01:02,245 INFO  L495      AbstractCegarLoop]: Abstraction has has 333 places, 700 transitions, 13937 flow
[2024-06-14 16:01:02,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:02,245 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:02,245 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:02,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 16:01:02,245 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:02,245 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:02,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 356425138, now seen corresponding path program 5 times
[2024-06-14 16:01:02,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:02,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480762557]
[2024-06-14 16:01:02,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:02,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:02,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:10,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:10,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:10,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480762557]
[2024-06-14 16:01:10,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480762557] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:10,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:10,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:01:10,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819858941]
[2024-06-14 16:01:10,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:10,465 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:01:10,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:10,465 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:01:10,465 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:01:10,630 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:10,631 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 700 transitions, 13937 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:10,631 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:10,631 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:10,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:16,333 INFO  L124   PetriNetUnfolderBase]: 9127/13864 cut-off events.
[2024-06-14 16:01:16,333 INFO  L125   PetriNetUnfolderBase]: For 1350237/1350237 co-relation queries the response was YES.
[2024-06-14 16:01:16,472 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145957 conditions, 13864 events. 9127/13864 cut-off events. For 1350237/1350237 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 87035 event pairs, 3093 based on Foata normal form. 2/13865 useless extension candidates. Maximal degree in co-relation 145800. Up to 13745 conditions per place. 
[2024-06-14 16:01:16,536 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 686 selfloop transitions, 45 changer transitions 0/734 dead transitions.
[2024-06-14 16:01:16,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 734 transitions, 15759 flow
[2024-06-14 16:01:16,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:01:16,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:01:16,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions.
[2024-06-14 16:01:16,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37073170731707317
[2024-06-14 16:01:16,537 INFO  L175             Difference]: Start difference. First operand has 333 places, 700 transitions, 13937 flow. Second operand 10 states and 152 transitions.
[2024-06-14 16:01:16,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 734 transitions, 15759 flow
[2024-06-14 16:01:20,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 734 transitions, 15580 flow, removed 72 selfloop flow, removed 4 redundant places.
[2024-06-14 16:01:20,671 INFO  L231             Difference]: Finished difference. Result has 341 places, 706 transitions, 14050 flow
[2024-06-14 16:01:20,671 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13776, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14050, PETRI_PLACES=341, PETRI_TRANSITIONS=706}
[2024-06-14 16:01:20,672 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 299 predicate places.
[2024-06-14 16:01:20,672 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 706 transitions, 14050 flow
[2024-06-14 16:01:20,672 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:20,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:20,672 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:20,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 16:01:20,672 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:20,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:20,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 1014438022, now seen corresponding path program 6 times
[2024-06-14 16:01:20,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:20,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599154358]
[2024-06-14 16:01:20,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:20,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:20,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat