./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix002.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/protection/mix002.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i ./goblint.2024-05-21_14-57-05.files/protection/mix002.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-bcb38a6-m [2024-06-04 14:32:40,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 14:32:40,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 14:32:40,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 14:32:40,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 14:32:40,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 14:32:40,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 14:32:40,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 14:32:40,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 14:32:40,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 14:32:40,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 14:32:40,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 14:32:40,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 14:32:40,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 14:32:40,701 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 14:32:40,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 14:32:40,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 14:32:40,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 14:32:40,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 14:32:40,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 14:32:40,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 14:32:40,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 14:32:40,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 14:32:40,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 14:32:40,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 14:32:40,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 14:32:40,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 14:32:40,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 14:32:40,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 14:32:40,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 14:32:40,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 14:32:40,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 14:32:40,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:32:40,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 14:32:40,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 14:32:40,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 14:32:40,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 14:32:40,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 14:32:40,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 14:32:40,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 14:32:40,708 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 14:32:40,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 14:32:40,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 14:32:40,708 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-04 14:32:40,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 14:32:40,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 14:32:40,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 14:32:40,978 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 14:32:40,979 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 14:32:40,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/mix002.oepc.yml/witness.yml [2024-06-04 14:32:41,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 14:32:41,115 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 14:32:41,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2024-06-04 14:32:42,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 14:32:42,405 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 14:32:42,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2024-06-04 14:32:42,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66d168b6e/1cd69f5a90504807a64ec0cd3ed801e9/FLAG3088c368d [2024-06-04 14:32:42,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66d168b6e/1cd69f5a90504807a64ec0cd3ed801e9 [2024-06-04 14:32:42,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 14:32:42,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 14:32:42,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 14:32:42,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 14:32:42,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 14:32:42,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:32:41" (1/2) ... [2024-06-04 14:32:42,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739d7664 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:32:42, skipping insertion in model container [2024-06-04 14:32:42,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:32:41" (1/2) ... [2024-06-04 14:32:42,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c404dd6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:32:42, skipping insertion in model container [2024-06-04 14:32:42,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:32:42" (2/2) ... [2024-06-04 14:32:42,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739d7664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:42, skipping insertion in model container [2024-06-04 14:32:42,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:32:42" (2/2) ... [2024-06-04 14:32:42,451 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 14:32:42,533 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 14:32:42,535 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) [2024-06-04 14:32:42,535 INFO L97 edCorrectnessWitness]: Location invariant before [L860-L860] ((((((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) [2024-06-04 14:32:42,535 INFO L97 edCorrectnessWitness]: Location invariant before [L861-L861] ((((((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) [2024-06-04 14:32:42,535 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 14:32:42,535 INFO L106 edCorrectnessWitness]: ghost_update [L856-L856] multithreaded = 1; [2024-06-04 14:32:42,572 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 14:32:42,883 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:32:42,891 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 14:32:43,026 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:32:43,057 INFO L206 MainTranslator]: Completed translation [2024-06-04 14:32:43,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43 WrapperNode [2024-06-04 14:32:43,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 14:32:43,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 14:32:43,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 14:32:43,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 14:32:43,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,103 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-06-04 14:32:43,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 14:32:43,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 14:32:43,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 14:32:43,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 14:32:43,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,148 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-04 14:32:43,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 14:32:43,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 14:32:43,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 14:32:43,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 14:32:43,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (1/1) ... [2024-06-04 14:32:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:32:43,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 14:32:43,250 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-04 14:32:43,274 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-04 14:32:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 14:32:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 14:32:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 14:32:43,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 14:32:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 14:32:43,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 14:32:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 14:32:43,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 14:32:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 14:32:43,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 14:32:43,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 14:32:43,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 14:32:43,288 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 14:32:43,381 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 14:32:43,382 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 14:32:43,700 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 14:32:43,701 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 14:32:43,848 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 14:32:43,848 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 14:32:43,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:32:43 BoogieIcfgContainer [2024-06-04 14:32:43,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 14:32:43,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 14:32:43,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 14:32:43,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 14:32:43,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:32:41" (1/4) ... [2024-06-04 14:32:43,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb5f41e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 02:32:43, skipping insertion in model container [2024-06-04 14:32:43,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 02:32:42" (2/4) ... [2024-06-04 14:32:43,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb5f41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:32:43, skipping insertion in model container [2024-06-04 14:32:43,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:43" (3/4) ... [2024-06-04 14:32:43,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb5f41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:32:43, skipping insertion in model container [2024-06-04 14:32:43,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:32:43" (4/4) ... [2024-06-04 14:32:43,857 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2024-06-04 14:32:43,870 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 14:32:43,870 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 14:32:43,870 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 14:32:43,932 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 14:32:43,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 102 flow [2024-06-04 14:32:43,998 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-06-04 14:32:43,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 14:32:44,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 14:32:44,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 45 transitions, 102 flow [2024-06-04 14:32:44,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow [2024-06-04 14:32:44,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 14:32:44,018 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;@33ae61e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 14:32:44,018 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 14:32:44,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 14:32:44,022 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 14:32:44,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 14:32:44,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:44,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 14:32:44,023 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-04 14:32:44,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash -906108083, now seen corresponding path program 1 times [2024-06-04 14:32:44,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:44,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262614863] [2024-06-04 14:32:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:45,277 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-04 14:32:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262614863] [2024-06-04 14:32:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262614863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:45,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:45,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 14:32:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952926265] [2024-06-04 14:32:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:45,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 14:32:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 14:32:45,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 14:32:45,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-06-04 14:32:45,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-04 14:32:45,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:45,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-06-04 14:32:45,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:45,691 INFO L124 PetriNetUnfolderBase]: 1363/2142 cut-off events. [2024-06-04 14:32:45,691 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-04 14:32:45,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 2142 events. 1363/2142 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11075 event pairs, 964 based on Foata normal form. 1/2091 useless extension candidates. Maximal degree in co-relation 4253. Up to 2037 conditions per place. [2024-06-04 14:32:45,706 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 34 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-06-04 14:32:45,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 183 flow [2024-06-04 14:32:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 14:32:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 14:32:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-04 14:32:45,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2024-06-04 14:32:45,716 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 83 transitions. [2024-06-04 14:32:45,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 183 flow [2024-06-04 14:32:45,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 14:32:45,721 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow [2024-06-04 14:32:45,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-04 14:32:45,725 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-06-04 14:32:45,725 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow [2024-06-04 14:32:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-04 14:32:45,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:45,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:45,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 14:32:45,726 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-04 14:32:45,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1108531436, now seen corresponding path program 1 times [2024-06-04 14:32:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829911626] [2024-06-04 14:32:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:46,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-04 14:32:46,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:46,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829911626] [2024-06-04 14:32:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829911626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:46,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:46,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 14:32:46,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012522089] [2024-06-04 14:32:46,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:46,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 14:32:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 14:32:46,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 14:32:46,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-06-04 14:32:46,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-04 14:32:46,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:46,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-06-04 14:32:46,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:46,778 INFO L124 PetriNetUnfolderBase]: 1357/2133 cut-off events. [2024-06-04 14:32:46,778 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2024-06-04 14:32:46,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4802 conditions, 2133 events. 1357/2133 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11055 event pairs, 840 based on Foata normal form. 3/2118 useless extension candidates. Maximal degree in co-relation 4787. Up to 2013 conditions per place. [2024-06-04 14:32:46,788 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-04 14:32:46,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 250 flow [2024-06-04 14:32:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 14:32:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 14:32:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-06-04 14:32:46,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-06-04 14:32:46,790 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 108 flow. Second operand 4 states and 107 transitions. [2024-06-04 14:32:46,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 250 flow [2024-06-04 14:32:46,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 14:32:46,791 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 144 flow [2024-06-04 14:32:46,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-04 14:32:46,792 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-06-04 14:32:46,792 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 144 flow [2024-06-04 14:32:46,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-04 14:32:46,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:46,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:46,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 14:32:46,793 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-04 14:32:46,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash 4737400, now seen corresponding path program 1 times [2024-06-04 14:32:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:46,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923328978] [2024-06-04 14:32:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:46,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:47,627 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-04 14:32:47,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923328978] [2024-06-04 14:32:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923328978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:47,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:47,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:32:47,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613894558] [2024-06-04 14:32:47,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:47,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:32:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:47,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:32:47,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:32:47,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 14:32:47,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:47,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:47,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 14:32:47,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:48,043 INFO L124 PetriNetUnfolderBase]: 1598/2509 cut-off events. [2024-06-04 14:32:48,044 INFO L125 PetriNetUnfolderBase]: For 1345/1345 co-relation queries the response was YES. [2024-06-04 14:32:48,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6223 conditions, 2509 events. 1598/2509 cut-off events. For 1345/1345 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12993 event pairs, 915 based on Foata normal form. 3/2495 useless extension candidates. Maximal degree in co-relation 6206. Up to 2350 conditions per place. [2024-06-04 14:32:48,056 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 49 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-04 14:32:48,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 330 flow [2024-06-04 14:32:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:32:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:32:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-06-04 14:32:48,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2024-06-04 14:32:48,058 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 144 flow. Second operand 5 states and 127 transitions. [2024-06-04 14:32:48,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 330 flow [2024-06-04 14:32:48,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 316 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 14:32:48,060 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 180 flow [2024-06-04 14:32:48,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-04 14:32:48,061 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2024-06-04 14:32:48,061 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 180 flow [2024-06-04 14:32:48,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:48,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:48,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:48,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 14:32:48,062 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-04 14:32:48,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash 146860683, now seen corresponding path program 1 times [2024-06-04 14:32:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373017001] [2024-06-04 14:32:48,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:48,967 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-04 14:32:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:48,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373017001] [2024-06-04 14:32:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373017001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:48,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:32:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010771758] [2024-06-04 14:32:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:48,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:32:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:48,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:32:48,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:32:49,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 14:32:49,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-04 14:32:49,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:49,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 14:32:49,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:49,432 INFO L124 PetriNetUnfolderBase]: 1592/2522 cut-off events. [2024-06-04 14:32:49,432 INFO L125 PetriNetUnfolderBase]: For 2503/2503 co-relation queries the response was YES. [2024-06-04 14:32:49,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 2522 events. 1592/2522 cut-off events. For 2503/2503 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13225 event pairs, 791 based on Foata normal form. 3/2500 useless extension candidates. Maximal degree in co-relation 6798. Up to 2326 conditions per place. [2024-06-04 14:32:49,443 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 56 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2024-06-04 14:32:49,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 408 flow [2024-06-04 14:32:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:32:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:32:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-04 14:32:49,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-04 14:32:49,445 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 180 flow. Second operand 6 states and 150 transitions. [2024-06-04 14:32:49,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 408 flow [2024-06-04 14:32:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 384 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 14:32:49,448 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 216 flow [2024-06-04 14:32:49,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-04 14:32:49,449 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2024-06-04 14:32:49,449 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 216 flow [2024-06-04 14:32:49,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-04 14:32:49,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:49,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:49,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 14:32:49,450 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:32:49,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -463788084, now seen corresponding path program 1 times [2024-06-04 14:32:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:49,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833210670] [2024-06-04 14:32:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:49,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:50,113 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-04 14:32:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833210670] [2024-06-04 14:32:50,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833210670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:50,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:50,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:32:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578474698] [2024-06-04 14:32:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:50,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:32:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:32:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:32:50,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:32:50,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:50,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:50,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:32:50,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:50,789 INFO L124 PetriNetUnfolderBase]: 2130/3330 cut-off events. [2024-06-04 14:32:50,789 INFO L125 PetriNetUnfolderBase]: For 5086/5086 co-relation queries the response was YES. [2024-06-04 14:32:50,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9594 conditions, 3330 events. 2130/3330 cut-off events. For 5086/5086 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17279 event pairs, 1193 based on Foata normal form. 2/3330 useless extension candidates. Maximal degree in co-relation 9575. Up to 3145 conditions per place. [2024-06-04 14:32:50,807 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 47 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2024-06-04 14:32:50,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 370 flow [2024-06-04 14:32:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:32:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:32:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-06-04 14:32:50,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2024-06-04 14:32:50,809 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 216 flow. Second operand 5 states and 104 transitions. [2024-06-04 14:32:50,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 370 flow [2024-06-04 14:32:50,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 336 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 14:32:50,812 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 228 flow [2024-06-04 14:32:50,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-04 14:32:50,813 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2024-06-04 14:32:50,813 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 228 flow [2024-06-04 14:32:50,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:50,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:50,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:50,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 14:32:50,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:32:50,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1036114878, now seen corresponding path program 1 times [2024-06-04 14:32:50,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:50,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5621748] [2024-06-04 14:32:50,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:52,183 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-04 14:32:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:52,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5621748] [2024-06-04 14:32:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5621748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:52,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:32:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496080488] [2024-06-04 14:32:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:32:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:32:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:32:52,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 14:32:52,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:52,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:52,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 14:32:52,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:52,897 INFO L124 PetriNetUnfolderBase]: 2074/3266 cut-off events. [2024-06-04 14:32:52,898 INFO L125 PetriNetUnfolderBase]: For 7235/7235 co-relation queries the response was YES. [2024-06-04 14:32:52,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10068 conditions, 3266 events. 2074/3266 cut-off events. For 7235/7235 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17154 event pairs, 843 based on Foata normal form. 3/3262 useless extension candidates. Maximal degree in co-relation 10047. Up to 2972 conditions per place. [2024-06-04 14:32:52,913 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 73 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2024-06-04 14:32:52,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 554 flow [2024-06-04 14:32:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:32:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:32:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-04 14:32:52,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-04 14:32:52,915 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 228 flow. Second operand 8 states and 189 transitions. [2024-06-04 14:32:52,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 554 flow [2024-06-04 14:32:52,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 532 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 14:32:52,918 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 300 flow [2024-06-04 14:32:52,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2024-06-04 14:32:52,919 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2024-06-04 14:32:52,919 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 300 flow [2024-06-04 14:32:52,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:52,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:52,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:52,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 14:32:52,920 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-04 14:32:52,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1492527036, now seen corresponding path program 1 times [2024-06-04 14:32:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:52,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491347915] [2024-06-04 14:32:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:52,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491347915] [2024-06-04 14:32:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491347915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:53,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196653066] [2024-06-04 14:32:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:53,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:32:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:32:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:32:53,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:32:53,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:53,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:53,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:32:53,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:54,707 INFO L124 PetriNetUnfolderBase]: 2106/3306 cut-off events. [2024-06-04 14:32:54,707 INFO L125 PetriNetUnfolderBase]: For 10174/10174 co-relation queries the response was YES. [2024-06-04 14:32:54,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11062 conditions, 3306 events. 2106/3306 cut-off events. For 10174/10174 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17192 event pairs, 886 based on Foata normal form. 4/3308 useless extension candidates. Maximal degree in co-relation 11040. Up to 3104 conditions per place. [2024-06-04 14:32:54,721 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 58 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-06-04 14:32:54,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 500 flow [2024-06-04 14:32:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:32:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:32:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-04 14:32:54,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-04 14:32:54,722 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 300 flow. Second operand 6 states and 123 transitions. [2024-06-04 14:32:54,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 500 flow [2024-06-04 14:32:54,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 450 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 14:32:54,726 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 308 flow [2024-06-04 14:32:54,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2024-06-04 14:32:54,727 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2024-06-04 14:32:54,727 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 308 flow [2024-06-04 14:32:54,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:54,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:54,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:54,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 14:32:54,728 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-04 14:32:54,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 968675371, now seen corresponding path program 1 times [2024-06-04 14:32:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:54,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502017661] [2024-06-04 14:32:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:55,559 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-04 14:32:55,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:55,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502017661] [2024-06-04 14:32:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502017661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:55,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:55,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885258056] [2024-06-04 14:32:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:55,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:32:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:32:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:32:55,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:32:55,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:55,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:55,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:32:55,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:56,119 INFO L124 PetriNetUnfolderBase]: 2140/3322 cut-off events. [2024-06-04 14:32:56,119 INFO L125 PetriNetUnfolderBase]: For 13388/13408 co-relation queries the response was YES. [2024-06-04 14:32:56,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11889 conditions, 3322 events. 2140/3322 cut-off events. For 13388/13408 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17379 event pairs, 1285 based on Foata normal form. 20/3322 useless extension candidates. Maximal degree in co-relation 11865. Up to 3148 conditions per place. [2024-06-04 14:32:56,138 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 63 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-06-04 14:32:56,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 614 flow [2024-06-04 14:32:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:32:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:32:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-04 14:32:56,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44126984126984126 [2024-06-04 14:32:56,142 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 308 flow. Second operand 7 states and 139 transitions. [2024-06-04 14:32:56,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 614 flow [2024-06-04 14:32:56,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 578 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 14:32:56,151 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 413 flow [2024-06-04 14:32:56,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=413, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2024-06-04 14:32:56,153 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-06-04 14:32:56,153 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 413 flow [2024-06-04 14:32:56,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:56,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:56,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:56,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 14:32:56,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:32:56,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2054791522, now seen corresponding path program 1 times [2024-06-04 14:32:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225411210] [2024-06-04 14:32:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:57,623 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-04 14:32:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225411210] [2024-06-04 14:32:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225411210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:32:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405041013] [2024-06-04 14:32:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:57,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:32:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:32:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:32:57,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 14:32:57,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 413 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:57,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:57,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 14:32:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:58,338 INFO L124 PetriNetUnfolderBase]: 2102/3302 cut-off events. [2024-06-04 14:32:58,338 INFO L125 PetriNetUnfolderBase]: For 16655/16665 co-relation queries the response was YES. [2024-06-04 14:32:58,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12437 conditions, 3302 events. 2102/3302 cut-off events. For 16655/16665 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17321 event pairs, 668 based on Foata normal form. 14/3299 useless extension candidates. Maximal degree in co-relation 12410. Up to 2955 conditions per place. [2024-06-04 14:32:58,356 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 84 selfloop transitions, 25 changer transitions 0/118 dead transitions. [2024-06-04 14:32:58,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 777 flow [2024-06-04 14:32:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:32:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:32:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-06-04 14:32:58,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-04 14:32:58,360 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 413 flow. Second operand 9 states and 207 transitions. [2024-06-04 14:32:58,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 777 flow [2024-06-04 14:32:58,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 757 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-04 14:32:58,368 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 472 flow [2024-06-04 14:32:58,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-06-04 14:32:58,370 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2024-06-04 14:32:58,370 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 472 flow [2024-06-04 14:32:58,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:58,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:58,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:58,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 14:32:58,371 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-04 14:32:58,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1274121337, now seen corresponding path program 2 times [2024-06-04 14:32:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125519562] [2024-06-04 14:32:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:59,210 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-04 14:32:59,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125519562] [2024-06-04 14:32:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125519562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:59,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250574557] [2024-06-04 14:32:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:59,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:32:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:32:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:32:59,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:32:59,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 472 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:59,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:59,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:32:59,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:00,009 INFO L124 PetriNetUnfolderBase]: 2157/3350 cut-off events. [2024-06-04 14:33:00,009 INFO L125 PetriNetUnfolderBase]: For 21117/21138 co-relation queries the response was YES. [2024-06-04 14:33:00,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13391 conditions, 3350 events. 2157/3350 cut-off events. For 21117/21138 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17373 event pairs, 1172 based on Foata normal form. 21/3356 useless extension candidates. Maximal degree in co-relation 13362. Up to 3140 conditions per place. [2024-06-04 14:33:00,026 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 69 selfloop transitions, 37 changer transitions 0/113 dead transitions. [2024-06-04 14:33:00,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 113 transitions, 939 flow [2024-06-04 14:33:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:33:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:33:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-04 14:33:00,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2024-06-04 14:33:00,027 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 472 flow. Second operand 7 states and 149 transitions. [2024-06-04 14:33:00,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 113 transitions, 939 flow [2024-06-04 14:33:00,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 113 transitions, 858 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 14:33:00,035 INFO L231 Difference]: Finished difference. Result has 77 places, 90 transitions, 658 flow [2024-06-04 14:33:00,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=658, PETRI_PLACES=77, PETRI_TRANSITIONS=90} [2024-06-04 14:33:00,036 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2024-06-04 14:33:00,036 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 90 transitions, 658 flow [2024-06-04 14:33:00,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:00,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:00,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:00,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 14:33:00,037 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-04 14:33:00,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2030808435, now seen corresponding path program 3 times [2024-06-04 14:33:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809554935] [2024-06-04 14:33:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:00,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809554935] [2024-06-04 14:33:00,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809554935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:00,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:00,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:33:00,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628654136] [2024-06-04 14:33:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:00,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:33:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:33:00,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:33:00,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:33:00,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 90 transitions, 658 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:00,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:00,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:33:00,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:01,519 INFO L124 PetriNetUnfolderBase]: 2147/3328 cut-off events. [2024-06-04 14:33:01,520 INFO L125 PetriNetUnfolderBase]: For 25256/25271 co-relation queries the response was YES. [2024-06-04 14:33:01,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14073 conditions, 3328 events. 2147/3328 cut-off events. For 25256/25271 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17254 event pairs, 1220 based on Foata normal form. 18/3330 useless extension candidates. Maximal degree in co-relation 14040. Up to 3179 conditions per place. [2024-06-04 14:33:01,539 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 81 selfloop transitions, 16 changer transitions 0/104 dead transitions. [2024-06-04 14:33:01,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 896 flow [2024-06-04 14:33:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:33:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:33:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 14:33:01,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-04 14:33:01,541 INFO L175 Difference]: Start difference. First operand has 77 places, 90 transitions, 658 flow. Second operand 7 states and 133 transitions. [2024-06-04 14:33:01,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 896 flow [2024-06-04 14:33:01,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 808 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-04 14:33:01,553 INFO L231 Difference]: Finished difference. Result has 81 places, 90 transitions, 613 flow [2024-06-04 14:33:01,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=613, PETRI_PLACES=81, PETRI_TRANSITIONS=90} [2024-06-04 14:33:01,553 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-06-04 14:33:01,554 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 613 flow [2024-06-04 14:33:01,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:01,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:01,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:01,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 14:33:01,554 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-04 14:33:01,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1534884361, now seen corresponding path program 1 times [2024-06-04 14:33:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976252849] [2024-06-04 14:33:01,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:02,354 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-04 14:33:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976252849] [2024-06-04 14:33:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976252849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259042897] [2024-06-04 14:33:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:02,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:02,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:02,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 613 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:02,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:02,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:02,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:03,147 INFO L124 PetriNetUnfolderBase]: 2295/3530 cut-off events. [2024-06-04 14:33:03,147 INFO L125 PetriNetUnfolderBase]: For 28654/28665 co-relation queries the response was YES. [2024-06-04 14:33:03,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14946 conditions, 3530 events. 2295/3530 cut-off events. For 28654/28665 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18051 event pairs, 1141 based on Foata normal form. 10/3529 useless extension candidates. Maximal degree in co-relation 14912. Up to 3244 conditions per place. [2024-06-04 14:33:03,168 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 79 selfloop transitions, 49 changer transitions 0/133 dead transitions. [2024-06-04 14:33:03,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 133 transitions, 1146 flow [2024-06-04 14:33:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:33:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:33:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-04 14:33:03,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-04 14:33:03,170 INFO L175 Difference]: Start difference. First operand has 81 places, 90 transitions, 613 flow. Second operand 8 states and 164 transitions. [2024-06-04 14:33:03,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 133 transitions, 1146 flow [2024-06-04 14:33:03,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 133 transitions, 1106 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 14:33:03,184 INFO L231 Difference]: Finished difference. Result has 85 places, 104 transitions, 843 flow [2024-06-04 14:33:03,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=843, PETRI_PLACES=85, PETRI_TRANSITIONS=104} [2024-06-04 14:33:03,184 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2024-06-04 14:33:03,184 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 843 flow [2024-06-04 14:33:03,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:03,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:03,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:03,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 14:33:03,185 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-04 14:33:03,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 842877725, now seen corresponding path program 2 times [2024-06-04 14:33:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472184142] [2024-06-04 14:33:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:04,027 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-04 14:33:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472184142] [2024-06-04 14:33:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472184142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:04,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:04,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788456096] [2024-06-04 14:33:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:04,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:04,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:04,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 843 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:04,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:04,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:04,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:04,853 INFO L124 PetriNetUnfolderBase]: 2365/3638 cut-off events. [2024-06-04 14:33:04,853 INFO L125 PetriNetUnfolderBase]: For 35095/35106 co-relation queries the response was YES. [2024-06-04 14:33:04,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16536 conditions, 3638 events. 2365/3638 cut-off events. For 35095/35106 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18607 event pairs, 1114 based on Foata normal form. 11/3640 useless extension candidates. Maximal degree in co-relation 16500. Up to 3313 conditions per place. [2024-06-04 14:33:04,875 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 83 selfloop transitions, 67 changer transitions 0/155 dead transitions. [2024-06-04 14:33:04,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 155 transitions, 1624 flow [2024-06-04 14:33:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:33:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:33:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-04 14:33:04,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-04 14:33:04,876 INFO L175 Difference]: Start difference. First operand has 85 places, 104 transitions, 843 flow. Second operand 8 states and 166 transitions. [2024-06-04 14:33:04,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 155 transitions, 1624 flow [2024-06-04 14:33:04,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 155 transitions, 1497 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-04 14:33:04,902 INFO L231 Difference]: Finished difference. Result has 92 places, 126 transitions, 1179 flow [2024-06-04 14:33:04,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1179, PETRI_PLACES=92, PETRI_TRANSITIONS=126} [2024-06-04 14:33:04,903 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2024-06-04 14:33:04,903 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 126 transitions, 1179 flow [2024-06-04 14:33:04,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:04,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:04,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:04,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 14:33:04,904 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-04 14:33:04,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 884601245, now seen corresponding path program 3 times [2024-06-04 14:33:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:04,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141338150] [2024-06-04 14:33:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:05,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-04 14:33:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141338150] [2024-06-04 14:33:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141338150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762950881] [2024-06-04 14:33:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:05,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:05,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:05,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 126 transitions, 1179 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:05,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:05,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:05,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:06,757 INFO L124 PetriNetUnfolderBase]: 2367/3641 cut-off events. [2024-06-04 14:33:06,758 INFO L125 PetriNetUnfolderBase]: For 39144/39150 co-relation queries the response was YES. [2024-06-04 14:33:06,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17093 conditions, 3641 events. 2367/3641 cut-off events. For 39144/39150 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18597 event pairs, 1110 based on Foata normal form. 7/3639 useless extension candidates. Maximal degree in co-relation 17053. Up to 3316 conditions per place. [2024-06-04 14:33:06,812 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 83 selfloop transitions, 69 changer transitions 0/157 dead transitions. [2024-06-04 14:33:06,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 157 transitions, 1705 flow [2024-06-04 14:33:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:33:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:33:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-04 14:33:06,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-04 14:33:06,830 INFO L175 Difference]: Start difference. First operand has 92 places, 126 transitions, 1179 flow. Second operand 8 states and 163 transitions. [2024-06-04 14:33:06,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 157 transitions, 1705 flow [2024-06-04 14:33:06,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 157 transitions, 1594 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-04 14:33:06,858 INFO L231 Difference]: Finished difference. Result has 97 places, 129 transitions, 1266 flow [2024-06-04 14:33:06,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1266, PETRI_PLACES=97, PETRI_TRANSITIONS=129} [2024-06-04 14:33:06,858 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 51 predicate places. [2024-06-04 14:33:06,858 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 129 transitions, 1266 flow [2024-06-04 14:33:06,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:06,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:06,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:06,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 14:33:06,859 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-04 14:33:06,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 843057463, now seen corresponding path program 1 times [2024-06-04 14:33:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974887436] [2024-06-04 14:33:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974887436] [2024-06-04 14:33:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974887436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736001539] [2024-06-04 14:33:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:07,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:07,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:33:07,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 129 transitions, 1266 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:07,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:07,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:33:07,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:08,547 INFO L124 PetriNetUnfolderBase]: 2291/3573 cut-off events. [2024-06-04 14:33:08,548 INFO L125 PetriNetUnfolderBase]: For 44209/44220 co-relation queries the response was YES. [2024-06-04 14:33:08,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17162 conditions, 3573 events. 2291/3573 cut-off events. For 44209/44220 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18666 event pairs, 1114 based on Foata normal form. 9/3568 useless extension candidates. Maximal degree in co-relation 17121. Up to 3236 conditions per place. [2024-06-04 14:33:08,568 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 107 selfloop transitions, 45 changer transitions 0/171 dead transitions. [2024-06-04 14:33:08,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 171 transitions, 1866 flow [2024-06-04 14:33:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:33:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:33:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-04 14:33:08,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-04 14:33:08,570 INFO L175 Difference]: Start difference. First operand has 97 places, 129 transitions, 1266 flow. Second operand 8 states and 172 transitions. [2024-06-04 14:33:08,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 171 transitions, 1866 flow [2024-06-04 14:33:08,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 171 transitions, 1715 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-04 14:33:08,610 INFO L231 Difference]: Finished difference. Result has 102 places, 142 transitions, 1378 flow [2024-06-04 14:33:08,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1378, PETRI_PLACES=102, PETRI_TRANSITIONS=142} [2024-06-04 14:33:08,611 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 56 predicate places. [2024-06-04 14:33:08,612 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 142 transitions, 1378 flow [2024-06-04 14:33:08,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:08,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:08,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:08,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 14:33:08,612 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-04 14:33:08,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 59130731, now seen corresponding path program 4 times [2024-06-04 14:33:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448537707] [2024-06-04 14:33:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:09,680 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-04 14:33:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:09,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448537707] [2024-06-04 14:33:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448537707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:09,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:09,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:09,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515905320] [2024-06-04 14:33:09,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:09,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:09,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:09,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:09,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:09,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 142 transitions, 1378 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:09,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:09,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:09,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:10,389 INFO L124 PetriNetUnfolderBase]: 2462/3778 cut-off events. [2024-06-04 14:33:10,389 INFO L125 PetriNetUnfolderBase]: For 51354/51357 co-relation queries the response was YES. [2024-06-04 14:33:10,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19252 conditions, 3778 events. 2462/3778 cut-off events. For 51354/51357 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 19300 event pairs, 1187 based on Foata normal form. 5/3768 useless extension candidates. Maximal degree in co-relation 19208. Up to 3506 conditions per place. [2024-06-04 14:33:10,413 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 118 selfloop transitions, 61 changer transitions 0/184 dead transitions. [2024-06-04 14:33:10,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 184 transitions, 2098 flow [2024-06-04 14:33:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:33:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:33:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 14:33:10,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-04 14:33:10,414 INFO L175 Difference]: Start difference. First operand has 102 places, 142 transitions, 1378 flow. Second operand 8 states and 151 transitions. [2024-06-04 14:33:10,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 184 transitions, 2098 flow [2024-06-04 14:33:10,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 184 transitions, 2056 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-04 14:33:10,453 INFO L231 Difference]: Finished difference. Result has 109 places, 164 transitions, 1771 flow [2024-06-04 14:33:10,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1771, PETRI_PLACES=109, PETRI_TRANSITIONS=164} [2024-06-04 14:33:10,465 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places. [2024-06-04 14:33:10,465 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 164 transitions, 1771 flow [2024-06-04 14:33:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:10,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:10,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:10,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 14:33:10,466 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-04 14:33:10,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash -35833139, now seen corresponding path program 5 times [2024-06-04 14:33:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959509103] [2024-06-04 14:33:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:11,426 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-04 14:33:11,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:11,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959509103] [2024-06-04 14:33:11,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959509103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:11,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:11,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561226177] [2024-06-04 14:33:11,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:11,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:11,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:11,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 164 transitions, 1771 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:11,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:11,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:11,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:12,165 INFO L124 PetriNetUnfolderBase]: 2487/3820 cut-off events. [2024-06-04 14:33:12,165 INFO L125 PetriNetUnfolderBase]: For 57860/57863 co-relation queries the response was YES. [2024-06-04 14:33:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20164 conditions, 3820 events. 2487/3820 cut-off events. For 57860/57863 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 19450 event pairs, 1081 based on Foata normal form. 6/3817 useless extension candidates. Maximal degree in co-relation 20116. Up to 3458 conditions per place. [2024-06-04 14:33:12,186 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 94 selfloop transitions, 100 changer transitions 0/199 dead transitions. [2024-06-04 14:33:12,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 199 transitions, 2509 flow [2024-06-04 14:33:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:33:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:33:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-06-04 14:33:12,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2024-06-04 14:33:12,188 INFO L175 Difference]: Start difference. First operand has 109 places, 164 transitions, 1771 flow. Second operand 7 states and 142 transitions. [2024-06-04 14:33:12,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 199 transitions, 2509 flow [2024-06-04 14:33:12,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 199 transitions, 2373 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-04 14:33:12,238 INFO L231 Difference]: Finished difference. Result has 111 places, 173 transitions, 2026 flow [2024-06-04 14:33:12,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2026, PETRI_PLACES=111, PETRI_TRANSITIONS=173} [2024-06-04 14:33:12,238 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 65 predicate places. [2024-06-04 14:33:12,238 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 173 transitions, 2026 flow [2024-06-04 14:33:12,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:12,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:12,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:12,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 14:33:12,239 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-04 14:33:12,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash -35832891, now seen corresponding path program 2 times [2024-06-04 14:33:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830648031] [2024-06-04 14:33:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:13,177 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-04 14:33:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830648031] [2024-06-04 14:33:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830648031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:13,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:13,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657294331] [2024-06-04 14:33:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:13,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:13,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:33:13,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 173 transitions, 2026 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:13,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:13,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:33:13,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:13,980 INFO L124 PetriNetUnfolderBase]: 2419/3781 cut-off events. [2024-06-04 14:33:13,981 INFO L125 PetriNetUnfolderBase]: For 64042/64045 co-relation queries the response was YES. [2024-06-04 14:33:13,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20409 conditions, 3781 events. 2419/3781 cut-off events. For 64042/64045 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 19884 event pairs, 1195 based on Foata normal form. 6/3771 useless extension candidates. Maximal degree in co-relation 20360. Up to 3405 conditions per place. [2024-06-04 14:33:14,006 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 133 selfloop transitions, 49 changer transitions 0/212 dead transitions. [2024-06-04 14:33:14,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 212 transitions, 2744 flow [2024-06-04 14:33:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:33:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:33:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-04 14:33:14,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 14:33:14,007 INFO L175 Difference]: Start difference. First operand has 111 places, 173 transitions, 2026 flow. Second operand 8 states and 160 transitions. [2024-06-04 14:33:14,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 212 transitions, 2744 flow [2024-06-04 14:33:14,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 212 transitions, 2516 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-04 14:33:14,081 INFO L231 Difference]: Finished difference. Result has 114 places, 187 transitions, 2109 flow [2024-06-04 14:33:14,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2109, PETRI_PLACES=114, PETRI_TRANSITIONS=187} [2024-06-04 14:33:14,082 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 68 predicate places. [2024-06-04 14:33:14,082 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 187 transitions, 2109 flow [2024-06-04 14:33:14,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:14,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:14,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:14,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 14:33:14,083 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-04 14:33:14,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1502526015, now seen corresponding path program 3 times [2024-06-04 14:33:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:14,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908927389] [2024-06-04 14:33:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:14,938 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-04 14:33:14,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:14,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908927389] [2024-06-04 14:33:14,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908927389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:14,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:14,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570195435] [2024-06-04 14:33:14,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:14,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:15,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:33:15,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 187 transitions, 2109 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:15,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:15,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:33:15,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:15,745 INFO L124 PetriNetUnfolderBase]: 2462/3846 cut-off events. [2024-06-04 14:33:15,745 INFO L125 PetriNetUnfolderBase]: For 65973/65973 co-relation queries the response was YES. [2024-06-04 14:33:15,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21070 conditions, 3846 events. 2462/3846 cut-off events. For 65973/65973 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20248 event pairs, 1207 based on Foata normal form. 6/3838 useless extension candidates. Maximal degree in co-relation 21021. Up to 3552 conditions per place. [2024-06-04 14:33:15,772 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 165 selfloop transitions, 21 changer transitions 0/216 dead transitions. [2024-06-04 14:33:15,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 216 transitions, 2707 flow [2024-06-04 14:33:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:33:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:33:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-04 14:33:15,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-04 14:33:15,773 INFO L175 Difference]: Start difference. First operand has 114 places, 187 transitions, 2109 flow. Second operand 8 states and 152 transitions. [2024-06-04 14:33:15,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 216 transitions, 2707 flow [2024-06-04 14:33:15,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 216 transitions, 2594 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-04 14:33:15,832 INFO L231 Difference]: Finished difference. Result has 118 places, 195 transitions, 2205 flow [2024-06-04 14:33:15,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2205, PETRI_PLACES=118, PETRI_TRANSITIONS=195} [2024-06-04 14:33:15,833 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 72 predicate places. [2024-06-04 14:33:15,833 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 195 transitions, 2205 flow [2024-06-04 14:33:15,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:15,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:15,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:15,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 14:33:15,833 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-04 14:33:15,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:15,834 INFO L85 PathProgramCache]: Analyzing trace with hash 280941745, now seen corresponding path program 4 times [2024-06-04 14:33:15,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:15,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218928705] [2024-06-04 14:33:15,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:16,639 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-04 14:33:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218928705] [2024-06-04 14:33:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218928705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:16,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:16,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286851087] [2024-06-04 14:33:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:16,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:16,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:16,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:16,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:33:16,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 195 transitions, 2205 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:16,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:16,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:33:16,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:17,342 INFO L124 PetriNetUnfolderBase]: 2444/3821 cut-off events. [2024-06-04 14:33:17,343 INFO L125 PetriNetUnfolderBase]: For 70243/70243 co-relation queries the response was YES. [2024-06-04 14:33:17,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21108 conditions, 3821 events. 2444/3821 cut-off events. For 70243/70243 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20102 event pairs, 1200 based on Foata normal form. 6/3813 useless extension candidates. Maximal degree in co-relation 21058. Up to 3491 conditions per place. [2024-06-04 14:33:17,371 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 157 selfloop transitions, 33 changer transitions 0/220 dead transitions. [2024-06-04 14:33:17,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 220 transitions, 2704 flow [2024-06-04 14:33:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:33:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:33:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-04 14:33:17,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45396825396825397 [2024-06-04 14:33:17,372 INFO L175 Difference]: Start difference. First operand has 118 places, 195 transitions, 2205 flow. Second operand 7 states and 143 transitions. [2024-06-04 14:33:17,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 220 transitions, 2704 flow [2024-06-04 14:33:17,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 220 transitions, 2521 flow, removed 73 selfloop flow, removed 6 redundant places. [2024-06-04 14:33:17,436 INFO L231 Difference]: Finished difference. Result has 119 places, 195 transitions, 2102 flow [2024-06-04 14:33:17,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2102, PETRI_PLACES=119, PETRI_TRANSITIONS=195} [2024-06-04 14:33:17,437 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 73 predicate places. [2024-06-04 14:33:17,437 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 195 transitions, 2102 flow [2024-06-04 14:33:17,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:17,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:17,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:17,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 14:33:17,438 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-04 14:33:17,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash -965811853, now seen corresponding path program 6 times [2024-06-04 14:33:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:17,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119361325] [2024-06-04 14:33:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:18,333 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-04 14:33:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119361325] [2024-06-04 14:33:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119361325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:33:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434091381] [2024-06-04 14:33:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:18,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:33:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:18,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:33:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:33:18,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:18,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 195 transitions, 2102 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:18,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:18,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:18,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:19,087 INFO L124 PetriNetUnfolderBase]: 2562/3934 cut-off events. [2024-06-04 14:33:19,088 INFO L125 PetriNetUnfolderBase]: For 74293/74293 co-relation queries the response was YES. [2024-06-04 14:33:19,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21775 conditions, 3934 events. 2562/3934 cut-off events. For 74293/74293 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20185 event pairs, 1200 based on Foata normal form. 4/3924 useless extension candidates. Maximal degree in co-relation 21724. Up to 3737 conditions per place. [2024-06-04 14:33:19,116 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 184 selfloop transitions, 24 changer transitions 0/213 dead transitions. [2024-06-04 14:33:19,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 213 transitions, 2595 flow [2024-06-04 14:33:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:33:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:33:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 14:33:19,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-04 14:33:19,118 INFO L175 Difference]: Start difference. First operand has 119 places, 195 transitions, 2102 flow. Second operand 7 states and 133 transitions. [2024-06-04 14:33:19,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 213 transitions, 2595 flow [2024-06-04 14:33:19,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 213 transitions, 2404 flow, removed 53 selfloop flow, removed 6 redundant places. [2024-06-04 14:33:19,182 INFO L231 Difference]: Finished difference. Result has 120 places, 195 transitions, 1974 flow [2024-06-04 14:33:19,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1974, PETRI_PLACES=120, PETRI_TRANSITIONS=195} [2024-06-04 14:33:19,183 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 74 predicate places. [2024-06-04 14:33:19,183 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 195 transitions, 1974 flow [2024-06-04 14:33:19,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:19,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:19,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:19,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 14:33:19,184 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:33:19,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash -929638595, now seen corresponding path program 1 times [2024-06-04 14:33:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070836881] [2024-06-04 14:33:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:19,791 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-04 14:33:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070836881] [2024-06-04 14:33:19,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070836881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:19,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:19,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:33:19,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52146073] [2024-06-04 14:33:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:19,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:33:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:19,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:33:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:33:19,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:33:19,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 195 transitions, 1974 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-04 14:33:19,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:19,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:33:19,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:20,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L792-->L795: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0][40], [Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 302#true, Black: 71#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 135#(and (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 210#true, 50#L795true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 268#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 250#true, Black: 89#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 48#$Ultimate##0true, Black: 283#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 289#true, Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 98#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 41#L766true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 296#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 115#true, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 25#L861true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$r_buff0_thd2~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 163#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-04 14:33:20,182 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-04 14:33:20,182 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-04 14:33:20,182 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-04 14:33:20,182 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-04 14:33:20,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L810-->L812: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][185], [Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 302#true, Black: 71#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 135#(and (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 210#true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 268#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 250#true, Black: 89#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 23#L812true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 289#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 98#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 41#L766true, Black: 296#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 115#true, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 4#L792true, 25#L861true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$r_buff0_thd2~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 163#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-04 14:33:20,209 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,209 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,209 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,209 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L861-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_7| 0)))) (or (and (< v_~__unbuffered_cnt~0_12 0) .cse0) (and (or (< v_~a$mem_tmp~0_8 0) (< 1 v_~a$mem_tmp~0_8) (and (not (= v_~a$mem_tmp~0_8 1)) (not (= v_~a$mem_tmp~0_8 0)))) .cse0) (and (or (not (= v_~a$read_delayed_var~0.base_6 0)) (not (= v_~a$read_delayed_var~0.offset_6 0))) .cse0) (and (not (= (mod v_~a$r_buff0_thd2~0_13 256) 0)) .cse0) (and (not (= (mod v_~a$r_buff1_thd3~0_19 256) 0)) .cse0) (and (not (= (mod v_~a$r_buff1_thd0~0_7 256) 0)) .cse0) (and (not (= (mod v_~a$read_delayed~0_6 256) 0)) .cse0) (and .cse0 (or (and (not (= v_~__unbuffered_p1_EAX~0_7 0)) (not (= v_~__unbuffered_p1_EAX~0_7 1))) (< v_~__unbuffered_p1_EAX~0_7 0) (< 1 v_~__unbuffered_p1_EAX~0_7))) (and (or (< v_~a$w_buff0~0_14 0) (< 1 v_~a$w_buff0~0_14) (and (not (= v_~a$w_buff0~0_14 1)) (not (= v_~a$w_buff0~0_14 0)))) .cse0) (and (or (< 1 v_~__unbuffered_p2_EAX~0_7) (and (not (= v_~__unbuffered_p2_EAX~0_7 1)) (not (= v_~__unbuffered_p2_EAX~0_7 0))) (< v_~__unbuffered_p2_EAX~0_7 0)) .cse0) (and (or (< v_~__unbuffered_p0_EBX~0_7 0) (< 1 v_~__unbuffered_p0_EBX~0_7) (and (not (= v_~__unbuffered_p0_EBX~0_7 1)) (not (= v_~__unbuffered_p0_EBX~0_7 0)))) .cse0) (and (or (and (not (= v_~__unbuffered_p1_EBX~0_7 1)) (not (= v_~__unbuffered_p1_EBX~0_7 0))) (< v_~__unbuffered_p1_EBX~0_7 0) (< 1 v_~__unbuffered_p1_EBX~0_7)) .cse0) (and (or (and (not (= v_~__unbuffered_p2_EBX~0_7 1)) (not (= v_~__unbuffered_p2_EBX~0_7 0))) (< 1 v_~__unbuffered_p2_EBX~0_7) (< v_~__unbuffered_p2_EBX~0_7 0)) .cse0) (and (not (= (mod v_~a$flush_delayed~0_9 256) 0)) .cse0) (and (or (< 1 v_~z~0_9) (and (not (= v_~z~0_9 0)) (not (= v_~z~0_9 1))) (< v_~z~0_9 0)) .cse0) (and (or (< 1 v_~x~0_8) (and (not (= v_~x~0_8 0)) (not (= v_~x~0_8 1))) (< v_~x~0_8 0)) .cse0) (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_21 256) 0))) (and (or (< v_~__unbuffered_p0_EAX~0_7 0) (and (not (= v_~__unbuffered_p0_EAX~0_7 1)) (not (= v_~__unbuffered_p0_EAX~0_7 0))) (< 1 v_~__unbuffered_p0_EAX~0_7)) .cse0) (and (or (< v_~a~0_18 0) (< 1 v_~a~0_18) (and (not (= v_~a~0_18 0)) (not (= v_~a~0_18 1)))) .cse0) (and .cse0 (not (= (mod v_~a$r_buff0_thd0~0_7 256) 0))) (and (or (< v_~a$w_buff1~0_13 0) (< 1 v_~a$w_buff1~0_13) (and (not (= v_~a$w_buff1~0_13 0)) (not (= v_~a$w_buff1~0_13 1)))) .cse0) (and (or (< 1 v_~y~0_9) (< v_~y~0_9 0) (and (not (= v_~y~0_9 1)) (not (= v_~y~0_9 0)))) .cse0) (and .cse0 (not (= (mod v_~a$r_buff1_thd2~0_11 256) 0))))) InVars {~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_13, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_7, ~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_21, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_14, ~a$flush_delayed~0=v_~a$flush_delayed~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_9, ~x~0=v_~x~0_8, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_13, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_7, ~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_21, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_14, ~a$flush_delayed~0=v_~a$flush_delayed~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_9, ~x~0=v_~x~0_8, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[][159], [Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 302#true, Black: 71#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 135#(and (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 210#true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 268#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 250#true, 21#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 89#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 48#$Ultimate##0true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 289#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 98#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 41#L766true, Black: 296#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 115#true, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 4#L792true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$r_buff0_thd2~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 163#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-04 14:33:20,224 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-04 14:33:20,224 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-04 14:33:20,224 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-04 14:33:20,225 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-04 14:33:20,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L861-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_7| 0)))) (or (and (< v_~__unbuffered_cnt~0_12 0) .cse0) (and (or (< v_~a$mem_tmp~0_8 0) (< 1 v_~a$mem_tmp~0_8) (and (not (= v_~a$mem_tmp~0_8 1)) (not (= v_~a$mem_tmp~0_8 0)))) .cse0) (and (or (not (= v_~a$read_delayed_var~0.base_6 0)) (not (= v_~a$read_delayed_var~0.offset_6 0))) .cse0) (and (not (= (mod v_~a$r_buff0_thd2~0_13 256) 0)) .cse0) (and (not (= (mod v_~a$r_buff1_thd3~0_19 256) 0)) .cse0) (and (not (= (mod v_~a$r_buff1_thd0~0_7 256) 0)) .cse0) (and (not (= (mod v_~a$read_delayed~0_6 256) 0)) .cse0) (and .cse0 (or (and (not (= v_~__unbuffered_p1_EAX~0_7 0)) (not (= v_~__unbuffered_p1_EAX~0_7 1))) (< v_~__unbuffered_p1_EAX~0_7 0) (< 1 v_~__unbuffered_p1_EAX~0_7))) (and (or (< v_~a$w_buff0~0_14 0) (< 1 v_~a$w_buff0~0_14) (and (not (= v_~a$w_buff0~0_14 1)) (not (= v_~a$w_buff0~0_14 0)))) .cse0) (and (or (< 1 v_~__unbuffered_p2_EAX~0_7) (and (not (= v_~__unbuffered_p2_EAX~0_7 1)) (not (= v_~__unbuffered_p2_EAX~0_7 0))) (< v_~__unbuffered_p2_EAX~0_7 0)) .cse0) (and (or (< v_~__unbuffered_p0_EBX~0_7 0) (< 1 v_~__unbuffered_p0_EBX~0_7) (and (not (= v_~__unbuffered_p0_EBX~0_7 1)) (not (= v_~__unbuffered_p0_EBX~0_7 0)))) .cse0) (and (or (and (not (= v_~__unbuffered_p1_EBX~0_7 1)) (not (= v_~__unbuffered_p1_EBX~0_7 0))) (< v_~__unbuffered_p1_EBX~0_7 0) (< 1 v_~__unbuffered_p1_EBX~0_7)) .cse0) (and (or (and (not (= v_~__unbuffered_p2_EBX~0_7 1)) (not (= v_~__unbuffered_p2_EBX~0_7 0))) (< 1 v_~__unbuffered_p2_EBX~0_7) (< v_~__unbuffered_p2_EBX~0_7 0)) .cse0) (and (not (= (mod v_~a$flush_delayed~0_9 256) 0)) .cse0) (and (or (< 1 v_~z~0_9) (and (not (= v_~z~0_9 0)) (not (= v_~z~0_9 1))) (< v_~z~0_9 0)) .cse0) (and (or (< 1 v_~x~0_8) (and (not (= v_~x~0_8 0)) (not (= v_~x~0_8 1))) (< v_~x~0_8 0)) .cse0) (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_21 256) 0))) (and (or (< v_~__unbuffered_p0_EAX~0_7 0) (and (not (= v_~__unbuffered_p0_EAX~0_7 1)) (not (= v_~__unbuffered_p0_EAX~0_7 0))) (< 1 v_~__unbuffered_p0_EAX~0_7)) .cse0) (and (or (< v_~a~0_18 0) (< 1 v_~a~0_18) (and (not (= v_~a~0_18 0)) (not (= v_~a~0_18 1)))) .cse0) (and .cse0 (not (= (mod v_~a$r_buff0_thd0~0_7 256) 0))) (and (or (< v_~a$w_buff1~0_13 0) (< 1 v_~a$w_buff1~0_13) (and (not (= v_~a$w_buff1~0_13 0)) (not (= v_~a$w_buff1~0_13 1)))) .cse0) (and (or (< 1 v_~y~0_9) (< v_~y~0_9 0) (and (not (= v_~y~0_9 1)) (not (= v_~y~0_9 0)))) .cse0) (and .cse0 (not (= (mod v_~a$r_buff1_thd2~0_11 256) 0))))) InVars {~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_13, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_7, ~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_21, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_14, ~a$flush_delayed~0=v_~a$flush_delayed~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_9, ~x~0=v_~x~0_8, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_13, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_7, ~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_21, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_14, ~a$flush_delayed~0=v_~a$flush_delayed~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_9, ~x~0=v_~x~0_8, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[][159], [Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 302#true, Black: 71#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 135#(and (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 210#true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 268#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 250#true, 21#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 89#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 48#$Ultimate##0true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 289#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 8#L769true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 98#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 296#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 115#true, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 4#L792true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$r_buff0_thd2~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 163#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-04 14:33:20,232 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,232 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,233 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,233 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-04 14:33:20,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L810-->L812: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][185], [Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 302#true, Black: 71#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 135#(and (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 210#true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 268#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 250#true, Black: 89#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 23#L812true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 8#L769true, 289#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 98#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (or (= ~a~0 1) (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 296#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 115#true, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= |#ghost~multithreaded| 1) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a$r_buff1_thd0~0 (* 256 (div ~a$r_buff1_thd0~0 256))) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256))) (= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256))), 4#L792true, 25#L861true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~x~0 1) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 (div ~a$r_buff0_thd2~0 256)) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$flush_delayed~0 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$read_delayed~0 0) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= ~a$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$w_buff0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~a$r_buff0_thd2~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~a$r_buff0_thd3~0 0)), 163#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~a$read_delayed_var~0.base) (<= 0 ~a$r_buff1_thd2~0) (= ~a$flush_delayed~0 (* 256 (div ~a$flush_delayed~0 256))) (= (* 256 (div ~a$r_buff0_thd3~0 256)) ~a$r_buff0_thd3~0) (= ~a$read_delayed~0 (* 256 (div ~a$read_delayed~0 256))) (<= ~a$r_buff1_thd2~0 (* (div ~a$r_buff1_thd2~0 256) 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~a$read_delayed_var~0.offset 0) (= (* (div ~a$r_buff0_thd2~0 256) 256) ~a$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~a$mem_tmp~0 0) (= ~a$r_buff1_thd3~0 0) (= (* 256 (div ~a$r_buff0_thd0~0 256)) ~a$r_buff0_thd0~0) (= ~a$w_buff0~0 1) (= ~a$r_buff1_thd0~0 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~a$w_buff1~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-04 14:33:20,283 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2024-06-04 14:33:20,283 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-06-04 14:33:20,284 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-06-04 14:33:20,284 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-06-04 14:33:20,626 INFO L124 PetriNetUnfolderBase]: 2930/4518 cut-off events. [2024-06-04 14:33:20,626 INFO L125 PetriNetUnfolderBase]: For 112239/112356 co-relation queries the response was YES. [2024-06-04 14:33:20,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26095 conditions, 4518 events. 2930/4518 cut-off events. For 112239/112356 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 23991 event pairs, 1584 based on Foata normal form. 4/4463 useless extension candidates. Maximal degree in co-relation 26043. Up to 4239 conditions per place. [2024-06-04 14:33:20,660 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 141 selfloop transitions, 9 changer transitions 0/205 dead transitions. [2024-06-04 14:33:20,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 205 transitions, 2322 flow [2024-06-04 14:33:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:33:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:33:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-04 14:33:20,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-04 14:33:20,662 INFO L175 Difference]: Start difference. First operand has 120 places, 195 transitions, 1974 flow. Second operand 5 states and 99 transitions. [2024-06-04 14:33:20,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 205 transitions, 2322 flow [2024-06-04 14:33:20,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 205 transitions, 2232 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 14:33:20,730 INFO L231 Difference]: Finished difference. Result has 119 places, 198 transitions, 1938 flow [2024-06-04 14:33:20,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1938, PETRI_PLACES=119, PETRI_TRANSITIONS=198} [2024-06-04 14:33:20,731 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 73 predicate places. [2024-06-04 14:33:20,731 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 198 transitions, 1938 flow [2024-06-04 14:33:20,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-04 14:33:20,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:20,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:20,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 14:33:20,732 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-04 14:33:20,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1652836499, now seen corresponding path program 1 times [2024-06-04 14:33:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914138502] [2024-06-04 14:33:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914138502] [2024-06-04 14:33:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914138502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:21,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:21,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:21,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977621109] [2024-06-04 14:33:21,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:21,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:21,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:21,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:21,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:21,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 198 transitions, 1938 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:21,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:21,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:21,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:22,777 INFO L124 PetriNetUnfolderBase]: 2837/4339 cut-off events. [2024-06-04 14:33:22,777 INFO L125 PetriNetUnfolderBase]: For 105311/105337 co-relation queries the response was YES. [2024-06-04 14:33:22,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25700 conditions, 4339 events. 2837/4339 cut-off events. For 105311/105337 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22593 event pairs, 1128 based on Foata normal form. 4/4299 useless extension candidates. Maximal degree in co-relation 25647. Up to 3645 conditions per place. [2024-06-04 14:33:22,809 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 134 selfloop transitions, 115 changer transitions 0/255 dead transitions. [2024-06-04 14:33:22,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 255 transitions, 3098 flow [2024-06-04 14:33:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-04 14:33:22,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765432098765432 [2024-06-04 14:33:22,810 INFO L175 Difference]: Start difference. First operand has 119 places, 198 transitions, 1938 flow. Second operand 9 states and 193 transitions. [2024-06-04 14:33:22,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 255 transitions, 3098 flow [2024-06-04 14:33:22,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 255 transitions, 3066 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-04 14:33:22,884 INFO L231 Difference]: Finished difference. Result has 126 places, 214 transitions, 2401 flow [2024-06-04 14:33:22,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2401, PETRI_PLACES=126, PETRI_TRANSITIONS=214} [2024-06-04 14:33:22,885 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 80 predicate places. [2024-06-04 14:33:22,885 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 214 transitions, 2401 flow [2024-06-04 14:33:22,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:22,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:22,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:22,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 14:33:22,885 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-04 14:33:22,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1868755428, now seen corresponding path program 1 times [2024-06-04 14:33:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:22,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998903734] [2024-06-04 14:33:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:23,659 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-04 14:33:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998903734] [2024-06-04 14:33:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998903734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:23,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:23,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817838185] [2024-06-04 14:33:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:23,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:23,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:23,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 214 transitions, 2401 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:23,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:23,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:23,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:24,590 INFO L124 PetriNetUnfolderBase]: 2866/4384 cut-off events. [2024-06-04 14:33:24,590 INFO L125 PetriNetUnfolderBase]: For 117852/117895 co-relation queries the response was YES. [2024-06-04 14:33:24,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27509 conditions, 4384 events. 2866/4384 cut-off events. For 117852/117895 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22964 event pairs, 1157 based on Foata normal form. 12/4348 useless extension candidates. Maximal degree in co-relation 27454. Up to 3835 conditions per place. [2024-06-04 14:33:24,618 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 144 selfloop transitions, 113 changer transitions 0/263 dead transitions. [2024-06-04 14:33:24,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 263 transitions, 3342 flow [2024-06-04 14:33:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-04 14:33:24,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2024-06-04 14:33:24,619 INFO L175 Difference]: Start difference. First operand has 126 places, 214 transitions, 2401 flow. Second operand 9 states and 185 transitions. [2024-06-04 14:33:24,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 263 transitions, 3342 flow [2024-06-04 14:33:24,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 263 transitions, 3267 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-06-04 14:33:24,699 INFO L231 Difference]: Finished difference. Result has 135 places, 228 transitions, 2786 flow [2024-06-04 14:33:24,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2786, PETRI_PLACES=135, PETRI_TRANSITIONS=228} [2024-06-04 14:33:24,700 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 89 predicate places. [2024-06-04 14:33:24,700 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 228 transitions, 2786 flow [2024-06-04 14:33:24,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:24,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:24,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:24,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 14:33:24,700 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-04 14:33:24,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash -338105232, now seen corresponding path program 2 times [2024-06-04 14:33:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410400228] [2024-06-04 14:33:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410400228] [2024-06-04 14:33:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410400228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:25,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:25,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:25,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628792970] [2024-06-04 14:33:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:25,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:25,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:25,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:25,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:25,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 228 transitions, 2786 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:25,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:25,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:25,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:26,458 INFO L124 PetriNetUnfolderBase]: 2925/4480 cut-off events. [2024-06-04 14:33:26,458 INFO L125 PetriNetUnfolderBase]: For 129469/129510 co-relation queries the response was YES. [2024-06-04 14:33:26,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29044 conditions, 4480 events. 2925/4480 cut-off events. For 129469/129510 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 23503 event pairs, 1152 based on Foata normal form. 13/4450 useless extension candidates. Maximal degree in co-relation 28985. Up to 3889 conditions per place. [2024-06-04 14:33:26,487 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 156 selfloop transitions, 123 changer transitions 0/285 dead transitions. [2024-06-04 14:33:26,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 285 transitions, 4021 flow [2024-06-04 14:33:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-04 14:33:26,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617283950617284 [2024-06-04 14:33:26,490 INFO L175 Difference]: Start difference. First operand has 135 places, 228 transitions, 2786 flow. Second operand 9 states and 187 transitions. [2024-06-04 14:33:26,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 285 transitions, 4021 flow [2024-06-04 14:33:26,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 285 transitions, 3724 flow, removed 93 selfloop flow, removed 4 redundant places. [2024-06-04 14:33:26,586 INFO L231 Difference]: Finished difference. Result has 142 places, 250 transitions, 3151 flow [2024-06-04 14:33:26,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2595, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3151, PETRI_PLACES=142, PETRI_TRANSITIONS=250} [2024-06-04 14:33:26,586 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 96 predicate places. [2024-06-04 14:33:26,586 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 250 transitions, 3151 flow [2024-06-04 14:33:26,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:26,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:26,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:26,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 14:33:26,587 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-04 14:33:26,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -336773472, now seen corresponding path program 3 times [2024-06-04 14:33:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:26,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666906376] [2024-06-04 14:33:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:27,367 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-04 14:33:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666906376] [2024-06-04 14:33:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666906376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:27,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:27,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938019614] [2024-06-04 14:33:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:27,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:27,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:27,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 250 transitions, 3151 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:27,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:27,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:27,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:28,467 INFO L124 PetriNetUnfolderBase]: 2927/4483 cut-off events. [2024-06-04 14:33:28,468 INFO L125 PetriNetUnfolderBase]: For 136902/136932 co-relation queries the response was YES. [2024-06-04 14:33:28,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29581 conditions, 4483 events. 2927/4483 cut-off events. For 136902/136932 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 23537 event pairs, 1146 based on Foata normal form. 7/4447 useless extension candidates. Maximal degree in co-relation 29518. Up to 3892 conditions per place. [2024-06-04 14:33:28,505 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 159 selfloop transitions, 122 changer transitions 0/287 dead transitions. [2024-06-04 14:33:28,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 287 transitions, 4035 flow [2024-06-04 14:33:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-04 14:33:28,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.454320987654321 [2024-06-04 14:33:28,508 INFO L175 Difference]: Start difference. First operand has 142 places, 250 transitions, 3151 flow. Second operand 9 states and 184 transitions. [2024-06-04 14:33:28,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 287 transitions, 4035 flow [2024-06-04 14:33:28,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 287 transitions, 3856 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-04 14:33:28,629 INFO L231 Difference]: Finished difference. Result has 147 places, 253 transitions, 3277 flow [2024-06-04 14:33:28,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3277, PETRI_PLACES=147, PETRI_TRANSITIONS=253} [2024-06-04 14:33:28,629 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 101 predicate places. [2024-06-04 14:33:28,630 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 253 transitions, 3277 flow [2024-06-04 14:33:28,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:28,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:28,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:28,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 14:33:28,630 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-04 14:33:28,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 511794985, now seen corresponding path program 2 times [2024-06-04 14:33:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:28,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875841480] [2024-06-04 14:33:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:29,401 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-04 14:33:29,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:29,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875841480] [2024-06-04 14:33:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875841480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:29,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:29,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932834928] [2024-06-04 14:33:29,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:29,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:29,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:29,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 253 transitions, 3277 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:29,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:29,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:29,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:30,597 INFO L124 PetriNetUnfolderBase]: 3042/4652 cut-off events. [2024-06-04 14:33:30,597 INFO L125 PetriNetUnfolderBase]: For 154318/154359 co-relation queries the response was YES. [2024-06-04 14:33:30,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31257 conditions, 4652 events. 3042/4652 cut-off events. For 154318/154359 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 24497 event pairs, 1138 based on Foata normal form. 12/4614 useless extension candidates. Maximal degree in co-relation 31193. Up to 3980 conditions per place. [2024-06-04 14:33:30,636 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 186 selfloop transitions, 132 changer transitions 0/324 dead transitions. [2024-06-04 14:33:30,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 324 transitions, 4622 flow [2024-06-04 14:33:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-04 14:33:30,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617283950617284 [2024-06-04 14:33:30,638 INFO L175 Difference]: Start difference. First operand has 147 places, 253 transitions, 3277 flow. Second operand 9 states and 187 transitions. [2024-06-04 14:33:30,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 324 transitions, 4622 flow [2024-06-04 14:33:30,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 324 transitions, 4375 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 14:33:30,781 INFO L231 Difference]: Finished difference. Result has 153 places, 289 transitions, 3914 flow [2024-06-04 14:33:30,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3030, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3914, PETRI_PLACES=153, PETRI_TRANSITIONS=289} [2024-06-04 14:33:30,782 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 107 predicate places. [2024-06-04 14:33:30,782 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 289 transitions, 3914 flow [2024-06-04 14:33:30,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:30,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:30,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:30,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 14:33:30,783 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-04 14:33:30,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash 359257432, now seen corresponding path program 4 times [2024-06-04 14:33:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:30,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043427150] [2024-06-04 14:33:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:31,624 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-04 14:33:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043427150] [2024-06-04 14:33:31,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043427150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54797183] [2024-06-04 14:33:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:31,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:31,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:31,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 289 transitions, 3914 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:31,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:31,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:31,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:32,855 INFO L124 PetriNetUnfolderBase]: 3086/4733 cut-off events. [2024-06-04 14:33:32,855 INFO L125 PetriNetUnfolderBase]: For 157810/157826 co-relation queries the response was YES. [2024-06-04 14:33:32,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32790 conditions, 4733 events. 3086/4733 cut-off events. For 157810/157826 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 24915 event pairs, 859 based on Foata normal form. 9/4725 useless extension candidates. Maximal degree in co-relation 32722. Up to 4070 conditions per place. [2024-06-04 14:33:32,890 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 195 selfloop transitions, 155 changer transitions 0/356 dead transitions. [2024-06-04 14:33:32,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 356 transitions, 5385 flow [2024-06-04 14:33:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-04 14:33:32,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617283950617284 [2024-06-04 14:33:32,892 INFO L175 Difference]: Start difference. First operand has 153 places, 289 transitions, 3914 flow. Second operand 9 states and 187 transitions. [2024-06-04 14:33:32,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 356 transitions, 5385 flow [2024-06-04 14:33:33,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 356 transitions, 5253 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-04 14:33:33,024 INFO L231 Difference]: Finished difference. Result has 160 places, 323 transitions, 4577 flow [2024-06-04 14:33:33,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3782, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4577, PETRI_PLACES=160, PETRI_TRANSITIONS=323} [2024-06-04 14:33:33,025 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 114 predicate places. [2024-06-04 14:33:33,025 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 323 transitions, 4577 flow [2024-06-04 14:33:33,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:33,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:33,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:33,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 14:33:33,026 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:33:33,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 359407379, now seen corresponding path program 3 times [2024-06-04 14:33:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662015412] [2024-06-04 14:33:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:33,805 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-04 14:33:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662015412] [2024-06-04 14:33:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662015412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:33,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728052108] [2024-06-04 14:33:33,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:33,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:33,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 323 transitions, 4577 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:33,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:33,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:33,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:34,952 INFO L124 PetriNetUnfolderBase]: 3137/4795 cut-off events. [2024-06-04 14:33:34,953 INFO L125 PetriNetUnfolderBase]: For 178071/178110 co-relation queries the response was YES. [2024-06-04 14:33:34,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34122 conditions, 4795 events. 3137/4795 cut-off events. For 178071/178110 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 25470 event pairs, 1140 based on Foata normal form. 16/4766 useless extension candidates. Maximal degree in co-relation 34051. Up to 4028 conditions per place. [2024-06-04 14:33:34,993 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 204 selfloop transitions, 155 changer transitions 0/365 dead transitions. [2024-06-04 14:33:34,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 365 transitions, 5771 flow [2024-06-04 14:33:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-04 14:33:34,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-04 14:33:34,995 INFO L175 Difference]: Start difference. First operand has 160 places, 323 transitions, 4577 flow. Second operand 9 states and 190 transitions. [2024-06-04 14:33:34,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 365 transitions, 5771 flow [2024-06-04 14:33:35,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 365 transitions, 5493 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-04 14:33:35,179 INFO L231 Difference]: Finished difference. Result has 165 places, 326 transitions, 4649 flow [2024-06-04 14:33:35,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4299, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4649, PETRI_PLACES=165, PETRI_TRANSITIONS=326} [2024-06-04 14:33:35,180 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 119 predicate places. [2024-06-04 14:33:35,180 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 326 transitions, 4649 flow [2024-06-04 14:33:35,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:35,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:35,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:35,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 14:33:35,181 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-04 14:33:35,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:35,181 INFO L85 PathProgramCache]: Analyzing trace with hash 359407162, now seen corresponding path program 5 times [2024-06-04 14:33:35,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:35,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733990393] [2024-06-04 14:33:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:35,973 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-04 14:33:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:35,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733990393] [2024-06-04 14:33:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733990393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:35,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:35,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564010233] [2024-06-04 14:33:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:35,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:36,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:36,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 326 transitions, 4649 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:36,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:36,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:36,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:37,182 INFO L124 PetriNetUnfolderBase]: 3109/4769 cut-off events. [2024-06-04 14:33:37,182 INFO L125 PetriNetUnfolderBase]: For 178531/178547 co-relation queries the response was YES. [2024-06-04 14:33:37,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34021 conditions, 4769 events. 3109/4769 cut-off events. For 178531/178547 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 25124 event pairs, 860 based on Foata normal form. 10/4762 useless extension candidates. Maximal degree in co-relation 33949. Up to 4096 conditions per place. [2024-06-04 14:33:37,226 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 204 selfloop transitions, 159 changer transitions 0/369 dead transitions. [2024-06-04 14:33:37,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 369 transitions, 5949 flow [2024-06-04 14:33:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-04 14:33:37,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617283950617284 [2024-06-04 14:33:37,228 INFO L175 Difference]: Start difference. First operand has 165 places, 326 transitions, 4649 flow. Second operand 9 states and 187 transitions. [2024-06-04 14:33:37,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 369 transitions, 5949 flow [2024-06-04 14:33:37,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 369 transitions, 5717 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-04 14:33:37,417 INFO L231 Difference]: Finished difference. Result has 169 places, 335 transitions, 4911 flow [2024-06-04 14:33:37,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4417, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4911, PETRI_PLACES=169, PETRI_TRANSITIONS=335} [2024-06-04 14:33:37,418 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 123 predicate places. [2024-06-04 14:33:37,418 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 335 transitions, 4911 flow [2024-06-04 14:33:37,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:37,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:37,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:37,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 14:33:37,419 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-04 14:33:37,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1652836282, now seen corresponding path program 6 times [2024-06-04 14:33:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864282909] [2024-06-04 14:33:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:38,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864282909] [2024-06-04 14:33:38,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864282909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:38,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:38,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265234565] [2024-06-04 14:33:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:38,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:38,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:38,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:38,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 335 transitions, 4911 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:38,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:38,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:38,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:39,535 INFO L124 PetriNetUnfolderBase]: 3108/4766 cut-off events. [2024-06-04 14:33:39,536 INFO L125 PetriNetUnfolderBase]: For 189636/189649 co-relation queries the response was YES. [2024-06-04 14:33:39,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34325 conditions, 4766 events. 3108/4766 cut-off events. For 189636/189649 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 25055 event pairs, 852 based on Foata normal form. 8/4757 useless extension candidates. Maximal degree in co-relation 34252. Up to 4096 conditions per place. [2024-06-04 14:33:39,573 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 202 selfloop transitions, 164 changer transitions 0/372 dead transitions. [2024-06-04 14:33:39,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 372 transitions, 6042 flow [2024-06-04 14:33:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-04 14:33:39,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-06-04 14:33:39,574 INFO L175 Difference]: Start difference. First operand has 169 places, 335 transitions, 4911 flow. Second operand 9 states and 183 transitions. [2024-06-04 14:33:39,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 372 transitions, 6042 flow [2024-06-04 14:33:39,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 372 transitions, 5769 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-04 14:33:39,754 INFO L231 Difference]: Finished difference. Result has 173 places, 338 transitions, 5039 flow [2024-06-04 14:33:39,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4641, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5039, PETRI_PLACES=173, PETRI_TRANSITIONS=338} [2024-06-04 14:33:39,755 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 127 predicate places. [2024-06-04 14:33:39,755 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 338 transitions, 5039 flow [2024-06-04 14:33:39,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:39,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:39,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:39,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 14:33:39,755 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-04 14:33:39,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash 364979009, now seen corresponding path program 4 times [2024-06-04 14:33:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:39,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619805075] [2024-06-04 14:33:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:39,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:40,637 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-04 14:33:40,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619805075] [2024-06-04 14:33:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619805075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:40,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:40,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865929382] [2024-06-04 14:33:40,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:40,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:40,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:40,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:40,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 338 transitions, 5039 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:40,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:40,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:40,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:41,875 INFO L124 PetriNetUnfolderBase]: 3145/4807 cut-off events. [2024-06-04 14:33:41,875 INFO L125 PetriNetUnfolderBase]: For 212348/212391 co-relation queries the response was YES. [2024-06-04 14:33:41,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35204 conditions, 4807 events. 3145/4807 cut-off events. For 212348/212391 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 25457 event pairs, 1117 based on Foata normal form. 20/4782 useless extension candidates. Maximal degree in co-relation 35130. Up to 4050 conditions per place. [2024-06-04 14:33:41,914 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 217 selfloop transitions, 154 changer transitions 0/377 dead transitions. [2024-06-04 14:33:41,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 377 transitions, 6166 flow [2024-06-04 14:33:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-04 14:33:41,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617283950617284 [2024-06-04 14:33:41,916 INFO L175 Difference]: Start difference. First operand has 173 places, 338 transitions, 5039 flow. Second operand 9 states and 187 transitions. [2024-06-04 14:33:41,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 377 transitions, 6166 flow [2024-06-04 14:33:42,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 377 transitions, 5801 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-04 14:33:42,167 INFO L231 Difference]: Finished difference. Result has 177 places, 338 transitions, 4998 flow [2024-06-04 14:33:42,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4674, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4998, PETRI_PLACES=177, PETRI_TRANSITIONS=338} [2024-06-04 14:33:42,168 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-06-04 14:33:42,168 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 338 transitions, 4998 flow [2024-06-04 14:33:42,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:42,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:42,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:42,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 14:33:42,169 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-04 14:33:42,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1116539766, now seen corresponding path program 7 times [2024-06-04 14:33:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233256893] [2024-06-04 14:33:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:43,296 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-04 14:33:43,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233256893] [2024-06-04 14:33:43,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233256893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:43,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:43,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533289908] [2024-06-04 14:33:43,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:43,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:43,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:43,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 338 transitions, 4998 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:43,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:43,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:43,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:44,337 INFO L124 PetriNetUnfolderBase]: 3237/4948 cut-off events. [2024-06-04 14:33:44,337 INFO L125 PetriNetUnfolderBase]: For 228090/228121 co-relation queries the response was YES. [2024-06-04 14:33:44,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36480 conditions, 4948 events. 3237/4948 cut-off events. For 228090/228121 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 26398 event pairs, 1294 based on Foata normal form. 5/4903 useless extension candidates. Maximal degree in co-relation 36405. Up to 4460 conditions per place. [2024-06-04 14:33:44,383 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 275 selfloop transitions, 115 changer transitions 0/396 dead transitions. [2024-06-04 14:33:44,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 396 transitions, 6418 flow [2024-06-04 14:33:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 14:33:44,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2024-06-04 14:33:44,385 INFO L175 Difference]: Start difference. First operand has 177 places, 338 transitions, 4998 flow. Second operand 9 states and 170 transitions. [2024-06-04 14:33:44,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 396 transitions, 6418 flow [2024-06-04 14:33:44,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 396 transitions, 6087 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 14:33:44,687 INFO L231 Difference]: Finished difference. Result has 179 places, 372 transitions, 5451 flow [2024-06-04 14:33:44,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4667, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5451, PETRI_PLACES=179, PETRI_TRANSITIONS=372} [2024-06-04 14:33:44,688 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 133 predicate places. [2024-06-04 14:33:44,688 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 372 transitions, 5451 flow [2024-06-04 14:33:44,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:44,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:44,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:44,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 14:33:44,689 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-04 14:33:44,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1658940698, now seen corresponding path program 8 times [2024-06-04 14:33:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229287382] [2024-06-04 14:33:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:45,673 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-04 14:33:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:45,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229287382] [2024-06-04 14:33:45,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229287382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:45,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:45,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186322331] [2024-06-04 14:33:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:45,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:45,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:45,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 372 transitions, 5451 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:45,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:45,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:45,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:46,658 INFO L124 PetriNetUnfolderBase]: 3262/4983 cut-off events. [2024-06-04 14:33:46,659 INFO L125 PetriNetUnfolderBase]: For 241214/241245 co-relation queries the response was YES. [2024-06-04 14:33:46,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37262 conditions, 4983 events. 3262/4983 cut-off events. For 241214/241245 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 26569 event pairs, 1296 based on Foata normal form. 6/4939 useless extension candidates. Maximal degree in co-relation 37185. Up to 4488 conditions per place. [2024-06-04 14:33:46,706 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 283 selfloop transitions, 117 changer transitions 0/406 dead transitions. [2024-06-04 14:33:46,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 406 transitions, 6700 flow [2024-06-04 14:33:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 14:33:46,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2024-06-04 14:33:46,707 INFO L175 Difference]: Start difference. First operand has 179 places, 372 transitions, 5451 flow. Second operand 9 states and 170 transitions. [2024-06-04 14:33:46,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 406 transitions, 6700 flow [2024-06-04 14:33:47,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 406 transitions, 6479 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 14:33:47,093 INFO L231 Difference]: Finished difference. Result has 182 places, 381 transitions, 5679 flow [2024-06-04 14:33:47,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=5239, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5679, PETRI_PLACES=182, PETRI_TRANSITIONS=381} [2024-06-04 14:33:47,093 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-06-04 14:33:47,093 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 381 transitions, 5679 flow [2024-06-04 14:33:47,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:47,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:47,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:47,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 14:33:47,094 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-04 14:33:47,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1116389819, now seen corresponding path program 5 times [2024-06-04 14:33:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:47,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666720194] [2024-06-04 14:33:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:48,078 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-04 14:33:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666720194] [2024-06-04 14:33:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666720194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:48,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:48,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717552409] [2024-06-04 14:33:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:48,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:48,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:48,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 381 transitions, 5679 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:48,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:48,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:48,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:49,187 INFO L124 PetriNetUnfolderBase]: 3370/5157 cut-off events. [2024-06-04 14:33:49,187 INFO L125 PetriNetUnfolderBase]: For 258657/258688 co-relation queries the response was YES. [2024-06-04 14:33:49,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38666 conditions, 5157 events. 3370/5157 cut-off events. For 258657/258688 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 27722 event pairs, 1311 based on Foata normal form. 6/5112 useless extension candidates. Maximal degree in co-relation 38588. Up to 4480 conditions per place. [2024-06-04 14:33:49,231 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 303 selfloop transitions, 134 changer transitions 0/443 dead transitions. [2024-06-04 14:33:49,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 443 transitions, 7215 flow [2024-06-04 14:33:49,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-04 14:33:49,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2024-06-04 14:33:49,234 INFO L175 Difference]: Start difference. First operand has 182 places, 381 transitions, 5679 flow. Second operand 9 states and 174 transitions. [2024-06-04 14:33:49,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 443 transitions, 7215 flow [2024-06-04 14:33:49,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 443 transitions, 6982 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-04 14:33:49,589 INFO L231 Difference]: Finished difference. Result has 186 places, 410 transitions, 6181 flow [2024-06-04 14:33:49,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=5446, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6181, PETRI_PLACES=186, PETRI_TRANSITIONS=410} [2024-06-04 14:33:49,590 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 140 predicate places. [2024-06-04 14:33:49,590 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 410 transitions, 6181 flow [2024-06-04 14:33:49,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:49,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:49,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:49,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 14:33:49,590 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-04 14:33:49,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1110818189, now seen corresponding path program 6 times [2024-06-04 14:33:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383769583] [2024-06-04 14:33:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383769583] [2024-06-04 14:33:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383769583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217987980] [2024-06-04 14:33:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:50,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:50,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:50,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 410 transitions, 6181 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:50,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:50,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:50,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:51,733 INFO L124 PetriNetUnfolderBase]: 3492/5337 cut-off events. [2024-06-04 14:33:51,733 INFO L125 PetriNetUnfolderBase]: For 284514/284545 co-relation queries the response was YES. [2024-06-04 14:33:51,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41490 conditions, 5337 events. 3492/5337 cut-off events. For 284514/284545 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 28896 event pairs, 1319 based on Foata normal form. 8/5294 useless extension candidates. Maximal degree in co-relation 41410. Up to 4588 conditions per place. [2024-06-04 14:33:51,787 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 318 selfloop transitions, 154 changer transitions 0/478 dead transitions. [2024-06-04 14:33:51,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 478 transitions, 8218 flow [2024-06-04 14:33:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-04 14:33:51,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4345679012345679 [2024-06-04 14:33:51,804 INFO L175 Difference]: Start difference. First operand has 186 places, 410 transitions, 6181 flow. Second operand 9 states and 176 transitions. [2024-06-04 14:33:51,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 478 transitions, 8218 flow [2024-06-04 14:33:52,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 478 transitions, 8035 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-04 14:33:52,188 INFO L231 Difference]: Finished difference. Result has 191 places, 436 transitions, 6870 flow [2024-06-04 14:33:52,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6018, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6870, PETRI_PLACES=191, PETRI_TRANSITIONS=436} [2024-06-04 14:33:52,189 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 145 predicate places. [2024-06-04 14:33:52,189 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 436 transitions, 6870 flow [2024-06-04 14:33:52,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:52,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:52,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 14:33:52,190 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-04 14:33:52,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1110825846, now seen corresponding path program 9 times [2024-06-04 14:33:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134864645] [2024-06-04 14:33:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:53,206 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-04 14:33:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:53,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134864645] [2024-06-04 14:33:53,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134864645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:53,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:53,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455404690] [2024-06-04 14:33:53,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:53,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:53,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:53,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 436 transitions, 6870 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:53,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:53,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:53,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:54,233 INFO L124 PetriNetUnfolderBase]: 3524/5377 cut-off events. [2024-06-04 14:33:54,233 INFO L125 PetriNetUnfolderBase]: For 297222/297253 co-relation queries the response was YES. [2024-06-04 14:33:54,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42620 conditions, 5377 events. 3524/5377 cut-off events. For 297222/297253 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 29024 event pairs, 1332 based on Foata normal form. 7/5334 useless extension candidates. Maximal degree in co-relation 42538. Up to 4853 conditions per place. [2024-06-04 14:33:54,296 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 341 selfloop transitions, 127 changer transitions 0/474 dead transitions. [2024-06-04 14:33:54,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 474 transitions, 8381 flow [2024-06-04 14:33:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 14:33:54,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2024-06-04 14:33:54,298 INFO L175 Difference]: Start difference. First operand has 191 places, 436 transitions, 6870 flow. Second operand 9 states and 170 transitions. [2024-06-04 14:33:54,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 474 transitions, 8381 flow [2024-06-04 14:33:54,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 474 transitions, 8091 flow, removed 75 selfloop flow, removed 4 redundant places. [2024-06-04 14:33:54,658 INFO L231 Difference]: Finished difference. Result has 196 places, 448 transitions, 7115 flow [2024-06-04 14:33:54,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6580, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7115, PETRI_PLACES=196, PETRI_TRANSITIONS=448} [2024-06-04 14:33:54,659 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 150 predicate places. [2024-06-04 14:33:54,659 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 448 transitions, 7115 flow [2024-06-04 14:33:54,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:54,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:54,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:54,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 14:33:54,659 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-04 14:33:54,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1110825629, now seen corresponding path program 7 times [2024-06-04 14:33:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910439093] [2024-06-04 14:33:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:55,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910439093] [2024-06-04 14:33:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910439093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:55,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:55,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38424628] [2024-06-04 14:33:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:55,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:55,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:55,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:55,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:55,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:55,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 448 transitions, 7115 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:55,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:55,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:55,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:56,887 INFO L124 PetriNetUnfolderBase]: 3502/5356 cut-off events. [2024-06-04 14:33:56,887 INFO L125 PetriNetUnfolderBase]: For 309920/309951 co-relation queries the response was YES. [2024-06-04 14:33:56,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42309 conditions, 5356 events. 3502/5356 cut-off events. For 309920/309951 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 28993 event pairs, 1313 based on Foata normal form. 8/5313 useless extension candidates. Maximal degree in co-relation 42226. Up to 4616 conditions per place. [2024-06-04 14:33:56,931 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 338 selfloop transitions, 150 changer transitions 0/494 dead transitions. [2024-06-04 14:33:56,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 494 transitions, 8598 flow [2024-06-04 14:33:56,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-04 14:33:56,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4345679012345679 [2024-06-04 14:33:56,933 INFO L175 Difference]: Start difference. First operand has 196 places, 448 transitions, 7115 flow. Second operand 9 states and 176 transitions. [2024-06-04 14:33:56,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 494 transitions, 8598 flow [2024-06-04 14:33:57,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 494 transitions, 8165 flow, removed 101 selfloop flow, removed 7 redundant places. [2024-06-04 14:33:57,335 INFO L231 Difference]: Finished difference. Result has 198 places, 448 transitions, 7008 flow [2024-06-04 14:33:57,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6682, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7008, PETRI_PLACES=198, PETRI_TRANSITIONS=448} [2024-06-04 14:33:57,335 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 152 predicate places. [2024-06-04 14:33:57,336 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 448 transitions, 7008 flow [2024-06-04 14:33:57,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:57,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:57,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:57,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 14:33:57,336 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-04 14:33:57,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1682503369, now seen corresponding path program 8 times [2024-06-04 14:33:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364030836] [2024-06-04 14:33:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:33:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:33:58,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:33:58,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364030836] [2024-06-04 14:33:58,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364030836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:33:58,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:33:58,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:33:58,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165207733] [2024-06-04 14:33:58,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:33:58,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:33:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:33:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:33:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:33:58,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:33:58,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 448 transitions, 7008 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:58,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:33:58,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:33:58,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:33:59,447 INFO L124 PetriNetUnfolderBase]: 3552/5432 cut-off events. [2024-06-04 14:33:59,447 INFO L125 PetriNetUnfolderBase]: For 323509/323537 co-relation queries the response was YES. [2024-06-04 14:33:59,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43236 conditions, 5432 events. 3552/5432 cut-off events. For 323509/323537 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 29400 event pairs, 1372 based on Foata normal form. 8/5391 useless extension candidates. Maximal degree in co-relation 43152. Up to 5061 conditions per place. [2024-06-04 14:33:59,499 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 448 selfloop transitions, 36 changer transitions 0/490 dead transitions. [2024-06-04 14:33:59,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 490 transitions, 8447 flow [2024-06-04 14:33:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:33:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:33:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-04 14:33:59,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024691358024691 [2024-06-04 14:33:59,501 INFO L175 Difference]: Start difference. First operand has 198 places, 448 transitions, 7008 flow. Second operand 9 states and 163 transitions. [2024-06-04 14:33:59,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 490 transitions, 8447 flow [2024-06-04 14:33:59,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 490 transitions, 8145 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 14:33:59,921 INFO L231 Difference]: Finished difference. Result has 200 places, 461 transitions, 7122 flow [2024-06-04 14:33:59,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6719, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7122, PETRI_PLACES=200, PETRI_TRANSITIONS=461} [2024-06-04 14:33:59,921 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 154 predicate places. [2024-06-04 14:33:59,921 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 461 transitions, 7122 flow [2024-06-04 14:33:59,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:33:59,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:33:59,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:33:59,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 14:33:59,922 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-04 14:33:59,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:33:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1915643235, now seen corresponding path program 9 times [2024-06-04 14:33:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:33:59,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675717698] [2024-06-04 14:33:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:33:59,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:33:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:34:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675717698] [2024-06-04 14:34:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675717698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:34:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502515949] [2024-06-04 14:34:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:00,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:34:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:34:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:34:01,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:01,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 461 transitions, 7122 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:01,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:01,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:01,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:02,238 INFO L124 PetriNetUnfolderBase]: 3602/5506 cut-off events. [2024-06-04 14:34:02,238 INFO L125 PetriNetUnfolderBase]: For 341091/341119 co-relation queries the response was YES. [2024-06-04 14:34:02,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43952 conditions, 5506 events. 3602/5506 cut-off events. For 341091/341119 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 29897 event pairs, 1358 based on Foata normal form. 8/5465 useless extension candidates. Maximal degree in co-relation 43867. Up to 4985 conditions per place. [2024-06-04 14:34:02,295 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 421 selfloop transitions, 84 changer transitions 0/511 dead transitions. [2024-06-04 14:34:02,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 511 transitions, 8861 flow [2024-06-04 14:34:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:34:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:34:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-04 14:34:02,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41728395061728396 [2024-06-04 14:34:02,296 INFO L175 Difference]: Start difference. First operand has 200 places, 461 transitions, 7122 flow. Second operand 9 states and 169 transitions. [2024-06-04 14:34:02,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 511 transitions, 8861 flow [2024-06-04 14:34:02,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 511 transitions, 8678 flow, removed 64 selfloop flow, removed 7 redundant places. [2024-06-04 14:34:02,826 INFO L231 Difference]: Finished difference. Result has 202 places, 474 transitions, 7437 flow [2024-06-04 14:34:02,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6939, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7437, PETRI_PLACES=202, PETRI_TRANSITIONS=474} [2024-06-04 14:34:02,827 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 156 predicate places. [2024-06-04 14:34:02,827 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 474 transitions, 7437 flow [2024-06-04 14:34:02,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:02,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:02,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:02,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 14:34:02,828 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-04 14:34:02,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1915643018, now seen corresponding path program 10 times [2024-06-04 14:34:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:02,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200851771] [2024-06-04 14:34:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:03,771 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-04 14:34:03,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200851771] [2024-06-04 14:34:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200851771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:34:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640984278] [2024-06-04 14:34:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:03,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:34:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:03,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:34:03,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:34:03,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:03,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 474 transitions, 7437 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:03,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:03,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:03,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:04,881 INFO L124 PetriNetUnfolderBase]: 3588/5485 cut-off events. [2024-06-04 14:34:04,881 INFO L125 PetriNetUnfolderBase]: For 349088/349116 co-relation queries the response was YES. [2024-06-04 14:34:04,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44059 conditions, 5485 events. 3588/5485 cut-off events. For 349088/349116 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 29834 event pairs, 1368 based on Foata normal form. 5/5441 useless extension candidates. Maximal degree in co-relation 43973. Up to 5143 conditions per place. [2024-06-04 14:34:04,938 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 453 selfloop transitions, 37 changer transitions 0/496 dead transitions. [2024-06-04 14:34:04,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 496 transitions, 8555 flow [2024-06-04 14:34:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:34:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:34:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-04 14:34:04,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39753086419753086 [2024-06-04 14:34:04,940 INFO L175 Difference]: Start difference. First operand has 202 places, 474 transitions, 7437 flow. Second operand 9 states and 161 transitions. [2024-06-04 14:34:04,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 496 transitions, 8555 flow [2024-06-04 14:34:05,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 496 transitions, 8095 flow, removed 117 selfloop flow, removed 7 redundant places. [2024-06-04 14:34:05,444 INFO L231 Difference]: Finished difference. Result has 204 places, 474 transitions, 7070 flow [2024-06-04 14:34:05,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6977, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7070, PETRI_PLACES=204, PETRI_TRANSITIONS=474} [2024-06-04 14:34:05,444 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 158 predicate places. [2024-06-04 14:34:05,445 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 474 transitions, 7070 flow [2024-06-04 14:34:05,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:05,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:05,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:05,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 14:34:05,445 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-04 14:34:05,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1915650675, now seen corresponding path program 10 times [2024-06-04 14:34:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577463146] [2024-06-04 14:34:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:34:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577463146] [2024-06-04 14:34:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577463146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:34:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120319948] [2024-06-04 14:34:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:06,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:34:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:06,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:34:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:34:06,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:06,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 474 transitions, 7070 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:06,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:06,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:06,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:07,606 INFO L124 PetriNetUnfolderBase]: 3566/5457 cut-off events. [2024-06-04 14:34:07,606 INFO L125 PetriNetUnfolderBase]: For 356611/356639 co-relation queries the response was YES. [2024-06-04 14:34:07,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43389 conditions, 5457 events. 3566/5457 cut-off events. For 356611/356639 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 29639 event pairs, 1363 based on Foata normal form. 8/5416 useless extension candidates. Maximal degree in co-relation 43302. Up to 4948 conditions per place. [2024-06-04 14:34:07,664 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 430 selfloop transitions, 80 changer transitions 0/516 dead transitions. [2024-06-04 14:34:07,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 516 transitions, 8423 flow [2024-06-04 14:34:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:34:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:34:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-04 14:34:07,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2024-06-04 14:34:07,666 INFO L175 Difference]: Start difference. First operand has 204 places, 474 transitions, 7070 flow. Second operand 9 states and 168 transitions. [2024-06-04 14:34:07,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 516 transitions, 8423 flow [2024-06-04 14:34:08,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 516 transitions, 8173 flow, removed 61 selfloop flow, removed 8 redundant places. [2024-06-04 14:34:08,124 INFO L231 Difference]: Finished difference. Result has 205 places, 474 transitions, 7003 flow [2024-06-04 14:34:08,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6822, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7003, PETRI_PLACES=205, PETRI_TRANSITIONS=474} [2024-06-04 14:34:08,125 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 159 predicate places. [2024-06-04 14:34:08,125 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 474 transitions, 7003 flow [2024-06-04 14:34:08,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:08,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:08,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:08,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 14:34:08,125 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:08,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1925186058, now seen corresponding path program 1 times [2024-06-04 14:34:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629224744] [2024-06-04 14:34:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:09,305 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-04 14:34:09,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629224744] [2024-06-04 14:34:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629224744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:09,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:09,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410029254] [2024-06-04 14:34:09,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:09,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:09,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:09,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:09,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 474 transitions, 7003 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:09,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:09,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:09,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:10,748 INFO L124 PetriNetUnfolderBase]: 3995/6047 cut-off events. [2024-06-04 14:34:10,748 INFO L125 PetriNetUnfolderBase]: For 425136/425220 co-relation queries the response was YES. [2024-06-04 14:34:10,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47765 conditions, 6047 events. 3995/6047 cut-off events. For 425136/425220 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 32232 event pairs, 1633 based on Foata normal form. 38/6000 useless extension candidates. Maximal degree in co-relation 47678. Up to 5520 conditions per place. [2024-06-04 14:34:10,815 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 407 selfloop transitions, 19 changer transitions 0/502 dead transitions. [2024-06-04 14:34:10,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 502 transitions, 8040 flow [2024-06-04 14:34:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:34:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:34:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 14:34:10,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-04 14:34:10,817 INFO L175 Difference]: Start difference. First operand has 205 places, 474 transitions, 7003 flow. Second operand 8 states and 151 transitions. [2024-06-04 14:34:10,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 502 transitions, 8040 flow [2024-06-04 14:34:11,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 502 transitions, 7760 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-04 14:34:11,326 INFO L231 Difference]: Finished difference. Result has 205 places, 479 transitions, 6855 flow [2024-06-04 14:34:11,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6728, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6855, PETRI_PLACES=205, PETRI_TRANSITIONS=479} [2024-06-04 14:34:11,327 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 159 predicate places. [2024-06-04 14:34:11,327 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 479 transitions, 6855 flow [2024-06-04 14:34:11,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:11,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:11,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:11,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 14:34:11,327 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-04 14:34:11,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1197714234, now seen corresponding path program 1 times [2024-06-04 14:34:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471334690] [2024-06-04 14:34:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:12,074 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-04 14:34:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471334690] [2024-06-04 14:34:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471334690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:12,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:12,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:34:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531058980] [2024-06-04 14:34:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:34:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:34:12,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:34:12,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:34:12,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 479 transitions, 6855 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:12,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:12,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:34:12,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:13,340 INFO L124 PetriNetUnfolderBase]: 3668/5720 cut-off events. [2024-06-04 14:34:13,340 INFO L125 PetriNetUnfolderBase]: For 421052/421244 co-relation queries the response was YES. [2024-06-04 14:34:13,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45545 conditions, 5720 events. 3668/5720 cut-off events. For 421052/421244 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 31789 event pairs, 1679 based on Foata normal form. 69/5737 useless extension candidates. Maximal degree in co-relation 45456. Up to 5055 conditions per place. [2024-06-04 14:34:13,401 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 297 selfloop transitions, 12 changer transitions 0/492 dead transitions. [2024-06-04 14:34:13,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 492 transitions, 7537 flow [2024-06-04 14:34:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:34:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:34:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-04 14:34:13,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2024-06-04 14:34:13,403 INFO L175 Difference]: Start difference. First operand has 205 places, 479 transitions, 6855 flow. Second operand 6 states and 116 transitions. [2024-06-04 14:34:13,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 492 transitions, 7537 flow [2024-06-04 14:34:13,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 492 transitions, 7464 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-04 14:34:13,910 INFO L231 Difference]: Finished difference. Result has 206 places, 482 transitions, 6848 flow [2024-06-04 14:34:13,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6782, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6848, PETRI_PLACES=206, PETRI_TRANSITIONS=482} [2024-06-04 14:34:13,911 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 160 predicate places. [2024-06-04 14:34:13,911 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 482 transitions, 6848 flow [2024-06-04 14:34:13,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:13,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:13,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:13,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 14:34:13,912 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:13,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1360156534, now seen corresponding path program 1 times [2024-06-04 14:34:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:13,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854702589] [2024-06-04 14:34:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:14,850 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-04 14:34:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854702589] [2024-06-04 14:34:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854702589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986215770] [2024-06-04 14:34:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:14,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:14,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:14,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:14,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 482 transitions, 6848 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:14,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:14,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:14,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:16,288 INFO L124 PetriNetUnfolderBase]: 3956/6054 cut-off events. [2024-06-04 14:34:16,288 INFO L125 PetriNetUnfolderBase]: For 418926/418936 co-relation queries the response was YES. [2024-06-04 14:34:16,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48741 conditions, 6054 events. 3956/6054 cut-off events. For 418926/418936 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 32993 event pairs, 1018 based on Foata normal form. 8/6051 useless extension candidates. Maximal degree in co-relation 48651. Up to 4443 conditions per place. [2024-06-04 14:34:16,351 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 262 selfloop transitions, 285 changer transitions 0/554 dead transitions. [2024-06-04 14:34:16,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 554 transitions, 9379 flow [2024-06-04 14:34:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions. [2024-06-04 14:34:16,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-04 14:34:16,353 INFO L175 Difference]: Start difference. First operand has 206 places, 482 transitions, 6848 flow. Second operand 10 states and 220 transitions. [2024-06-04 14:34:16,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 554 transitions, 9379 flow [2024-06-04 14:34:16,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 554 transitions, 9335 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 14:34:16,832 INFO L231 Difference]: Finished difference. Result has 213 places, 501 transitions, 7764 flow [2024-06-04 14:34:16,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6804, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7764, PETRI_PLACES=213, PETRI_TRANSITIONS=501} [2024-06-04 14:34:16,833 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 167 predicate places. [2024-06-04 14:34:16,833 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 501 transitions, 7764 flow [2024-06-04 14:34:16,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:16,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:16,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:16,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 14:34:16,833 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-04 14:34:16,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2138505926, now seen corresponding path program 1 times [2024-06-04 14:34:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074654605] [2024-06-04 14:34:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:17,733 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-04 14:34:17,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074654605] [2024-06-04 14:34:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074654605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:17,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:17,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:17,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868060712] [2024-06-04 14:34:17,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:17,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:17,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:17,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:17,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:17,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 501 transitions, 7764 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:17,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:17,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:17,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:19,280 INFO L124 PetriNetUnfolderBase]: 4025/6149 cut-off events. [2024-06-04 14:34:19,280 INFO L125 PetriNetUnfolderBase]: For 459995/460049 co-relation queries the response was YES. [2024-06-04 14:34:19,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51986 conditions, 6149 events. 4025/6149 cut-off events. For 459995/460049 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 33845 event pairs, 1292 based on Foata normal form. 13/6119 useless extension candidates. Maximal degree in co-relation 51894. Up to 5639 conditions per place. [2024-06-04 14:34:19,347 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 471 selfloop transitions, 77 changer transitions 0/555 dead transitions. [2024-06-04 14:34:19,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 555 transitions, 9246 flow [2024-06-04 14:34:19,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 14:34:19,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-04 14:34:19,349 INFO L175 Difference]: Start difference. First operand has 213 places, 501 transitions, 7764 flow. Second operand 10 states and 197 transitions. [2024-06-04 14:34:19,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 555 transitions, 9246 flow [2024-06-04 14:34:20,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 555 transitions, 9145 flow, removed 44 selfloop flow, removed 2 redundant places. [2024-06-04 14:34:20,029 INFO L231 Difference]: Finished difference. Result has 222 places, 515 transitions, 8013 flow [2024-06-04 14:34:20,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7663, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8013, PETRI_PLACES=222, PETRI_TRANSITIONS=515} [2024-06-04 14:34:20,029 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 176 predicate places. [2024-06-04 14:34:20,029 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 515 transitions, 8013 flow [2024-06-04 14:34:20,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:20,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:20,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:20,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 14:34:20,030 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:20,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1553647064, now seen corresponding path program 2 times [2024-06-04 14:34:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:20,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785550522] [2024-06-04 14:34:20,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:20,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:20,782 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-04 14:34:20,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:20,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785550522] [2024-06-04 14:34:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785550522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:20,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:20,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 14:34:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688251687] [2024-06-04 14:34:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:20,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 14:34:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 14:34:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 14:34:20,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:20,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 515 transitions, 8013 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:20,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:20,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:20,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:22,369 INFO L124 PetriNetUnfolderBase]: 4068/6195 cut-off events. [2024-06-04 14:34:22,369 INFO L125 PetriNetUnfolderBase]: For 484794/484843 co-relation queries the response was YES. [2024-06-04 14:34:22,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53339 conditions, 6195 events. 4068/6195 cut-off events. For 484794/484843 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 33938 event pairs, 1248 based on Foata normal form. 17/6169 useless extension candidates. Maximal degree in co-relation 53244. Up to 5198 conditions per place. [2024-06-04 14:34:22,428 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 328 selfloop transitions, 234 changer transitions 0/569 dead transitions. [2024-06-04 14:34:22,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 569 transitions, 9908 flow [2024-06-04 14:34:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:34:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:34:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-06-04 14:34:22,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641975308641975 [2024-06-04 14:34:22,430 INFO L175 Difference]: Start difference. First operand has 222 places, 515 transitions, 8013 flow. Second operand 9 states and 188 transitions. [2024-06-04 14:34:22,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 569 transitions, 9908 flow [2024-06-04 14:34:22,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 569 transitions, 9648 flow, removed 85 selfloop flow, removed 4 redundant places. [2024-06-04 14:34:22,968 INFO L231 Difference]: Finished difference. Result has 229 places, 534 transitions, 8768 flow [2024-06-04 14:34:22,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7857, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8768, PETRI_PLACES=229, PETRI_TRANSITIONS=534} [2024-06-04 14:34:22,969 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 183 predicate places. [2024-06-04 14:34:22,969 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 534 transitions, 8768 flow [2024-06-04 14:34:22,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:22,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:22,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:22,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 14:34:22,970 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-04 14:34:22,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1519874786, now seen corresponding path program 2 times [2024-06-04 14:34:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:22,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939129588] [2024-06-04 14:34:22,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:22,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:23,835 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-04 14:34:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939129588] [2024-06-04 14:34:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939129588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389446877] [2024-06-04 14:34:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:23,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:23,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:23,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 534 transitions, 8768 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:23,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:23,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:23,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:25,541 INFO L124 PetriNetUnfolderBase]: 4196/6399 cut-off events. [2024-06-04 14:34:25,541 INFO L125 PetriNetUnfolderBase]: For 525728/525774 co-relation queries the response was YES. [2024-06-04 14:34:25,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56572 conditions, 6399 events. 4196/6399 cut-off events. For 525728/525774 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 35369 event pairs, 1225 based on Foata normal form. 28/6380 useless extension candidates. Maximal degree in co-relation 56474. Up to 5034 conditions per place. [2024-06-04 14:34:25,609 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 324 selfloop transitions, 302 changer transitions 0/633 dead transitions. [2024-06-04 14:34:25,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 633 transitions, 11319 flow [2024-06-04 14:34:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2024-06-04 14:34:25,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46444444444444444 [2024-06-04 14:34:25,610 INFO L175 Difference]: Start difference. First operand has 229 places, 534 transitions, 8768 flow. Second operand 10 states and 209 transitions. [2024-06-04 14:34:25,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 633 transitions, 11319 flow [2024-06-04 14:34:26,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 633 transitions, 11054 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-04 14:34:26,379 INFO L231 Difference]: Finished difference. Result has 236 places, 592 transitions, 10331 flow [2024-06-04 14:34:26,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=8509, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10331, PETRI_PLACES=236, PETRI_TRANSITIONS=592} [2024-06-04 14:34:26,380 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 190 predicate places. [2024-06-04 14:34:26,380 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 592 transitions, 10331 flow [2024-06-04 14:34:26,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:26,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:26,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:26,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 14:34:26,381 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-04 14:34:26,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1152299220, now seen corresponding path program 3 times [2024-06-04 14:34:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829077111] [2024-06-04 14:34:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:27,321 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-04 14:34:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829077111] [2024-06-04 14:34:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829077111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:27,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:27,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769346644] [2024-06-04 14:34:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:27,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:27,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:27,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:27,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:27,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 592 transitions, 10331 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:27,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:27,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:27,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:28,975 INFO L124 PetriNetUnfolderBase]: 4246/6488 cut-off events. [2024-06-04 14:34:28,975 INFO L125 PetriNetUnfolderBase]: For 517585/517601 co-relation queries the response was YES. [2024-06-04 14:34:29,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59488 conditions, 6488 events. 4246/6488 cut-off events. For 517585/517601 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 36064 event pairs, 1266 based on Foata normal form. 7/6469 useless extension candidates. Maximal degree in co-relation 59387. Up to 5924 conditions per place. [2024-06-04 14:34:29,050 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 549 selfloop transitions, 96 changer transitions 0/652 dead transitions. [2024-06-04 14:34:29,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 652 transitions, 12108 flow [2024-06-04 14:34:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 14:34:29,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-04 14:34:29,051 INFO L175 Difference]: Start difference. First operand has 236 places, 592 transitions, 10331 flow. Second operand 10 states and 197 transitions. [2024-06-04 14:34:29,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 652 transitions, 12108 flow [2024-06-04 14:34:29,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 652 transitions, 11845 flow, removed 96 selfloop flow, removed 4 redundant places. [2024-06-04 14:34:29,860 INFO L231 Difference]: Finished difference. Result has 243 places, 616 transitions, 10629 flow [2024-06-04 14:34:29,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=10068, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10629, PETRI_PLACES=243, PETRI_TRANSITIONS=616} [2024-06-04 14:34:29,861 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 197 predicate places. [2024-06-04 14:34:29,861 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 616 transitions, 10629 flow [2024-06-04 14:34:29,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:29,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:29,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:29,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 14:34:29,862 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:29,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1992778690, now seen corresponding path program 3 times [2024-06-04 14:34:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:29,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593838780] [2024-06-04 14:34:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:34:30,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593838780] [2024-06-04 14:34:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593838780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303281607] [2024-06-04 14:34:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:30,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:30,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:30,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:30,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:30,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 616 transitions, 10629 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:30,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:30,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:30,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:32,578 INFO L124 PetriNetUnfolderBase]: 4395/6693 cut-off events. [2024-06-04 14:34:32,578 INFO L125 PetriNetUnfolderBase]: For 566683/566716 co-relation queries the response was YES. [2024-06-04 14:34:32,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61606 conditions, 6693 events. 4395/6693 cut-off events. For 566683/566716 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 37384 event pairs, 1267 based on Foata normal form. 18/6663 useless extension candidates. Maximal degree in co-relation 61502. Up to 5134 conditions per place. [2024-06-04 14:34:32,673 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 340 selfloop transitions, 350 changer transitions 0/697 dead transitions. [2024-06-04 14:34:32,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 697 transitions, 13290 flow [2024-06-04 14:34:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-04 14:34:32,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711111111111111 [2024-06-04 14:34:32,675 INFO L175 Difference]: Start difference. First operand has 243 places, 616 transitions, 10629 flow. Second operand 10 states and 212 transitions. [2024-06-04 14:34:32,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 697 transitions, 13290 flow [2024-06-04 14:34:33,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 697 transitions, 13062 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-04 14:34:33,576 INFO L231 Difference]: Finished difference. Result has 250 places, 652 transitions, 11889 flow [2024-06-04 14:34:33,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=10401, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11889, PETRI_PLACES=250, PETRI_TRANSITIONS=652} [2024-06-04 14:34:33,577 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 204 predicate places. [2024-06-04 14:34:33,577 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 652 transitions, 11889 flow [2024-06-04 14:34:33,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:33,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:33,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:33,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 14:34:33,578 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-04 14:34:33,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1152419190, now seen corresponding path program 4 times [2024-06-04 14:34:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869722301] [2024-06-04 14:34:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:34,565 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-04 14:34:34,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869722301] [2024-06-04 14:34:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869722301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:34,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:34,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887597228] [2024-06-04 14:34:34,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:34,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:34,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:34,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:34,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:34,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 652 transitions, 11889 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:34,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:34,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:34,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:36,399 INFO L124 PetriNetUnfolderBase]: 4422/6739 cut-off events. [2024-06-04 14:34:36,400 INFO L125 PetriNetUnfolderBase]: For 574220/574236 co-relation queries the response was YES. [2024-06-04 14:34:36,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63665 conditions, 6739 events. 4422/6739 cut-off events. For 574220/574236 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 37510 event pairs, 1188 based on Foata normal form. 9/6732 useless extension candidates. Maximal degree in co-relation 63559. Up to 5655 conditions per place. [2024-06-04 14:34:36,629 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 452 selfloop transitions, 253 changer transitions 0/712 dead transitions. [2024-06-04 14:34:36,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 712 transitions, 14316 flow [2024-06-04 14:34:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-04 14:34:36,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2024-06-04 14:34:36,631 INFO L175 Difference]: Start difference. First operand has 250 places, 652 transitions, 11889 flow. Second operand 10 states and 208 transitions. [2024-06-04 14:34:36,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 712 transitions, 14316 flow [2024-06-04 14:34:37,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 712 transitions, 13759 flow, removed 93 selfloop flow, removed 6 redundant places. [2024-06-04 14:34:37,537 INFO L231 Difference]: Finished difference. Result has 255 places, 671 transitions, 12274 flow [2024-06-04 14:34:37,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=11332, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12274, PETRI_PLACES=255, PETRI_TRANSITIONS=671} [2024-06-04 14:34:37,537 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 209 predicate places. [2024-06-04 14:34:37,538 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 671 transitions, 12274 flow [2024-06-04 14:34:37,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:37,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:37,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:37,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 14:34:37,538 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:37,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1850041360, now seen corresponding path program 4 times [2024-06-04 14:34:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227177857] [2024-06-04 14:34:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:38,384 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-04 14:34:38,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227177857] [2024-06-04 14:34:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227177857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267651199] [2024-06-04 14:34:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:38,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:38,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:38,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 671 transitions, 12274 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:38,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:38,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:38,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:40,727 INFO L124 PetriNetUnfolderBase]: 4546/6919 cut-off events. [2024-06-04 14:34:40,727 INFO L125 PetriNetUnfolderBase]: For 628891/628924 co-relation queries the response was YES. [2024-06-04 14:34:40,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65625 conditions, 6919 events. 4546/6919 cut-off events. For 628891/628924 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 38824 event pairs, 1259 based on Foata normal form. 16/6888 useless extension candidates. Maximal degree in co-relation 65518. Up to 5302 conditions per place. [2024-06-04 14:34:40,818 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 385 selfloop transitions, 352 changer transitions 0/744 dead transitions. [2024-06-04 14:34:40,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 744 transitions, 14965 flow [2024-06-04 14:34:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-04 14:34:40,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-04 14:34:40,819 INFO L175 Difference]: Start difference. First operand has 255 places, 671 transitions, 12274 flow. Second operand 10 states and 213 transitions. [2024-06-04 14:34:40,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 744 transitions, 14965 flow [2024-06-04 14:34:41,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 744 transitions, 14585 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-04 14:34:41,799 INFO L231 Difference]: Finished difference. Result has 260 places, 694 transitions, 12995 flow [2024-06-04 14:34:41,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=11894, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12995, PETRI_PLACES=260, PETRI_TRANSITIONS=694} [2024-06-04 14:34:41,800 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 214 predicate places. [2024-06-04 14:34:41,800 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 694 transitions, 12995 flow [2024-06-04 14:34:41,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:41,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:41,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:41,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 14:34:41,801 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:41,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1157060820, now seen corresponding path program 5 times [2024-06-04 14:34:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912182162] [2024-06-04 14:34:41,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:34:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:42,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912182162] [2024-06-04 14:34:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912182162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:42,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:42,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428843669] [2024-06-04 14:34:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:42,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:42,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:42,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:42,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 694 transitions, 12995 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:42,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:42,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:42,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:44,728 INFO L124 PetriNetUnfolderBase]: 4549/6924 cut-off events. [2024-06-04 14:34:44,728 INFO L125 PetriNetUnfolderBase]: For 632946/632988 co-relation queries the response was YES. [2024-06-04 14:34:44,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66505 conditions, 6924 events. 4549/6924 cut-off events. For 632946/632988 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38676 event pairs, 1171 based on Foata normal form. 17/6920 useless extension candidates. Maximal degree in co-relation 66397. Up to 5835 conditions per place. [2024-06-04 14:34:44,813 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 472 selfloop transitions, 256 changer transitions 0/735 dead transitions. [2024-06-04 14:34:44,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 735 transitions, 15018 flow [2024-06-04 14:34:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-04 14:34:44,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2024-06-04 14:34:44,815 INFO L175 Difference]: Start difference. First operand has 260 places, 694 transitions, 12995 flow. Second operand 10 states and 204 transitions. [2024-06-04 14:34:44,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 735 transitions, 15018 flow [2024-06-04 14:34:45,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 735 transitions, 14463 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-06-04 14:34:45,894 INFO L231 Difference]: Finished difference. Result has 265 places, 697 transitions, 13028 flow [2024-06-04 14:34:45,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=12440, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13028, PETRI_PLACES=265, PETRI_TRANSITIONS=697} [2024-06-04 14:34:45,895 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 219 predicate places. [2024-06-04 14:34:45,895 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 697 transitions, 13028 flow [2024-06-04 14:34:45,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:45,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:45,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:45,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 14:34:45,896 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-04 14:34:45,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1891146430, now seen corresponding path program 5 times [2024-06-04 14:34:45,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:45,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53525555] [2024-06-04 14:34:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:46,724 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-04 14:34:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53525555] [2024-06-04 14:34:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53525555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:46,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910760937] [2024-06-04 14:34:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:46,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:46,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:46,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:46,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 697 transitions, 13028 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:46,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:46,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:46,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:48,756 INFO L124 PetriNetUnfolderBase]: 4526/6894 cut-off events. [2024-06-04 14:34:48,756 INFO L125 PetriNetUnfolderBase]: For 670248/670301 co-relation queries the response was YES. [2024-06-04 14:34:48,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65871 conditions, 6894 events. 4526/6894 cut-off events. For 670248/670301 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 38685 event pairs, 1256 based on Foata normal form. 36/6883 useless extension candidates. Maximal degree in co-relation 65762. Up to 5287 conditions per place. [2024-06-04 14:34:48,843 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 374 selfloop transitions, 360 changer transitions 0/741 dead transitions. [2024-06-04 14:34:48,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 741 transitions, 15095 flow [2024-06-04 14:34:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2024-06-04 14:34:48,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46444444444444444 [2024-06-04 14:34:48,845 INFO L175 Difference]: Start difference. First operand has 265 places, 697 transitions, 13028 flow. Second operand 10 states and 209 transitions. [2024-06-04 14:34:48,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 741 transitions, 15095 flow [2024-06-04 14:34:50,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 741 transitions, 14493 flow, removed 97 selfloop flow, removed 7 redundant places. [2024-06-04 14:34:50,024 INFO L231 Difference]: Finished difference. Result has 268 places, 697 transitions, 13169 flow [2024-06-04 14:34:50,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=12426, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=360, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13169, PETRI_PLACES=268, PETRI_TRANSITIONS=697} [2024-06-04 14:34:50,025 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 222 predicate places. [2024-06-04 14:34:50,025 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 697 transitions, 13169 flow [2024-06-04 14:34:50,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:50,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:50,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:50,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 14:34:50,026 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:50,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1747924652, now seen corresponding path program 6 times [2024-06-04 14:34:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874335384] [2024-06-04 14:34:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:50,964 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-04 14:34:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874335384] [2024-06-04 14:34:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874335384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:50,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:50,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092838558] [2024-06-04 14:34:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:50,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:50,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:50,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:51,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:51,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 697 transitions, 13169 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:51,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:51,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:51,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:53,063 INFO L124 PetriNetUnfolderBase]: 4564/6958 cut-off events. [2024-06-04 14:34:53,064 INFO L125 PetriNetUnfolderBase]: For 659434/659437 co-relation queries the response was YES. [2024-06-04 14:34:53,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66390 conditions, 6958 events. 4564/6958 cut-off events. For 659434/659437 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 38863 event pairs, 1033 based on Foata normal form. 5/6957 useless extension candidates. Maximal degree in co-relation 66280. Up to 6360 conditions per place. [2024-06-04 14:34:53,162 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 643 selfloop transitions, 109 changer transitions 0/759 dead transitions. [2024-06-04 14:34:53,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 759 transitions, 15237 flow [2024-06-04 14:34:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 14:34:53,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-04 14:34:53,170 INFO L175 Difference]: Start difference. First operand has 268 places, 697 transitions, 13169 flow. Second operand 10 states and 197 transitions. [2024-06-04 14:34:53,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 759 transitions, 15237 flow [2024-06-04 14:34:54,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 759 transitions, 14482 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 14:34:54,279 INFO L231 Difference]: Finished difference. Result has 270 places, 726 transitions, 13118 flow [2024-06-04 14:34:54,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=12414, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13118, PETRI_PLACES=270, PETRI_TRANSITIONS=726} [2024-06-04 14:34:54,280 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 224 predicate places. [2024-06-04 14:34:54,280 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 726 transitions, 13118 flow [2024-06-04 14:34:54,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:54,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:54,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:54,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 14:34:54,280 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:54,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1170996758, now seen corresponding path program 7 times [2024-06-04 14:34:54,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:54,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506098096] [2024-06-04 14:34:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:55,322 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-04 14:34:55,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:55,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506098096] [2024-06-04 14:34:55,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506098096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:55,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:55,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:55,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330433141] [2024-06-04 14:34:55,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:55,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:55,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:55,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:55,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:55,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:55,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 726 transitions, 13118 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:55,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:55,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:55,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:34:57,509 INFO L124 PetriNetUnfolderBase]: 4656/7098 cut-off events. [2024-06-04 14:34:57,509 INFO L125 PetriNetUnfolderBase]: For 688043/688079 co-relation queries the response was YES. [2024-06-04 14:34:57,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67425 conditions, 7098 events. 4656/7098 cut-off events. For 688043/688079 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 39769 event pairs, 1033 based on Foata normal form. 18/7109 useless extension candidates. Maximal degree in co-relation 67313. Up to 5922 conditions per place. [2024-06-04 14:34:57,610 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 482 selfloop transitions, 306 changer transitions 0/795 dead transitions. [2024-06-04 14:34:57,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 795 transitions, 15989 flow [2024-06-04 14:34:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:34:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:34:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-04 14:34:57,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2024-06-04 14:34:57,634 INFO L175 Difference]: Start difference. First operand has 270 places, 726 transitions, 13118 flow. Second operand 10 states and 208 transitions. [2024-06-04 14:34:57,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 795 transitions, 15989 flow [2024-06-04 14:34:58,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 795 transitions, 15722 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-04 14:34:58,875 INFO L231 Difference]: Finished difference. Result has 276 places, 757 transitions, 14112 flow [2024-06-04 14:34:58,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=12851, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14112, PETRI_PLACES=276, PETRI_TRANSITIONS=757} [2024-06-04 14:34:58,876 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 230 predicate places. [2024-06-04 14:34:58,877 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 757 transitions, 14112 flow [2024-06-04 14:34:58,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:58,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:34:58,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:34:58,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 14:34:58,877 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:34:58,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:34:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1747919816, now seen corresponding path program 6 times [2024-06-04 14:34:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:34:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891735346] [2024-06-04 14:34:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:34:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:34:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:34:59,819 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-04 14:34:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:34:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891735346] [2024-06-04 14:34:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891735346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:34:59,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:34:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:34:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006835936] [2024-06-04 14:34:59,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:34:59,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:34:59,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:34:59,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:34:59,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:34:59,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:34:59,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 757 transitions, 14112 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:34:59,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:34:59,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:34:59,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:01,915 INFO L124 PetriNetUnfolderBase]: 4640/7069 cut-off events. [2024-06-04 14:35:01,915 INFO L125 PetriNetUnfolderBase]: For 708917/708954 co-relation queries the response was YES. [2024-06-04 14:35:01,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67826 conditions, 7069 events. 4640/7069 cut-off events. For 708917/708954 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 39616 event pairs, 1043 based on Foata normal form. 34/7092 useless extension candidates. Maximal degree in co-relation 67714. Up to 5258 conditions per place. [2024-06-04 14:35:02,013 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 380 selfloop transitions, 417 changer transitions 0/804 dead transitions. [2024-06-04 14:35:02,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 804 transitions, 16561 flow [2024-06-04 14:35:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-04 14:35:02,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-04 14:35:02,015 INFO L175 Difference]: Start difference. First operand has 276 places, 757 transitions, 14112 flow. Second operand 10 states and 213 transitions. [2024-06-04 14:35:02,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 804 transitions, 16561 flow [2024-06-04 14:35:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 804 transitions, 15969 flow, removed 116 selfloop flow, removed 6 redundant places. [2024-06-04 14:35:03,100 INFO L231 Difference]: Finished difference. Result has 280 places, 757 transitions, 14379 flow [2024-06-04 14:35:03,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=13520, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=417, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14379, PETRI_PLACES=280, PETRI_TRANSITIONS=757} [2024-06-04 14:35:03,101 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 234 predicate places. [2024-06-04 14:35:03,101 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 757 transitions, 14379 flow [2024-06-04 14:35:03,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:03,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:03,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:03,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 14:35:03,102 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:03,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1577044592, now seen corresponding path program 8 times [2024-06-04 14:35:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621349640] [2024-06-04 14:35:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:35:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621349640] [2024-06-04 14:35:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621349640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264440445] [2024-06-04 14:35:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:03,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:04,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:04,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 757 transitions, 14379 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:04,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:04,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:04,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:06,006 INFO L124 PetriNetUnfolderBase]: 4699/7167 cut-off events. [2024-06-04 14:35:06,006 INFO L125 PetriNetUnfolderBase]: For 738461/738497 co-relation queries the response was YES. [2024-06-04 14:35:06,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69461 conditions, 7167 events. 4699/7167 cut-off events. For 738461/738497 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 40406 event pairs, 1012 based on Foata normal form. 19/7174 useless extension candidates. Maximal degree in co-relation 69349. Up to 5974 conditions per place. [2024-06-04 14:35:06,113 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 488 selfloop transitions, 313 changer transitions 0/808 dead transitions. [2024-06-04 14:35:06,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 808 transitions, 17052 flow [2024-06-04 14:35:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-04 14:35:06,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2024-06-04 14:35:06,115 INFO L175 Difference]: Start difference. First operand has 280 places, 757 transitions, 14379 flow. Second operand 10 states and 208 transitions. [2024-06-04 14:35:06,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 808 transitions, 17052 flow [2024-06-04 14:35:07,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 808 transitions, 16290 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 14:35:07,338 INFO L231 Difference]: Finished difference. Result has 283 places, 769 transitions, 14551 flow [2024-06-04 14:35:07,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=13617, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14551, PETRI_PLACES=283, PETRI_TRANSITIONS=769} [2024-06-04 14:35:07,339 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 237 predicate places. [2024-06-04 14:35:07,339 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 769 transitions, 14551 flow [2024-06-04 14:35:07,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:07,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:07,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:07,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 14:35:07,340 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:07,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1743271676, now seen corresponding path program 7 times [2024-06-04 14:35:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403706540] [2024-06-04 14:35:07,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:08,342 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-04 14:35:08,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:08,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403706540] [2024-06-04 14:35:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403706540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:08,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297249032] [2024-06-04 14:35:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:08,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:08,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:08,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:08,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:08,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 769 transitions, 14551 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:08,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:08,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:08,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:10,473 INFO L124 PetriNetUnfolderBase]: 4650/7088 cut-off events. [2024-06-04 14:35:10,473 INFO L125 PetriNetUnfolderBase]: For 752076/752113 co-relation queries the response was YES. [2024-06-04 14:35:10,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68398 conditions, 7088 events. 4650/7088 cut-off events. For 752076/752113 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39837 event pairs, 1044 based on Foata normal form. 36/7113 useless extension candidates. Maximal degree in co-relation 68285. Up to 5286 conditions per place. [2024-06-04 14:35:10,573 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 421 selfloop transitions, 395 changer transitions 0/823 dead transitions. [2024-06-04 14:35:10,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 823 transitions, 17168 flow [2024-06-04 14:35:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-04 14:35:10,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-04 14:35:10,575 INFO L175 Difference]: Start difference. First operand has 283 places, 769 transitions, 14551 flow. Second operand 10 states and 213 transitions. [2024-06-04 14:35:10,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 823 transitions, 17168 flow [2024-06-04 14:35:12,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 823 transitions, 16353 flow, removed 147 selfloop flow, removed 6 redundant places. [2024-06-04 14:35:12,205 INFO L231 Difference]: Finished difference. Result has 287 places, 769 transitions, 14556 flow [2024-06-04 14:35:12,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=13736, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14556, PETRI_PLACES=287, PETRI_TRANSITIONS=769} [2024-06-04 14:35:12,206 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 241 predicate places. [2024-06-04 14:35:12,206 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 769 transitions, 14556 flow [2024-06-04 14:35:12,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:12,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:12,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:12,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 14:35:12,207 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:12,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -301443980, now seen corresponding path program 8 times [2024-06-04 14:35:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681415187] [2024-06-04 14:35:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:13,222 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-04 14:35:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681415187] [2024-06-04 14:35:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681415187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650117954] [2024-06-04 14:35:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:13,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:13,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:13,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 769 transitions, 14556 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:13,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:13,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:13,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:15,410 INFO L124 PetriNetUnfolderBase]: 4720/7187 cut-off events. [2024-06-04 14:35:15,410 INFO L125 PetriNetUnfolderBase]: For 782582/782628 co-relation queries the response was YES. [2024-06-04 14:35:15,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69783 conditions, 7187 events. 4720/7187 cut-off events. For 782582/782628 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 40358 event pairs, 1005 based on Foata normal form. 48/7225 useless extension candidates. Maximal degree in co-relation 69669. Up to 5349 conditions per place. [2024-06-04 14:35:15,512 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 403 selfloop transitions, 428 changer transitions 0/838 dead transitions. [2024-06-04 14:35:15,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 838 transitions, 17541 flow [2024-06-04 14:35:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2024-06-04 14:35:15,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688888888888889 [2024-06-04 14:35:15,514 INFO L175 Difference]: Start difference. First operand has 287 places, 769 transitions, 14556 flow. Second operand 10 states and 211 transitions. [2024-06-04 14:35:15,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 838 transitions, 17541 flow [2024-06-04 14:35:17,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 838 transitions, 16821 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 14:35:17,075 INFO L231 Difference]: Finished difference. Result has 289 places, 787 transitions, 15103 flow [2024-06-04 14:35:17,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=13854, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15103, PETRI_PLACES=289, PETRI_TRANSITIONS=787} [2024-06-04 14:35:17,077 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 243 predicate places. [2024-06-04 14:35:17,077 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 787 transitions, 15103 flow [2024-06-04 14:35:17,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:17,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:17,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:17,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 14:35:17,078 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:17,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1570781786, now seen corresponding path program 9 times [2024-06-04 14:35:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709716959] [2024-06-04 14:35:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:18,018 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-04 14:35:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709716959] [2024-06-04 14:35:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709716959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310386755] [2024-06-04 14:35:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:18,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:18,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:18,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 787 transitions, 15103 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:18,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:18,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:18,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:20,293 INFO L124 PetriNetUnfolderBase]: 4770/7267 cut-off events. [2024-06-04 14:35:20,293 INFO L125 PetriNetUnfolderBase]: For 811912/811928 co-relation queries the response was YES. [2024-06-04 14:35:20,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70923 conditions, 7267 events. 4770/7267 cut-off events. For 811912/811928 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 40866 event pairs, 1012 based on Foata normal form. 18/7275 useless extension candidates. Maximal degree in co-relation 70808. Up to 5394 conditions per place. [2024-06-04 14:35:20,379 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 441 selfloop transitions, 416 changer transitions 0/864 dead transitions. [2024-06-04 14:35:20,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 864 transitions, 18251 flow [2024-06-04 14:35:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-06-04 14:35:20,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47555555555555556 [2024-06-04 14:35:20,381 INFO L175 Difference]: Start difference. First operand has 289 places, 787 transitions, 15103 flow. Second operand 10 states and 214 transitions. [2024-06-04 14:35:20,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 864 transitions, 18251 flow [2024-06-04 14:35:22,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 864 transitions, 17534 flow, removed 83 selfloop flow, removed 6 redundant places. [2024-06-04 14:35:22,111 INFO L231 Difference]: Finished difference. Result has 293 places, 800 transitions, 15535 flow [2024-06-04 14:35:22,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=14419, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=403, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15535, PETRI_PLACES=293, PETRI_TRANSITIONS=800} [2024-06-04 14:35:22,112 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 247 predicate places. [2024-06-04 14:35:22,112 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 800 transitions, 15535 flow [2024-06-04 14:35:22,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:22,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:22,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:22,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 14:35:22,113 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:22,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1570788296, now seen corresponding path program 10 times [2024-06-04 14:35:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:22,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101522327] [2024-06-04 14:35:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:35:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:23,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101522327] [2024-06-04 14:35:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101522327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:23,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805467535] [2024-06-04 14:35:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:23,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:23,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:23,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:23,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:23,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 800 transitions, 15535 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:23,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:23,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:23,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:25,459 INFO L124 PetriNetUnfolderBase]: 4783/7290 cut-off events. [2024-06-04 14:35:25,459 INFO L125 PetriNetUnfolderBase]: For 829847/829863 co-relation queries the response was YES. [2024-06-04 14:35:25,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71230 conditions, 7290 events. 4783/7290 cut-off events. For 829847/829863 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 41156 event pairs, 978 based on Foata normal form. 18/7293 useless extension candidates. Maximal degree in co-relation 71114. Up to 5378 conditions per place. [2024-06-04 14:35:25,556 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 426 selfloop transitions, 422 changer transitions 0/855 dead transitions. [2024-06-04 14:35:25,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 855 transitions, 18056 flow [2024-06-04 14:35:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2024-06-04 14:35:25,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688888888888889 [2024-06-04 14:35:25,559 INFO L175 Difference]: Start difference. First operand has 293 places, 800 transitions, 15535 flow. Second operand 10 states and 211 transitions. [2024-06-04 14:35:25,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 855 transitions, 18056 flow [2024-06-04 14:35:27,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 855 transitions, 17020 flow, removed 106 selfloop flow, removed 7 redundant places. [2024-06-04 14:35:27,209 INFO L231 Difference]: Finished difference. Result has 296 places, 800 transitions, 15364 flow [2024-06-04 14:35:27,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=14499, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=422, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15364, PETRI_PLACES=296, PETRI_TRANSITIONS=800} [2024-06-04 14:35:27,210 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 250 predicate places. [2024-06-04 14:35:27,210 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 800 transitions, 15364 flow [2024-06-04 14:35:27,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:27,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:27,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:27,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 14:35:27,211 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:27,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1570788482, now seen corresponding path program 9 times [2024-06-04 14:35:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:27,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227813344] [2024-06-04 14:35:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:27,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:28,161 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-04 14:35:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227813344] [2024-06-04 14:35:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227813344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368987788] [2024-06-04 14:35:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:28,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:28,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:28,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 800 transitions, 15364 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:28,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:28,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:28,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:30,375 INFO L124 PetriNetUnfolderBase]: 4771/7284 cut-off events. [2024-06-04 14:35:30,375 INFO L125 PetriNetUnfolderBase]: For 839410/839413 co-relation queries the response was YES. [2024-06-04 14:35:30,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70993 conditions, 7284 events. 4771/7284 cut-off events. For 839410/839413 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 41170 event pairs, 986 based on Foata normal form. 7/7279 useless extension candidates. Maximal degree in co-relation 70876. Up to 6083 conditions per place. [2024-06-04 14:35:30,466 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 507 selfloop transitions, 325 changer transitions 0/839 dead transitions. [2024-06-04 14:35:30,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 839 transitions, 17685 flow [2024-06-04 14:35:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-04 14:35:30,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45111111111111113 [2024-06-04 14:35:30,468 INFO L175 Difference]: Start difference. First operand has 296 places, 800 transitions, 15364 flow. Second operand 10 states and 203 transitions. [2024-06-04 14:35:30,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 839 transitions, 17685 flow [2024-06-04 14:35:32,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 839 transitions, 16823 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 14:35:32,034 INFO L231 Difference]: Finished difference. Result has 297 places, 803 transitions, 15249 flow [2024-06-04 14:35:32,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=14502, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15249, PETRI_PLACES=297, PETRI_TRANSITIONS=803} [2024-06-04 14:35:32,035 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 251 predicate places. [2024-06-04 14:35:32,035 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 803 transitions, 15249 flow [2024-06-04 14:35:32,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:32,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:32,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:32,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 14:35:32,036 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-04 14:35:32,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1592579612, now seen corresponding path program 1 times [2024-06-04 14:35:32,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:32,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113761735] [2024-06-04 14:35:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:32,813 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-04 14:35:32,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113761735] [2024-06-04 14:35:32,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113761735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:35:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437966515] [2024-06-04 14:35:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:32,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:35:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:35:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:35:32,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:35:32,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 803 transitions, 15249 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:32,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:32,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:35:32,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:34,730 INFO L124 PetriNetUnfolderBase]: 4729/7304 cut-off events. [2024-06-04 14:35:34,730 INFO L125 PetriNetUnfolderBase]: For 965994/966442 co-relation queries the response was YES. [2024-06-04 14:35:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71412 conditions, 7304 events. 4729/7304 cut-off events. For 965994/966442 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 42486 event pairs, 1654 based on Foata normal form. 158/7339 useless extension candidates. Maximal degree in co-relation 71294. Up to 6197 conditions per place. [2024-06-04 14:35:34,823 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 518 selfloop transitions, 25 changer transitions 0/827 dead transitions. [2024-06-04 14:35:34,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 827 transitions, 16609 flow [2024-06-04 14:35:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:35:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:35:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-06-04 14:35:34,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2024-06-04 14:35:34,825 INFO L175 Difference]: Start difference. First operand has 297 places, 803 transitions, 15249 flow. Second operand 7 states and 142 transitions. [2024-06-04 14:35:34,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 827 transitions, 16609 flow [2024-06-04 14:35:36,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 827 transitions, 15916 flow, removed 94 selfloop flow, removed 6 redundant places. [2024-06-04 14:35:36,354 INFO L231 Difference]: Finished difference. Result has 298 places, 809 transitions, 14687 flow [2024-06-04 14:35:36,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=14556, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14687, PETRI_PLACES=298, PETRI_TRANSITIONS=809} [2024-06-04 14:35:36,354 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 252 predicate places. [2024-06-04 14:35:36,355 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 809 transitions, 14687 flow [2024-06-04 14:35:36,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:36,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:36,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:36,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 14:35:36,355 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:36,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1648912316, now seen corresponding path program 1 times [2024-06-04 14:35:36,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:36,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210103572] [2024-06-04 14:35:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:37,505 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-04 14:35:37,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210103572] [2024-06-04 14:35:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210103572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:37,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:37,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 14:35:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50153945] [2024-06-04 14:35:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 14:35:37,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 14:35:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 14:35:37,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:37,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 809 transitions, 14687 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:37,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:37,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:37,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:39,641 INFO L124 PetriNetUnfolderBase]: 4780/7284 cut-off events. [2024-06-04 14:35:39,642 INFO L125 PetriNetUnfolderBase]: For 883137/883144 co-relation queries the response was YES. [2024-06-04 14:35:39,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70732 conditions, 7284 events. 4780/7284 cut-off events. For 883137/883144 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 41102 event pairs, 1063 based on Foata normal form. 6/7275 useless extension candidates. Maximal degree in co-relation 70613. Up to 6634 conditions per place. [2024-06-04 14:35:39,747 INFO L140 encePairwiseOnDemand]: 30/45 looper letters, 729 selfloop transitions, 112 changer transitions 0/850 dead transitions. [2024-06-04 14:35:39,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 850 transitions, 16633 flow [2024-06-04 14:35:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 14:35:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 14:35:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-04 14:35:39,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-04 14:35:39,749 INFO L175 Difference]: Start difference. First operand has 298 places, 809 transitions, 14687 flow. Second operand 11 states and 215 transitions. [2024-06-04 14:35:39,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 850 transitions, 16633 flow [2024-06-04 14:35:41,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 850 transitions, 16596 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-04 14:35:41,635 INFO L231 Difference]: Finished difference. Result has 307 places, 812 transitions, 14956 flow [2024-06-04 14:35:41,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=14650, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14956, PETRI_PLACES=307, PETRI_TRANSITIONS=812} [2024-06-04 14:35:41,636 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 261 predicate places. [2024-06-04 14:35:41,636 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 812 transitions, 14956 flow [2024-06-04 14:35:41,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:41,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:41,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:41,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 14:35:41,637 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:41,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash -253112854, now seen corresponding path program 10 times [2024-06-04 14:35:41,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074590762] [2024-06-04 14:35:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:35:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074590762] [2024-06-04 14:35:42,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074590762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:42,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:42,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:42,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412623753] [2024-06-04 14:35:42,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:42,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:42,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:42,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:42,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:42,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:42,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 812 transitions, 14956 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:42,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:42,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:42,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:44,775 INFO L124 PetriNetUnfolderBase]: 4855/7382 cut-off events. [2024-06-04 14:35:44,775 INFO L125 PetriNetUnfolderBase]: For 961445/961485 co-relation queries the response was YES. [2024-06-04 14:35:44,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73581 conditions, 7382 events. 4855/7382 cut-off events. For 961445/961485 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 42027 event pairs, 1367 based on Foata normal form. 13/7347 useless extension candidates. Maximal degree in co-relation 73460. Up to 6719 conditions per place. [2024-06-04 14:35:44,870 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 706 selfloop transitions, 144 changer transitions 0/859 dead transitions. [2024-06-04 14:35:44,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 859 transitions, 17119 flow [2024-06-04 14:35:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:35:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:35:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-04 14:35:44,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4419753086419753 [2024-06-04 14:35:44,871 INFO L175 Difference]: Start difference. First operand has 307 places, 812 transitions, 14956 flow. Second operand 9 states and 179 transitions. [2024-06-04 14:35:44,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 859 transitions, 17119 flow [2024-06-04 14:35:46,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 859 transitions, 16906 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-04 14:35:46,303 INFO L231 Difference]: Finished difference. Result has 309 places, 821 transitions, 15308 flow [2024-06-04 14:35:46,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=14743, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15308, PETRI_PLACES=309, PETRI_TRANSITIONS=821} [2024-06-04 14:35:46,304 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 263 predicate places. [2024-06-04 14:35:46,304 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 821 transitions, 15308 flow [2024-06-04 14:35:46,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:46,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:46,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:46,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 14:35:46,305 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:46,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash -252992884, now seen corresponding path program 11 times [2024-06-04 14:35:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597615259] [2024-06-04 14:35:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:47,284 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-04 14:35:47,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:47,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597615259] [2024-06-04 14:35:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597615259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:47,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267397403] [2024-06-04 14:35:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:47,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:47,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:47,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:47,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 821 transitions, 15308 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:47,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:47,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:47,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:49,217 INFO L124 PetriNetUnfolderBase]: 4882/7409 cut-off events. [2024-06-04 14:35:49,218 INFO L125 PetriNetUnfolderBase]: For 999168/999207 co-relation queries the response was YES. [2024-06-04 14:35:49,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74703 conditions, 7409 events. 4882/7409 cut-off events. For 999168/999207 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 42071 event pairs, 1245 based on Foata normal form. 10/7368 useless extension candidates. Maximal degree in co-relation 74581. Up to 6221 conditions per place. [2024-06-04 14:35:49,320 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 500 selfloop transitions, 364 changer transitions 0/873 dead transitions. [2024-06-04 14:35:49,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 873 transitions, 17911 flow [2024-06-04 14:35:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:35:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:35:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-04 14:35:49,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.454320987654321 [2024-06-04 14:35:49,322 INFO L175 Difference]: Start difference. First operand has 309 places, 821 transitions, 15308 flow. Second operand 9 states and 184 transitions. [2024-06-04 14:35:49,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 873 transitions, 17911 flow [2024-06-04 14:35:51,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 873 transitions, 17670 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-04 14:35:51,229 INFO L231 Difference]: Finished difference. Result has 313 places, 830 transitions, 16085 flow [2024-06-04 14:35:51,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=15067, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16085, PETRI_PLACES=313, PETRI_TRANSITIONS=830} [2024-06-04 14:35:51,230 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 267 predicate places. [2024-06-04 14:35:51,230 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 830 transitions, 16085 flow [2024-06-04 14:35:51,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:51,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:51,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:51,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 14:35:51,231 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:51,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash 985463046, now seen corresponding path program 11 times [2024-06-04 14:35:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:51,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750639881] [2024-06-04 14:35:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:52,308 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-04 14:35:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750639881] [2024-06-04 14:35:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750639881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:52,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:52,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206117422] [2024-06-04 14:35:52,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:52,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:52,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:52,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 830 transitions, 16085 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:52,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:52,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:52,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:54,265 INFO L124 PetriNetUnfolderBase]: 5058/7705 cut-off events. [2024-06-04 14:35:54,265 INFO L125 PetriNetUnfolderBase]: For 1039444/1039481 co-relation queries the response was YES. [2024-06-04 14:35:54,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77572 conditions, 7705 events. 5058/7705 cut-off events. For 1039444/1039481 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 44394 event pairs, 1570 based on Foata normal form. 6/7651 useless extension candidates. Maximal degree in co-relation 77449. Up to 6321 conditions per place. [2024-06-04 14:35:54,373 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 598 selfloop transitions, 324 changer transitions 0/931 dead transitions. [2024-06-04 14:35:54,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 931 transitions, 19268 flow [2024-06-04 14:35:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-04 14:35:54,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-04 14:35:54,375 INFO L175 Difference]: Start difference. First operand has 313 places, 830 transitions, 16085 flow. Second operand 10 states and 195 transitions. [2024-06-04 14:35:54,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 931 transitions, 19268 flow [2024-06-04 14:35:56,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 931 transitions, 18521 flow, removed 101 selfloop flow, removed 8 redundant places. [2024-06-04 14:35:56,454 INFO L231 Difference]: Finished difference. Result has 316 places, 889 transitions, 17019 flow [2024-06-04 14:35:56,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=15346, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17019, PETRI_PLACES=316, PETRI_TRANSITIONS=889} [2024-06-04 14:35:56,455 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 270 predicate places. [2024-06-04 14:35:56,455 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 889 transitions, 17019 flow [2024-06-04 14:35:56,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:56,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:35:56,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:35:56,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 14:35:56,455 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:35:56,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:35:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash -248344558, now seen corresponding path program 12 times [2024-06-04 14:35:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:35:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354247215] [2024-06-04 14:35:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:35:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:35:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:35:57,582 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-04 14:35:57,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:35:57,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354247215] [2024-06-04 14:35:57,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354247215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:35:57,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:35:57,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:35:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060867154] [2024-06-04 14:35:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:35:57,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:35:57,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:35:57,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:35:57,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:35:57,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:35:57,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 889 transitions, 17019 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:35:57,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:35:57,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:35:57,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:35:59,572 INFO L124 PetriNetUnfolderBase]: 5180/7888 cut-off events. [2024-06-04 14:35:59,572 INFO L125 PetriNetUnfolderBase]: For 1042099/1042136 co-relation queries the response was YES. [2024-06-04 14:35:59,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79826 conditions, 7888 events. 5180/7888 cut-off events. For 1042099/1042136 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 45621 event pairs, 1583 based on Foata normal form. 8/7836 useless extension candidates. Maximal degree in co-relation 79703. Up to 6429 conditions per place. [2024-06-04 14:35:59,690 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 645 selfloop transitions, 314 changer transitions 0/968 dead transitions. [2024-06-04 14:35:59,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 968 transitions, 20583 flow [2024-06-04 14:35:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:35:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:35:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 14:35:59,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-04 14:35:59,691 INFO L175 Difference]: Start difference. First operand has 316 places, 889 transitions, 17019 flow. Second operand 10 states and 197 transitions. [2024-06-04 14:35:59,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 968 transitions, 20583 flow [2024-06-04 14:36:01,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 968 transitions, 20178 flow, removed 82 selfloop flow, removed 6 redundant places. [2024-06-04 14:36:01,570 INFO L231 Difference]: Finished difference. Result has 320 places, 915 transitions, 17911 flow [2024-06-04 14:36:01,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=16654, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17911, PETRI_PLACES=320, PETRI_TRANSITIONS=915} [2024-06-04 14:36:01,571 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 274 predicate places. [2024-06-04 14:36:01,571 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 915 transitions, 17911 flow [2024-06-04 14:36:01,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:01,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:01,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:01,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 14:36:01,572 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:01,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -248351068, now seen corresponding path program 13 times [2024-06-04 14:36:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:01,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712549346] [2024-06-04 14:36:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:36:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:02,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712549346] [2024-06-04 14:36:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712549346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:02,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:36:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118647313] [2024-06-04 14:36:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:02,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:36:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:36:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:36:02,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:02,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 915 transitions, 17911 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:02,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:02,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:02,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:04,664 INFO L124 PetriNetUnfolderBase]: 5240/7986 cut-off events. [2024-06-04 14:36:04,664 INFO L125 PetriNetUnfolderBase]: For 1067060/1067097 co-relation queries the response was YES. [2024-06-04 14:36:04,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81636 conditions, 7986 events. 5240/7986 cut-off events. For 1067060/1067097 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 46310 event pairs, 1519 based on Foata normal form. 8/7935 useless extension candidates. Maximal degree in co-relation 81511. Up to 6463 conditions per place. [2024-06-04 14:36:04,784 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 655 selfloop transitions, 309 changer transitions 0/973 dead transitions. [2024-06-04 14:36:04,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 973 transitions, 20726 flow [2024-06-04 14:36:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:36:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:36:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 14:36:04,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-04 14:36:04,786 INFO L175 Difference]: Start difference. First operand has 320 places, 915 transitions, 17911 flow. Second operand 10 states and 197 transitions. [2024-06-04 14:36:04,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 973 transitions, 20726 flow [2024-06-04 14:36:06,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 973 transitions, 20087 flow, removed 134 selfloop flow, removed 6 redundant places. [2024-06-04 14:36:06,868 INFO L231 Difference]: Finished difference. Result has 324 places, 915 transitions, 17922 flow [2024-06-04 14:36:06,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=17272, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17922, PETRI_PLACES=324, PETRI_TRANSITIONS=915} [2024-06-04 14:36:06,869 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 278 predicate places. [2024-06-04 14:36:06,869 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 915 transitions, 17922 flow [2024-06-04 14:36:06,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:06,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:06,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:06,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 14:36:06,870 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:06,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash -248351254, now seen corresponding path program 12 times [2024-06-04 14:36:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:06,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348297221] [2024-06-04 14:36:06,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:06,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:07,835 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-04 14:36:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348297221] [2024-06-04 14:36:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348297221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:36:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99050232] [2024-06-04 14:36:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:36:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:36:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:36:07,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:07,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 915 transitions, 17922 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:07,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:07,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:07,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:09,895 INFO L124 PetriNetUnfolderBase]: 5167/7856 cut-off events. [2024-06-04 14:36:09,896 INFO L125 PetriNetUnfolderBase]: For 1041204/1041224 co-relation queries the response was YES. [2024-06-04 14:36:09,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79990 conditions, 7856 events. 5167/7856 cut-off events. For 1041204/1041224 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 45068 event pairs, 1227 based on Foata normal form. 9/7840 useless extension candidates. Maximal degree in co-relation 79864. Up to 6617 conditions per place. [2024-06-04 14:36:10,015 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 597 selfloop transitions, 364 changer transitions 0/970 dead transitions. [2024-06-04 14:36:10,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 970 transitions, 20906 flow [2024-06-04 14:36:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:36:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:36:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-04 14:36:10,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44938271604938274 [2024-06-04 14:36:10,017 INFO L175 Difference]: Start difference. First operand has 324 places, 915 transitions, 17922 flow. Second operand 9 states and 182 transitions. [2024-06-04 14:36:10,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 970 transitions, 20906 flow [2024-06-04 14:36:12,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 970 transitions, 20304 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 14:36:12,445 INFO L231 Difference]: Finished difference. Result has 324 places, 927 transitions, 18416 flow [2024-06-04 14:36:12,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=17320, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=352, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18416, PETRI_PLACES=324, PETRI_TRANSITIONS=927} [2024-06-04 14:36:12,446 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 278 predicate places. [2024-06-04 14:36:12,446 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 927 transitions, 18416 flow [2024-06-04 14:36:12,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:12,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:12,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:12,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 14:36:12,447 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:12,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash -75854668, now seen corresponding path program 14 times [2024-06-04 14:36:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996496242] [2024-06-04 14:36:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:13,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-04 14:36:13,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:13,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996496242] [2024-06-04 14:36:13,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996496242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:13,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:36:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379976392] [2024-06-04 14:36:13,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:13,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:36:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:36:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:36:13,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:13,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 927 transitions, 18416 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:13,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:13,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:13,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:15,766 INFO L124 PetriNetUnfolderBase]: 5438/8273 cut-off events. [2024-06-04 14:36:15,766 INFO L125 PetriNetUnfolderBase]: For 1181612/1181649 co-relation queries the response was YES. [2024-06-04 14:36:15,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86059 conditions, 8273 events. 5438/8273 cut-off events. For 1181612/1181649 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 48286 event pairs, 1620 based on Foata normal form. 10/8223 useless extension candidates. Maximal degree in co-relation 85932. Up to 6677 conditions per place. [2024-06-04 14:36:15,895 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 698 selfloop transitions, 353 changer transitions 0/1060 dead transitions. [2024-06-04 14:36:15,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1060 transitions, 23627 flow [2024-06-04 14:36:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:36:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:36:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-04 14:36:15,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2024-06-04 14:36:15,897 INFO L175 Difference]: Start difference. First operand has 324 places, 927 transitions, 18416 flow. Second operand 10 states and 202 transitions. [2024-06-04 14:36:15,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 1060 transitions, 23627 flow [2024-06-04 14:36:18,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 1060 transitions, 22664 flow, removed 116 selfloop flow, removed 9 redundant places. [2024-06-04 14:36:18,303 INFO L231 Difference]: Finished difference. Result has 325 places, 981 transitions, 19598 flow [2024-06-04 14:36:18,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=17492, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19598, PETRI_PLACES=325, PETRI_TRANSITIONS=981} [2024-06-04 14:36:18,304 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 279 predicate places. [2024-06-04 14:36:18,304 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 981 transitions, 19598 flow [2024-06-04 14:36:18,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:18,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:18,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:18,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 14:36:18,304 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:18,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash -75624028, now seen corresponding path program 15 times [2024-06-04 14:36:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608313176] [2024-06-04 14:36:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:19,438 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-04 14:36:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608313176] [2024-06-04 14:36:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608313176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:19,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:36:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787883172] [2024-06-04 14:36:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:36:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:36:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:36:19,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:19,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 981 transitions, 19598 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:19,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:19,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:19,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:21,691 INFO L124 PetriNetUnfolderBase]: 5410/8238 cut-off events. [2024-06-04 14:36:21,691 INFO L125 PetriNetUnfolderBase]: For 1128484/1128521 co-relation queries the response was YES. [2024-06-04 14:36:21,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84346 conditions, 8238 events. 5410/8238 cut-off events. For 1128484/1128521 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 48139 event pairs, 1613 based on Foata normal form. 10/8188 useless extension candidates. Maximal degree in co-relation 84220. Up to 6654 conditions per place. [2024-06-04 14:36:21,819 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 665 selfloop transitions, 367 changer transitions 0/1041 dead transitions. [2024-06-04 14:36:21,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 1041 transitions, 22821 flow [2024-06-04 14:36:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:36:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:36:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 14:36:21,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-04 14:36:21,821 INFO L175 Difference]: Start difference. First operand has 325 places, 981 transitions, 19598 flow. Second operand 10 states and 197 transitions. [2024-06-04 14:36:21,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 1041 transitions, 22821 flow [2024-06-04 14:36:24,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 1041 transitions, 21982 flow, removed 184 selfloop flow, removed 6 redundant places. [2024-06-04 14:36:24,409 INFO L231 Difference]: Finished difference. Result has 329 places, 981 transitions, 19528 flow [2024-06-04 14:36:24,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=18759, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19528, PETRI_PLACES=329, PETRI_TRANSITIONS=981} [2024-06-04 14:36:24,410 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 283 predicate places. [2024-06-04 14:36:24,410 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 981 transitions, 19528 flow [2024-06-04 14:36:24,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:24,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:24,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:24,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 14:36:24,410 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:24,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -75861364, now seen corresponding path program 13 times [2024-06-04 14:36:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777753497] [2024-06-04 14:36:24,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:25,525 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-04 14:36:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777753497] [2024-06-04 14:36:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777753497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:36:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737355634] [2024-06-04 14:36:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:36:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:36:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:36:25,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:25,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 981 transitions, 19528 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:25,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:25,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:25,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:28,070 INFO L124 PetriNetUnfolderBase]: 5473/8344 cut-off events. [2024-06-04 14:36:28,070 INFO L125 PetriNetUnfolderBase]: For 1104038/1104049 co-relation queries the response was YES. [2024-06-04 14:36:28,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84788 conditions, 8344 events. 5473/8344 cut-off events. For 1104038/1104049 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 48488 event pairs, 1003 based on Foata normal form. 8/8337 useless extension candidates. Maximal degree in co-relation 84661. Up to 7044 conditions per place. [2024-06-04 14:36:28,178 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 654 selfloop transitions, 371 changer transitions 0/1034 dead transitions. [2024-06-04 14:36:28,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1034 transitions, 22716 flow [2024-06-04 14:36:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:36:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:36:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-04 14:36:28,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 14:36:28,180 INFO L175 Difference]: Start difference. First operand has 329 places, 981 transitions, 19528 flow. Second operand 9 states and 180 transitions. [2024-06-04 14:36:28,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 1034 transitions, 22716 flow [2024-06-04 14:36:30,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1034 transitions, 22012 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 14:36:30,030 INFO L231 Difference]: Finished difference. Result has 330 places, 996 transitions, 20023 flow [2024-06-04 14:36:30,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=18824, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20023, PETRI_PLACES=330, PETRI_TRANSITIONS=996} [2024-06-04 14:36:30,031 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 284 predicate places. [2024-06-04 14:36:30,032 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 996 transitions, 20023 flow [2024-06-04 14:36:30,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:30,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:30,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:30,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 14:36:30,032 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:30,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash -75861178, now seen corresponding path program 16 times [2024-06-04 14:36:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:30,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239962924] [2024-06-04 14:36:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:30,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:31,114 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-04 14:36:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239962924] [2024-06-04 14:36:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239962924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:31,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:31,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:36:31,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624578439] [2024-06-04 14:36:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:31,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:36:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:36:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:36:31,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:31,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 996 transitions, 20023 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:31,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:31,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:33,419 INFO L124 PetriNetUnfolderBase]: 5421/8257 cut-off events. [2024-06-04 14:36:33,419 INFO L125 PetriNetUnfolderBase]: For 1170309/1170346 co-relation queries the response was YES. [2024-06-04 14:36:33,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84630 conditions, 8257 events. 5421/8257 cut-off events. For 1170309/1170346 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 48368 event pairs, 1608 based on Foata normal form. 10/8207 useless extension candidates. Maximal degree in co-relation 84502. Up to 6687 conditions per place. [2024-06-04 14:36:33,528 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 692 selfloop transitions, 361 changer transitions 0/1062 dead transitions. [2024-06-04 14:36:33,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1062 transitions, 23205 flow [2024-06-04 14:36:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:36:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:36:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 14:36:33,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-04 14:36:33,529 INFO L175 Difference]: Start difference. First operand has 330 places, 996 transitions, 20023 flow. Second operand 10 states and 197 transitions. [2024-06-04 14:36:33,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1062 transitions, 23205 flow [2024-06-04 14:36:35,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 1062 transitions, 22177 flow, removed 206 selfloop flow, removed 7 redundant places. [2024-06-04 14:36:35,317 INFO L231 Difference]: Finished difference. Result has 333 places, 996 transitions, 19753 flow [2024-06-04 14:36:35,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=18999, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19753, PETRI_PLACES=333, PETRI_TRANSITIONS=996} [2024-06-04 14:36:35,318 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 287 predicate places. [2024-06-04 14:36:35,318 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 996 transitions, 19753 flow [2024-06-04 14:36:35,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:35,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:35,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:35,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 14:36:35,318 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:35,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1337042829, now seen corresponding path program 1 times [2024-06-04 14:36:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020207656] [2024-06-04 14:36:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:36,177 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-04 14:36:36,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:36,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020207656] [2024-06-04 14:36:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020207656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:36,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:36,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 14:36:36,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392515276] [2024-06-04 14:36:36,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:36,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 14:36:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:36,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 14:36:36,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 14:36:36,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:36:36,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 996 transitions, 19753 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:36,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:36,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:36:36,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:38,333 INFO L124 PetriNetUnfolderBase]: 5347/8282 cut-off events. [2024-06-04 14:36:38,333 INFO L125 PetriNetUnfolderBase]: For 1257532/1258062 co-relation queries the response was YES. [2024-06-04 14:36:38,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84415 conditions, 8282 events. 5347/8282 cut-off events. For 1257532/1258062 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 49734 event pairs, 1722 based on Foata normal form. 213/8339 useless extension candidates. Maximal degree in co-relation 84287. Up to 6940 conditions per place. [2024-06-04 14:36:38,464 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 641 selfloop transitions, 34 changer transitions 0/1028 dead transitions. [2024-06-04 14:36:38,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1028 transitions, 21585 flow [2024-06-04 14:36:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:36:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:36:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-04 14:36:38,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-04 14:36:38,466 INFO L175 Difference]: Start difference. First operand has 333 places, 996 transitions, 19753 flow. Second operand 7 states and 145 transitions. [2024-06-04 14:36:38,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1028 transitions, 21585 flow [2024-06-04 14:36:40,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1028 transitions, 20827 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 14:36:40,076 INFO L231 Difference]: Finished difference. Result has 332 places, 1008 transitions, 19228 flow [2024-06-04 14:36:40,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=18995, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=967, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19228, PETRI_PLACES=332, PETRI_TRANSITIONS=1008} [2024-06-04 14:36:40,077 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 286 predicate places. [2024-06-04 14:36:40,077 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 1008 transitions, 19228 flow [2024-06-04 14:36:40,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:40,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:40,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:40,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 14:36:40,078 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:40,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1649062046, now seen corresponding path program 2 times [2024-06-04 14:36:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180721987] [2024-06-04 14:36:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:41,148 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-04 14:36:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180721987] [2024-06-04 14:36:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180721987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:41,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 14:36:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098608447] [2024-06-04 14:36:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:41,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 14:36:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 14:36:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 14:36:41,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:41,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1008 transitions, 19228 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:41,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:41,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:43,866 INFO L124 PetriNetUnfolderBase]: 5565/8464 cut-off events. [2024-06-04 14:36:43,866 INFO L125 PetriNetUnfolderBase]: For 1160073/1160091 co-relation queries the response was YES. [2024-06-04 14:36:43,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86032 conditions, 8464 events. 5565/8464 cut-off events. For 1160073/1160091 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 49238 event pairs, 1139 based on Foata normal form. 6/8446 useless extension candidates. Maximal degree in co-relation 85901. Up to 5249 conditions per place. [2024-06-04 14:36:43,992 INFO L140 encePairwiseOnDemand]: 29/45 looper letters, 480 selfloop transitions, 590 changer transitions 0/1080 dead transitions. [2024-06-04 14:36:43,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1080 transitions, 23219 flow [2024-06-04 14:36:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 14:36:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 14:36:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 239 transitions. [2024-06-04 14:36:43,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48282828282828283 [2024-06-04 14:36:43,993 INFO L175 Difference]: Start difference. First operand has 332 places, 1008 transitions, 19228 flow. Second operand 11 states and 239 transitions. [2024-06-04 14:36:43,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1080 transitions, 23219 flow [2024-06-04 14:36:46,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1080 transitions, 23179 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-06-04 14:36:46,215 INFO L231 Difference]: Finished difference. Result has 343 places, 1024 transitions, 20848 flow [2024-06-04 14:36:46,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=19188, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=577, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20848, PETRI_PLACES=343, PETRI_TRANSITIONS=1024} [2024-06-04 14:36:46,217 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 297 predicate places. [2024-06-04 14:36:46,217 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 1024 transitions, 20848 flow [2024-06-04 14:36:46,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:46,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:46,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:46,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 14:36:46,218 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:46,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1539865016, now seen corresponding path program 2 times [2024-06-04 14:36:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358766256] [2024-06-04 14:36:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:47,211 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-04 14:36:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:47,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358766256] [2024-06-04 14:36:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358766256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:47,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:47,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:36:47,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77426800] [2024-06-04 14:36:47,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:47,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:36:47,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:47,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:36:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:36:47,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:36:47,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1024 transitions, 20848 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:47,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:47,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:36:47,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:49,372 INFO L124 PetriNetUnfolderBase]: 5488/8469 cut-off events. [2024-06-04 14:36:49,372 INFO L125 PetriNetUnfolderBase]: For 1399998/1400698 co-relation queries the response was YES. [2024-06-04 14:36:49,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90341 conditions, 8469 events. 5488/8469 cut-off events. For 1399998/1400698 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 51058 event pairs, 1926 based on Foata normal form. 298/8574 useless extension candidates. Maximal degree in co-relation 90206. Up to 7216 conditions per place. [2024-06-04 14:36:49,513 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 662 selfloop transitions, 24 changer transitions 0/1039 dead transitions. [2024-06-04 14:36:49,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1039 transitions, 22437 flow [2024-06-04 14:36:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:36:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:36:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 14:36:49,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-04 14:36:49,515 INFO L175 Difference]: Start difference. First operand has 343 places, 1024 transitions, 20848 flow. Second operand 7 states and 133 transitions. [2024-06-04 14:36:49,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 1039 transitions, 22437 flow [2024-06-04 14:36:51,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1039 transitions, 22123 flow, removed 69 selfloop flow, removed 4 redundant places. [2024-06-04 14:36:51,642 INFO L231 Difference]: Finished difference. Result has 346 places, 1027 transitions, 20623 flow [2024-06-04 14:36:51,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20534, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=20623, PETRI_PLACES=346, PETRI_TRANSITIONS=1027} [2024-06-04 14:36:51,643 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 300 predicate places. [2024-06-04 14:36:51,643 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 1027 transitions, 20623 flow [2024-06-04 14:36:51,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:51,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:51,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:51,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 14:36:51,644 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:51,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash -761977134, now seen corresponding path program 3 times [2024-06-04 14:36:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:51,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372829313] [2024-06-04 14:36:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:51,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:52,775 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-04 14:36:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372829313] [2024-06-04 14:36:52,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372829313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:52,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:52,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 14:36:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965980482] [2024-06-04 14:36:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:52,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 14:36:52,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 14:36:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 14:36:52,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:52,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 1027 transitions, 20623 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:52,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:52,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:52,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:36:55,640 INFO L124 PetriNetUnfolderBase]: 5688/8644 cut-off events. [2024-06-04 14:36:55,640 INFO L125 PetriNetUnfolderBase]: For 1265232/1265277 co-relation queries the response was YES. [2024-06-04 14:36:55,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91579 conditions, 8644 events. 5688/8644 cut-off events. For 1265232/1265277 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 50278 event pairs, 1092 based on Foata normal form. 34/8655 useless extension candidates. Maximal degree in co-relation 91442. Up to 5352 conditions per place. [2024-06-04 14:36:55,777 INFO L140 encePairwiseOnDemand]: 29/45 looper letters, 534 selfloop transitions, 572 changer transitions 0/1117 dead transitions. [2024-06-04 14:36:55,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1117 transitions, 25071 flow [2024-06-04 14:36:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 14:36:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 14:36:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 241 transitions. [2024-06-04 14:36:55,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868686868686869 [2024-06-04 14:36:55,779 INFO L175 Difference]: Start difference. First operand has 346 places, 1027 transitions, 20623 flow. Second operand 11 states and 241 transitions. [2024-06-04 14:36:55,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1117 transitions, 25071 flow [2024-06-04 14:36:58,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1117 transitions, 25016 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-04 14:36:58,451 INFO L231 Difference]: Finished difference. Result has 351 places, 1042 transitions, 22046 flow [2024-06-04 14:36:58,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20568, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=22046, PETRI_PLACES=351, PETRI_TRANSITIONS=1042} [2024-06-04 14:36:58,452 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 305 predicate places. [2024-06-04 14:36:58,452 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1042 transitions, 22046 flow [2024-06-04 14:36:58,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:58,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:36:58,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:36:58,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 14:36:58,453 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:36:58,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:36:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -903095294, now seen corresponding path program 17 times [2024-06-04 14:36:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:36:58,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179736910] [2024-06-04 14:36:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:36:58,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:36:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:36:59,665 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-04 14:36:59,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:36:59,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179736910] [2024-06-04 14:36:59,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179736910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:36:59,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:36:59,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:36:59,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184128878] [2024-06-04 14:36:59,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:36:59,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:36:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:36:59,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:36:59,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:36:59,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:36:59,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1042 transitions, 22046 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:36:59,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:36:59,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:36:59,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:02,397 INFO L124 PetriNetUnfolderBase]: 5965/9072 cut-off events. [2024-06-04 14:37:02,397 INFO L125 PetriNetUnfolderBase]: For 1451756/1451826 co-relation queries the response was YES. [2024-06-04 14:37:02,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99864 conditions, 9072 events. 5965/9072 cut-off events. For 1451756/1451826 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 53748 event pairs, 1745 based on Foata normal form. 16/9027 useless extension candidates. Maximal degree in co-relation 99727. Up to 8101 conditions per place. [2024-06-04 14:37:02,527 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 994 selfloop transitions, 139 changer transitions 0/1144 dead transitions. [2024-06-04 14:37:02,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1144 transitions, 26796 flow [2024-06-04 14:37:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:37:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:37:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-04 14:37:02,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2024-06-04 14:37:02,529 INFO L175 Difference]: Start difference. First operand has 351 places, 1042 transitions, 22046 flow. Second operand 10 states and 192 transitions. [2024-06-04 14:37:02,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1144 transitions, 26796 flow [2024-06-04 14:37:04,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 1144 transitions, 26185 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-04 14:37:04,673 INFO L231 Difference]: Finished difference. Result has 357 places, 1078 transitions, 22805 flow [2024-06-04 14:37:04,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=21461, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=22805, PETRI_PLACES=357, PETRI_TRANSITIONS=1078} [2024-06-04 14:37:04,674 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 311 predicate places. [2024-06-04 14:37:04,674 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 1078 transitions, 22805 flow [2024-06-04 14:37:04,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:04,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:04,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:04,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 14:37:04,675 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:04,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash -744606906, now seen corresponding path program 18 times [2024-06-04 14:37:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882081995] [2024-06-04 14:37:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:05,824 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-04 14:37:05,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:05,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882081995] [2024-06-04 14:37:05,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882081995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:05,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:05,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:37:05,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604346139] [2024-06-04 14:37:05,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:05,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:37:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:37:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:37:05,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:37:05,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1078 transitions, 22805 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:05,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:05,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:37:05,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:08,865 INFO L124 PetriNetUnfolderBase]: 6029/9167 cut-off events. [2024-06-04 14:37:08,866 INFO L125 PetriNetUnfolderBase]: For 1495532/1495602 co-relation queries the response was YES. [2024-06-04 14:37:08,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100002 conditions, 9167 events. 6029/9167 cut-off events. For 1495532/1495602 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 54413 event pairs, 1714 based on Foata normal form. 16/9122 useless extension candidates. Maximal degree in co-relation 99864. Up to 8159 conditions per place. [2024-06-04 14:37:09,010 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 960 selfloop transitions, 173 changer transitions 0/1144 dead transitions. [2024-06-04 14:37:09,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1144 transitions, 26502 flow [2024-06-04 14:37:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:37:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:37:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-04 14:37:09,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4177777777777778 [2024-06-04 14:37:09,015 INFO L175 Difference]: Start difference. First operand has 357 places, 1078 transitions, 22805 flow. Second operand 10 states and 188 transitions. [2024-06-04 14:37:09,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1144 transitions, 26502 flow [2024-06-04 14:37:11,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1144 transitions, 25809 flow, removed 122 selfloop flow, removed 7 redundant places. [2024-06-04 14:37:11,826 INFO L231 Difference]: Finished difference. Result has 360 places, 1096 transitions, 23039 flow [2024-06-04 14:37:11,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=22196, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23039, PETRI_PLACES=360, PETRI_TRANSITIONS=1096} [2024-06-04 14:37:11,827 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 314 predicate places. [2024-06-04 14:37:11,827 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 1096 transitions, 23039 flow [2024-06-04 14:37:11,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:11,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:11,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:11,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 14:37:11,827 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:11,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -432201254, now seen corresponding path program 19 times [2024-06-04 14:37:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357628086] [2024-06-04 14:37:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:13,230 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-04 14:37:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:13,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357628086] [2024-06-04 14:37:13,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357628086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:13,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:13,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:37:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621979900] [2024-06-04 14:37:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:13,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:37:13,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:13,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:37:13,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:37:13,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:37:13,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1096 transitions, 23039 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:13,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:13,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:37:13,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:16,435 INFO L124 PetriNetUnfolderBase]: 5918/8990 cut-off events. [2024-06-04 14:37:16,436 INFO L125 PetriNetUnfolderBase]: For 1464248/1464318 co-relation queries the response was YES. [2024-06-04 14:37:16,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97288 conditions, 8990 events. 5918/8990 cut-off events. For 1464248/1464318 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 53296 event pairs, 1788 based on Foata normal form. 16/8944 useless extension candidates. Maximal degree in co-relation 97149. Up to 8056 conditions per place. [2024-06-04 14:37:16,715 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 982 selfloop transitions, 160 changer transitions 0/1153 dead transitions. [2024-06-04 14:37:16,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 1153 transitions, 26348 flow [2024-06-04 14:37:16,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:37:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:37:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-04 14:37:16,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43950617283950616 [2024-06-04 14:37:16,717 INFO L175 Difference]: Start difference. First operand has 360 places, 1096 transitions, 23039 flow. Second operand 9 states and 178 transitions. [2024-06-04 14:37:16,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 1153 transitions, 26348 flow [2024-06-04 14:37:19,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1153 transitions, 25008 flow, removed 154 selfloop flow, removed 10 redundant places. [2024-06-04 14:37:19,206 INFO L231 Difference]: Finished difference. Result has 359 places, 1096 transitions, 22047 flow [2024-06-04 14:37:19,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=21699, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22047, PETRI_PLACES=359, PETRI_TRANSITIONS=1096} [2024-06-04 14:37:19,207 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 313 predicate places. [2024-06-04 14:37:19,207 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 1096 transitions, 22047 flow [2024-06-04 14:37:19,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:19,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:19,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:19,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 14:37:19,207 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:19,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash -432207950, now seen corresponding path program 14 times [2024-06-04 14:37:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361516606] [2024-06-04 14:37:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:37:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361516606] [2024-06-04 14:37:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361516606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:37:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287347186] [2024-06-04 14:37:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:20,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:37:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:37:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:37:20,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:37:20,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1096 transitions, 22047 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:20,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:20,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:37:20,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:23,248 INFO L124 PetriNetUnfolderBase]: 5901/8964 cut-off events. [2024-06-04 14:37:23,248 INFO L125 PetriNetUnfolderBase]: For 1451173/1451243 co-relation queries the response was YES. [2024-06-04 14:37:23,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96417 conditions, 8964 events. 5901/8964 cut-off events. For 1451173/1451243 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 53134 event pairs, 1816 based on Foata normal form. 12/8911 useless extension candidates. Maximal degree in co-relation 96277. Up to 8429 conditions per place. [2024-06-04 14:37:23,379 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 1060 selfloop transitions, 51 changer transitions 0/1122 dead transitions. [2024-06-04 14:37:23,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1122 transitions, 24527 flow [2024-06-04 14:37:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:37:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:37:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-04 14:37:23,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4123456790123457 [2024-06-04 14:37:23,382 INFO L175 Difference]: Start difference. First operand has 359 places, 1096 transitions, 22047 flow. Second operand 9 states and 167 transitions. [2024-06-04 14:37:23,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1122 transitions, 24527 flow [2024-06-04 14:37:25,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 1122 transitions, 23947 flow, removed 151 selfloop flow, removed 7 redundant places. [2024-06-04 14:37:25,928 INFO L231 Difference]: Finished difference. Result has 361 places, 1096 transitions, 21592 flow [2024-06-04 14:37:25,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=21467, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21592, PETRI_PLACES=361, PETRI_TRANSITIONS=1096} [2024-06-04 14:37:25,929 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 315 predicate places. [2024-06-04 14:37:25,929 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 1096 transitions, 21592 flow [2024-06-04 14:37:25,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:25,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:25,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:25,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 14:37:25,930 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:25,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash -459269886, now seen corresponding path program 20 times [2024-06-04 14:37:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103449896] [2024-06-04 14:37:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:26,998 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-04 14:37:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103449896] [2024-06-04 14:37:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103449896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:26,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:26,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:37:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885717491] [2024-06-04 14:37:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:26,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:37:27,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:37:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:37:27,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:37:27,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 1096 transitions, 21592 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:27,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:27,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:37:27,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:29,955 INFO L124 PetriNetUnfolderBase]: 5873/8926 cut-off events. [2024-06-04 14:37:29,955 INFO L125 PetriNetUnfolderBase]: For 1461975/1462045 co-relation queries the response was YES. [2024-06-04 14:37:30,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95057 conditions, 8926 events. 5873/8926 cut-off events. For 1461975/1462045 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 52917 event pairs, 1821 based on Foata normal form. 16/8880 useless extension candidates. Maximal degree in co-relation 94916. Up to 8327 conditions per place. [2024-06-04 14:37:30,099 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 1065 selfloop transitions, 58 changer transitions 0/1134 dead transitions. [2024-06-04 14:37:30,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 1134 transitions, 24219 flow [2024-06-04 14:37:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 14:37:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 14:37:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-04 14:37:30,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022222222222222 [2024-06-04 14:37:30,102 INFO L175 Difference]: Start difference. First operand has 361 places, 1096 transitions, 21592 flow. Second operand 10 states and 181 transitions. [2024-06-04 14:37:30,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 1134 transitions, 24219 flow [2024-06-04 14:37:32,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1134 transitions, 23437 flow, removed 106 selfloop flow, removed 11 redundant places. [2024-06-04 14:37:32,263 INFO L231 Difference]: Finished difference. Result has 360 places, 1096 transitions, 20954 flow [2024-06-04 14:37:32,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20810, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20954, PETRI_PLACES=360, PETRI_TRANSITIONS=1096} [2024-06-04 14:37:32,263 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 314 predicate places. [2024-06-04 14:37:32,264 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 1096 transitions, 20954 flow [2024-06-04 14:37:32,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:32,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:32,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:32,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 14:37:32,264 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:32,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash -448785438, now seen corresponding path program 1 times [2024-06-04 14:37:32,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:32,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949826125] [2024-06-04 14:37:32,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:32,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:37:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949826125] [2024-06-04 14:37:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949826125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:37:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763556430] [2024-06-04 14:37:33,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:33,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:37:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:37:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:37:33,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:37:33,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1096 transitions, 20954 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:33,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:33,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:37:33,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:36,581 INFO L124 PetriNetUnfolderBase]: 6615/9878 cut-off events. [2024-06-04 14:37:36,582 INFO L125 PetriNetUnfolderBase]: For 1518535/1518792 co-relation queries the response was YES. [2024-06-04 14:37:36,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102469 conditions, 9878 events. 6615/9878 cut-off events. For 1518535/1518792 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 57229 event pairs, 2087 based on Foata normal form. 157/9837 useless extension candidates. Maximal degree in co-relation 102329. Up to 9207 conditions per place. [2024-06-04 14:37:36,775 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 1012 selfloop transitions, 30 changer transitions 0/1134 dead transitions. [2024-06-04 14:37:36,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1134 transitions, 23541 flow [2024-06-04 14:37:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:37:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:37:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-04 14:37:36,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-04 14:37:36,777 INFO L175 Difference]: Start difference. First operand has 360 places, 1096 transitions, 20954 flow. Second operand 8 states and 152 transitions. [2024-06-04 14:37:36,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1134 transitions, 23541 flow [2024-06-04 14:37:38,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1134 transitions, 23207 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 14:37:38,905 INFO L231 Difference]: Finished difference. Result has 359 places, 1109 transitions, 21022 flow [2024-06-04 14:37:38,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20636, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=21022, PETRI_PLACES=359, PETRI_TRANSITIONS=1109} [2024-06-04 14:37:38,906 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 313 predicate places. [2024-06-04 14:37:38,906 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 1109 transitions, 21022 flow [2024-06-04 14:37:38,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:38,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:38,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:38,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 14:37:38,906 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:38,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1525580216, now seen corresponding path program 3 times [2024-06-04 14:37:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159220587] [2024-06-04 14:37:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:39,805 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-04 14:37:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:39,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159220587] [2024-06-04 14:37:39,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159220587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:39,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:39,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:37:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510079426] [2024-06-04 14:37:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:39,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:37:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:37:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:37:39,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 14:37:39,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1109 transitions, 21022 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:39,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:39,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 14:37:39,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:42,647 INFO L124 PetriNetUnfolderBase]: 5864/9039 cut-off events. [2024-06-04 14:37:42,647 INFO L125 PetriNetUnfolderBase]: For 1578457/1579163 co-relation queries the response was YES. [2024-06-04 14:37:42,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96072 conditions, 9039 events. 5864/9039 cut-off events. For 1578457/1579163 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 55133 event pairs, 1956 based on Foata normal form. 281/9083 useless extension candidates. Maximal degree in co-relation 95931. Up to 7717 conditions per place. [2024-06-04 14:37:42,781 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 730 selfloop transitions, 13 changer transitions 0/1117 dead transitions. [2024-06-04 14:37:42,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1117 transitions, 22548 flow [2024-06-04 14:37:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:37:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:37:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-04 14:37:42,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 14:37:42,782 INFO L175 Difference]: Start difference. First operand has 359 places, 1109 transitions, 21022 flow. Second operand 7 states and 126 transitions. [2024-06-04 14:37:42,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1117 transitions, 22548 flow [2024-06-04 14:37:44,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1117 transitions, 22206 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-04 14:37:44,879 INFO L231 Difference]: Finished difference. Result has 359 places, 1109 transitions, 20712 flow [2024-06-04 14:37:44,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20680, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1096, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=20712, PETRI_PLACES=359, PETRI_TRANSITIONS=1109} [2024-06-04 14:37:44,880 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 313 predicate places. [2024-06-04 14:37:44,880 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 1109 transitions, 20712 flow [2024-06-04 14:37:44,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:44,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:44,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:44,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 14:37:44,881 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:44,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1532238520, now seen corresponding path program 1 times [2024-06-04 14:37:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:44,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703928220] [2024-06-04 14:37:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:44,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:45,632 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-04 14:37:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703928220] [2024-06-04 14:37:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703928220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:45,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:37:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281647338] [2024-06-04 14:37:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:45,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:37:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:37:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:37:45,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-06-04 14:37:45,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1109 transitions, 20712 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-04 14:37:45,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:45,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-06-04 14:37:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:48,770 INFO L124 PetriNetUnfolderBase]: 6760/10043 cut-off events. [2024-06-04 14:37:48,770 INFO L125 PetriNetUnfolderBase]: For 1486224/1486464 co-relation queries the response was YES. [2024-06-04 14:37:48,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101910 conditions, 10043 events. 6760/10043 cut-off events. For 1486224/1486464 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 57278 event pairs, 2204 based on Foata normal form. 156/10052 useless extension candidates. Maximal degree in co-relation 101768. Up to 9524 conditions per place. [2024-06-04 14:37:48,925 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 1024 selfloop transitions, 17 changer transitions 0/1127 dead transitions. [2024-06-04 14:37:48,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1127 transitions, 23090 flow [2024-06-04 14:37:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:37:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:37:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-04 14:37:48,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-04 14:37:48,926 INFO L175 Difference]: Start difference. First operand has 359 places, 1109 transitions, 20712 flow. Second operand 6 states and 110 transitions. [2024-06-04 14:37:48,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1127 transitions, 23090 flow [2024-06-04 14:37:51,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1127 transitions, 23058 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 14:37:51,267 INFO L231 Difference]: Finished difference. Result has 360 places, 1115 transitions, 20798 flow [2024-06-04 14:37:51,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20680, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1095, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=20798, PETRI_PLACES=360, PETRI_TRANSITIONS=1115} [2024-06-04 14:37:51,268 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 314 predicate places. [2024-06-04 14:37:51,268 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 1115 transitions, 20798 flow [2024-06-04 14:37:51,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-04 14:37:51,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:51,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:51,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 14:37:51,269 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:51,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 21041900, now seen corresponding path program 2 times [2024-06-04 14:37:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502674035] [2024-06-04 14:37:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:52,082 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-04 14:37:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502674035] [2024-06-04 14:37:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502674035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:52,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:37:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83970861] [2024-06-04 14:37:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:52,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:37:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:37:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:37:52,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-06-04 14:37:52,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1115 transitions, 20798 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-04 14:37:52,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:52,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-06-04 14:37:52,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:37:55,103 INFO L124 PetriNetUnfolderBase]: 6757/10040 cut-off events. [2024-06-04 14:37:55,103 INFO L125 PetriNetUnfolderBase]: For 1516521/1516764 co-relation queries the response was YES. [2024-06-04 14:37:55,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102641 conditions, 10040 events. 6757/10040 cut-off events. For 1516521/1516764 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 57287 event pairs, 2207 based on Foata normal form. 158/10050 useless extension candidates. Maximal degree in co-relation 102498. Up to 9521 conditions per place. [2024-06-04 14:37:55,285 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 1020 selfloop transitions, 17 changer transitions 0/1123 dead transitions. [2024-06-04 14:37:55,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1123 transitions, 22912 flow [2024-06-04 14:37:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:37:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:37:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 14:37:55,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2024-06-04 14:37:55,287 INFO L175 Difference]: Start difference. First operand has 360 places, 1115 transitions, 20798 flow. Second operand 6 states and 106 transitions. [2024-06-04 14:37:55,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1123 transitions, 22912 flow [2024-06-04 14:37:57,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 1123 transitions, 22855 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-04 14:37:57,597 INFO L231 Difference]: Finished difference. Result has 364 places, 1115 transitions, 20781 flow [2024-06-04 14:37:57,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20741, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1098, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=20781, PETRI_PLACES=364, PETRI_TRANSITIONS=1115} [2024-06-04 14:37:57,598 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 318 predicate places. [2024-06-04 14:37:57,598 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 1115 transitions, 20781 flow [2024-06-04 14:37:57,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-04 14:37:57,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:37:57,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:37:57,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 14:37:57,598 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 14:37:57,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:37:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1161445597, now seen corresponding path program 1 times [2024-06-04 14:37:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:37:57,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747412764] [2024-06-04 14:37:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:37:57,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:37:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:37:58,455 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-04 14:37:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:37:58,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747412764] [2024-06-04 14:37:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747412764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:37:58,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:37:58,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 14:37:58,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881416025] [2024-06-04 14:37:58,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:37:58,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 14:37:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:37:58,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 14:37:58,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 14:37:58,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-04 14:37:58,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1115 transitions, 20781 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:37:58,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:37:58,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-04 14:37:58,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:38:01,840 INFO L124 PetriNetUnfolderBase]: 6044/9158 cut-off events. [2024-06-04 14:38:01,841 INFO L125 PetriNetUnfolderBase]: For 1520330/1520389 co-relation queries the response was YES. [2024-06-04 14:38:01,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98729 conditions, 9158 events. 6044/9158 cut-off events. For 1520330/1520389 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 54215 event pairs, 1421 based on Foata normal form. 22/9134 useless extension candidates. Maximal degree in co-relation 98584. Up to 8271 conditions per place. [2024-06-04 14:38:01,988 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 1023 selfloop transitions, 144 changer transitions 0/1180 dead transitions. [2024-06-04 14:38:01,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1180 transitions, 24172 flow [2024-06-04 14:38:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 14:38:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 14:38:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-04 14:38:01,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-04 14:38:01,989 INFO L175 Difference]: Start difference. First operand has 364 places, 1115 transitions, 20781 flow. Second operand 12 states and 237 transitions. [2024-06-04 14:38:01,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1180 transitions, 24172 flow