./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix041_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix041_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix041_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:37:15,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:37:15,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:37:15,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:37:15,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:37:15,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:37:15,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:37:15,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:37:15,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:37:15,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:37:15,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:37:15,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:37:15,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:37:15,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:37:15,541 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:37:15,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:37:15,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:37:15,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:37:15,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:37:15,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:37:15,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:37:15,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:37:15,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:37:15,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:37:15,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:37:15,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:37:15,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:37:15,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:37:15,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:37:15,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:37:15,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:37:15,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:37:15,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:37:15,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:37:15,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:37:15,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:37:15,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:37:15,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:37:15,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:37:15,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:37:15,547 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:37:15,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:37:15,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:37:15,547 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 01:37:15,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:37:15,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:37:15,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:37:15,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:37:15,764 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:37:15,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:37:16,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:37:17,122 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:37:17,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:37:17,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bca9f583/9558fe7e221b44ae8b63520ddb768979/FLAG3877b365c [2024-06-28 01:37:17,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bca9f583/9558fe7e221b44ae8b63520ddb768979 [2024-06-28 01:37:17,467 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:37:17,468 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:37:17,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix041_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-28 01:37:17,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:37:17,610 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:37:17,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:37:17,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:37:17,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:37:17,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:37:17" (1/2) ... [2024-06-28 01:37:17,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbfa38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:37:17, skipping insertion in model container [2024-06-28 01:37:17,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:37:17" (1/2) ... [2024-06-28 01:37:17,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f1c3eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:37:17, skipping insertion in model container [2024-06-28 01:37:17,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:37:17" (2/2) ... [2024-06-28 01:37:17,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbfa38b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:17, skipping insertion in model container [2024-06-28 01:37:17,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:37:17" (2/2) ... [2024-06-28 01:37:17,620 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:37:17,668 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:37:17,670 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((! multithreaded || z$read_delayed == (_Bool)0) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:37:17,670 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((! multithreaded || z$read_delayed == (_Bool)0) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:37:17,670 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:37:17,670 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-28 01:37:17,705 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:37:17,848 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-28 01:37:17,994 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:37:18,018 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:37:18,052 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:37:18,110 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:37:18,136 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:37:18,136 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18 WrapperNode [2024-06-28 01:37:18,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:37:18,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:37:18,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:37:18,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:37:18,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,175 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2024-06-28 01:37:18,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:37:18,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:37:18,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:37:18,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:37:18,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,202 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-28 01:37:18,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:37:18,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:37:18,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:37:18,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:37:18,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (1/1) ... [2024-06-28 01:37:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:37:18,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:37:18,267 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-28 01:37:18,312 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-28 01:37:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:37:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:37:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:37:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:37:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:37:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:37:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:37:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:37:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:37:18,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:37:18,326 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:37:18,437 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:37:18,438 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:37:18,699 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:37:18,699 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:37:18,820 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:37:18,821 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:37:18,822 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:37:18 BoogieIcfgContainer [2024-06-28 01:37:18,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:37:18,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:37:18,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:37:18,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:37:18,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:37:17" (1/4) ... [2024-06-28 01:37:18,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20162f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:37:18, skipping insertion in model container [2024-06-28 01:37:18,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:37:17" (2/4) ... [2024-06-28 01:37:18,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20162f97 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:37:18, skipping insertion in model container [2024-06-28 01:37:18,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:18" (3/4) ... [2024-06-28 01:37:18,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20162f97 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:37:18, skipping insertion in model container [2024-06-28 01:37:18,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:37:18" (4/4) ... [2024-06-28 01:37:18,833 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:37:18,846 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:37:18,846 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 01:37:18,846 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:37:18,895 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:37:18,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:37:18,950 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-28 01:37:18,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:37:18,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-28 01:37:18,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:37:18,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-28 01:37:18,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:37:18,975 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;@450133b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:37:18,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 01:37:18,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:37:18,980 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:37:18,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:37:18,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:18,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:37:18,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:18,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash 315654007, now seen corresponding path program 1 times [2024-06-28 01:37:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110819140] [2024-06-28 01:37:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:19,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110819140] [2024-06-28 01:37:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110819140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:19,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:37:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817256170] [2024-06-28 01:37:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:19,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:37:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:37:19,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:37:19,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:37:19,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:19,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:19,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:37:19,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:20,189 INFO L124 PetriNetUnfolderBase]: 559/1092 cut-off events. [2024-06-28 01:37:20,190 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-28 01:37:20,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 1092 events. 559/1092 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6092 event pairs, 397 based on Foata normal form. 43/1024 useless extension candidates. Maximal degree in co-relation 2030. Up to 920 conditions per place. [2024-06-28 01:37:20,214 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-28 01:37:20,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 169 flow [2024-06-28 01:37:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:37:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:37:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-28 01:37:20,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-06-28 01:37:20,224 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 75 transitions. [2024-06-28 01:37:20,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 169 flow [2024-06-28 01:37:20,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:37:20,228 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-06-28 01:37:20,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-28 01:37:20,232 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-28 01:37:20,232 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-06-28 01:37:20,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:20,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:20,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:37:20,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:37:20,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:20,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:20,233 INFO L85 PathProgramCache]: Analyzing trace with hash 315654920, now seen corresponding path program 1 times [2024-06-28 01:37:20,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:20,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770121935] [2024-06-28 01:37:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:20,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770121935] [2024-06-28 01:37:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770121935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:20,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:20,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:37:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719437919] [2024-06-28 01:37:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:20,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:37:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:37:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:37:20,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 37 [2024-06-28 01:37:20,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:20,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:20,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 37 [2024-06-28 01:37:20,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:20,405 INFO L124 PetriNetUnfolderBase]: 169/402 cut-off events. [2024-06-28 01:37:20,405 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-28 01:37:20,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 402 events. 169/402 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2151 event pairs, 96 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 759. Up to 256 conditions per place. [2024-06-28 01:37:20,407 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-06-28 01:37:20,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 171 flow [2024-06-28 01:37:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:37:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:37:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-28 01:37:20,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7657657657657657 [2024-06-28 01:37:20,410 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 100 flow. Second operand 3 states and 85 transitions. [2024-06-28 01:37:20,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 171 flow [2024-06-28 01:37:20,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:37:20,414 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 92 flow [2024-06-28 01:37:20,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-28 01:37:20,415 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-28 01:37:20,415 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 92 flow [2024-06-28 01:37:20,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:20,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:20,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:20,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:37:20,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:20,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1599155083, now seen corresponding path program 1 times [2024-06-28 01:37:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737528566] [2024-06-28 01:37:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:20,932 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-28 01:37:20,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:20,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737528566] [2024-06-28 01:37:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737528566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:20,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:37:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652048399] [2024-06-28 01:37:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:20,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:37:20,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:37:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:37:20,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:37:20,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:20,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:20,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:37:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:21,101 INFO L124 PetriNetUnfolderBase]: 402/815 cut-off events. [2024-06-28 01:37:21,101 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-06-28 01:37:21,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 815 events. 402/815 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4307 event pairs, 260 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 1667. Up to 658 conditions per place. [2024-06-28 01:37:21,105 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 35 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-28 01:37:21,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 220 flow [2024-06-28 01:37:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:37:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:37:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-06-28 01:37:21,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-28 01:37:21,108 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 92 flow. Second operand 4 states and 89 transitions. [2024-06-28 01:37:21,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 220 flow [2024-06-28 01:37:21,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:37:21,110 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-06-28 01:37:21,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-28 01:37:21,111 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-28 01:37:21,111 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-06-28 01:37:21,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:21,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:21,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:21,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:37:21,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:21,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:21,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1965800764, now seen corresponding path program 1 times [2024-06-28 01:37:21,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:21,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009853900] [2024-06-28 01:37:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:21,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-28 01:37:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009853900] [2024-06-28 01:37:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009853900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:37:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539670463] [2024-06-28 01:37:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:21,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:37:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:37:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:37:21,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:37:21,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:21,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:21,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:37:21,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:21,722 INFO L124 PetriNetUnfolderBase]: 418/854 cut-off events. [2024-06-28 01:37:21,722 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-06-28 01:37:21,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 854 events. 418/854 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4623 event pairs, 147 based on Foata normal form. 3/820 useless extension candidates. Maximal degree in co-relation 1888. Up to 629 conditions per place. [2024-06-28 01:37:21,727 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 46 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-28 01:37:21,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 341 flow [2024-06-28 01:37:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:37:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:37:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-28 01:37:21,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2024-06-28 01:37:21,731 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 135 flow. Second operand 5 states and 116 transitions. [2024-06-28 01:37:21,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 341 flow [2024-06-28 01:37:21,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 334 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:37:21,735 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 216 flow [2024-06-28 01:37:21,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-06-28 01:37:21,737 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-28 01:37:21,737 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 216 flow [2024-06-28 01:37:21,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:21,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:21,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:21,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:37:21,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:21,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 810282356, now seen corresponding path program 1 times [2024-06-28 01:37:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676643963] [2024-06-28 01:37:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:22,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:22,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676643963] [2024-06-28 01:37:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676643963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:37:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104542094] [2024-06-28 01:37:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:37:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:37:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:37:22,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:37:22,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 216 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-28 01:37:22,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:22,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:37:22,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:22,703 INFO L124 PetriNetUnfolderBase]: 428/864 cut-off events. [2024-06-28 01:37:22,703 INFO L125 PetriNetUnfolderBase]: For 814/814 co-relation queries the response was YES. [2024-06-28 01:37:22,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2291 conditions, 864 events. 428/864 cut-off events. For 814/814 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4649 event pairs, 108 based on Foata normal form. 3/832 useless extension candidates. Maximal degree in co-relation 2272. Up to 620 conditions per place. [2024-06-28 01:37:22,709 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 53 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2024-06-28 01:37:22,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 456 flow [2024-06-28 01:37:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:37:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:37:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-06-28 01:37:22,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2024-06-28 01:37:22,711 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 216 flow. Second operand 6 states and 138 transitions. [2024-06-28 01:37:22,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 456 flow [2024-06-28 01:37:22,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 452 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 01:37:22,717 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 272 flow [2024-06-28 01:37:22,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-28 01:37:22,722 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2024-06-28 01:37:22,722 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 272 flow [2024-06-28 01:37:22,722 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-28 01:37:22,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:22,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:37:22,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:22,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -651049893, now seen corresponding path program 1 times [2024-06-28 01:37:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774548542] [2024-06-28 01:37:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:23,445 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-28 01:37:23,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:23,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774548542] [2024-06-28 01:37:23,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774548542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:23,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:23,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:37:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041960434] [2024-06-28 01:37:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:23,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:37:23,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:37:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:37:23,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:37:23,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-28 01:37:23,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:23,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:37:23,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:23,744 INFO L124 PetriNetUnfolderBase]: 444/822 cut-off events. [2024-06-28 01:37:23,744 INFO L125 PetriNetUnfolderBase]: For 1170/1170 co-relation queries the response was YES. [2024-06-28 01:37:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 822 events. 444/822 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4243 event pairs, 39 based on Foata normal form. 6/818 useless extension candidates. Maximal degree in co-relation 2507. Up to 565 conditions per place. [2024-06-28 01:37:23,749 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 59 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2024-06-28 01:37:23,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 628 flow [2024-06-28 01:37:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:37:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:37:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-28 01:37:23,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6023166023166023 [2024-06-28 01:37:23,750 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 272 flow. Second operand 7 states and 156 transitions. [2024-06-28 01:37:23,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 628 flow [2024-06-28 01:37:23,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 97 transitions, 592 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:37:23,754 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 412 flow [2024-06-28 01:37:23,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2024-06-28 01:37:23,754 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2024-06-28 01:37:23,755 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 412 flow [2024-06-28 01:37:23,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-28 01:37:23,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:23,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:23,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:37:23,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:23,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash -981548492, now seen corresponding path program 1 times [2024-06-28 01:37:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196938832] [2024-06-28 01:37:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:24,101 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-28 01:37:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:24,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196938832] [2024-06-28 01:37:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196938832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:24,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:37:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462387396] [2024-06-28 01:37:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:24,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:37:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:37:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:37:24,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:24,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:24,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:24,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:24,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:24,413 INFO L124 PetriNetUnfolderBase]: 520/1038 cut-off events. [2024-06-28 01:37:24,413 INFO L125 PetriNetUnfolderBase]: For 1997/1997 co-relation queries the response was YES. [2024-06-28 01:37:24,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1038 events. 520/1038 cut-off events. For 1997/1997 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5717 event pairs, 157 based on Foata normal form. 1/1003 useless extension candidates. Maximal degree in co-relation 3322. Up to 848 conditions per place. [2024-06-28 01:37:24,419 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 56 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2024-06-28 01:37:24,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 568 flow [2024-06-28 01:37:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:37:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:37:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-28 01:37:24,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-28 01:37:24,420 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 412 flow. Second operand 5 states and 91 transitions. [2024-06-28 01:37:24,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 568 flow [2024-06-28 01:37:24,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 532 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-06-28 01:37:24,425 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 404 flow [2024-06-28 01:37:24,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-28 01:37:24,425 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2024-06-28 01:37:24,425 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 404 flow [2024-06-28 01:37:24,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:24,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:24,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:24,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:37:24,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:24,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash -364326629, now seen corresponding path program 1 times [2024-06-28 01:37:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:24,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548388316] [2024-06-28 01:37:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:24,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-28 01:37:24,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548388316] [2024-06-28 01:37:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548388316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:24,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:24,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:37:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177059362] [2024-06-28 01:37:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:24,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:37:24,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:37:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:37:24,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:24,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 404 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-28 01:37:24,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:24,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:24,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:25,151 INFO L124 PetriNetUnfolderBase]: 589/1145 cut-off events. [2024-06-28 01:37:25,151 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2024-06-28 01:37:25,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 1145 events. 589/1145 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6250 event pairs, 179 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 3523. Up to 947 conditions per place. [2024-06-28 01:37:25,157 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 62 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2024-06-28 01:37:25,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 600 flow [2024-06-28 01:37:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:37:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:37:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-28 01:37:25,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2024-06-28 01:37:25,159 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 404 flow. Second operand 6 states and 103 transitions. [2024-06-28 01:37:25,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 600 flow [2024-06-28 01:37:25,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 575 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:37:25,163 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 423 flow [2024-06-28 01:37:25,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=423, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-06-28 01:37:25,163 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-06-28 01:37:25,163 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 423 flow [2024-06-28 01:37:25,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-28 01:37:25,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:25,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:25,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:37:25,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:25,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1966583946, now seen corresponding path program 1 times [2024-06-28 01:37:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130389693] [2024-06-28 01:37:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:25,647 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-28 01:37:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130389693] [2024-06-28 01:37:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130389693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:25,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:37:25,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453461601] [2024-06-28 01:37:25,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:25,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:37:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:37:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:37:25,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:25,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 423 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:25,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:25,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:25,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:25,894 INFO L124 PetriNetUnfolderBase]: 546/1070 cut-off events. [2024-06-28 01:37:25,894 INFO L125 PetriNetUnfolderBase]: For 2424/2424 co-relation queries the response was YES. [2024-06-28 01:37:25,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3532 conditions, 1070 events. 546/1070 cut-off events. For 2424/2424 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5816 event pairs, 126 based on Foata normal form. 2/1032 useless extension candidates. Maximal degree in co-relation 3501. Up to 808 conditions per place. [2024-06-28 01:37:25,901 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 63 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2024-06-28 01:37:25,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 664 flow [2024-06-28 01:37:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:37:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:37:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-28 01:37:25,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-06-28 01:37:25,903 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 423 flow. Second operand 6 states and 115 transitions. [2024-06-28 01:37:25,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 664 flow [2024-06-28 01:37:25,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 87 transitions, 640 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:37:25,908 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 457 flow [2024-06-28 01:37:25,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-06-28 01:37:25,909 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2024-06-28 01:37:25,909 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 457 flow [2024-06-28 01:37:25,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:25,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:25,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:25,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:37:25,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:25,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1932270666, now seen corresponding path program 2 times [2024-06-28 01:37:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664922466] [2024-06-28 01:37:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664922466] [2024-06-28 01:37:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664922466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:26,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:26,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:37:26,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265606900] [2024-06-28 01:37:26,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:26,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:37:26,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:37:26,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:37:26,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:26,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 457 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:26,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:26,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:26,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:26,661 INFO L124 PetriNetUnfolderBase]: 550/1081 cut-off events. [2024-06-28 01:37:26,661 INFO L125 PetriNetUnfolderBase]: For 2784/2784 co-relation queries the response was YES. [2024-06-28 01:37:26,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 1081 events. 550/1081 cut-off events. For 2784/2784 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5951 event pairs, 170 based on Foata normal form. 1/1046 useless extension candidates. Maximal degree in co-relation 3588. Up to 885 conditions per place. [2024-06-28 01:37:26,667 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 62 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-06-28 01:37:26,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 635 flow [2024-06-28 01:37:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:37:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:37:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-28 01:37:26,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-28 01:37:26,669 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 457 flow. Second operand 6 states and 106 transitions. [2024-06-28 01:37:26,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 81 transitions, 635 flow [2024-06-28 01:37:26,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 81 transitions, 608 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 01:37:26,673 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 455 flow [2024-06-28 01:37:26,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-06-28 01:37:26,674 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-28 01:37:26,674 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 455 flow [2024-06-28 01:37:26,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:26,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:26,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:26,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:37:26,675 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:26,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 565669201, now seen corresponding path program 1 times [2024-06-28 01:37:26,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:26,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62088345] [2024-06-28 01:37:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:26,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62088345] [2024-06-28 01:37:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62088345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363347854] [2024-06-28 01:37:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:27,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:27,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:27,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 455 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:27,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:27,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:27,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:27,596 INFO L124 PetriNetUnfolderBase]: 587/1125 cut-off events. [2024-06-28 01:37:27,596 INFO L125 PetriNetUnfolderBase]: For 3079/3079 co-relation queries the response was YES. [2024-06-28 01:37:27,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3753 conditions, 1125 events. 587/1125 cut-off events. For 3079/3079 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6092 event pairs, 170 based on Foata normal form. 3/1089 useless extension candidates. Maximal degree in co-relation 3720. Up to 909 conditions per place. [2024-06-28 01:37:27,602 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 71 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2024-06-28 01:37:27,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 92 transitions, 693 flow [2024-06-28 01:37:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:37:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:37:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-28 01:37:27,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671814671814672 [2024-06-28 01:37:27,604 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 455 flow. Second operand 7 states and 121 transitions. [2024-06-28 01:37:27,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 92 transitions, 693 flow [2024-06-28 01:37:27,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 651 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:27,608 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 462 flow [2024-06-28 01:37:27,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=462, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2024-06-28 01:37:27,609 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2024-06-28 01:37:27,609 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 462 flow [2024-06-28 01:37:27,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:27,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:27,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:27,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:37:27,610 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:27,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash -834559091, now seen corresponding path program 1 times [2024-06-28 01:37:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476188303] [2024-06-28 01:37:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:27,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:28,127 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-28 01:37:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476188303] [2024-06-28 01:37:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476188303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:28,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047732356] [2024-06-28 01:37:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:28,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:28,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:28,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:28,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:28,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:28,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:28,386 INFO L124 PetriNetUnfolderBase]: 615/1132 cut-off events. [2024-06-28 01:37:28,386 INFO L125 PetriNetUnfolderBase]: For 3241/3241 co-relation queries the response was YES. [2024-06-28 01:37:28,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 1132 events. 615/1132 cut-off events. For 3241/3241 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5994 event pairs, 140 based on Foata normal form. 2/1100 useless extension candidates. Maximal degree in co-relation 3914. Up to 853 conditions per place. [2024-06-28 01:37:28,394 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 76 selfloop transitions, 20 changer transitions 0/103 dead transitions. [2024-06-28 01:37:28,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 789 flow [2024-06-28 01:37:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:37:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:37:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-28 01:37:28,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-06-28 01:37:28,395 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 462 flow. Second operand 7 states and 129 transitions. [2024-06-28 01:37:28,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 789 flow [2024-06-28 01:37:28,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 755 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 01:37:28,400 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 537 flow [2024-06-28 01:37:28,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=537, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2024-06-28 01:37:28,401 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2024-06-28 01:37:28,401 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 537 flow [2024-06-28 01:37:28,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:28,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:28,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:28,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:37:28,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:28,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1146153587, now seen corresponding path program 2 times [2024-06-28 01:37:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:28,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147667836] [2024-06-28 01:37:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:28,842 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-28 01:37:28,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:28,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147667836] [2024-06-28 01:37:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147667836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:28,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:28,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433661785] [2024-06-28 01:37:28,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:28,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:28,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:28,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 537 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:28,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:28,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:28,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:29,213 INFO L124 PetriNetUnfolderBase]: 626/1177 cut-off events. [2024-06-28 01:37:29,214 INFO L125 PetriNetUnfolderBase]: For 3874/3874 co-relation queries the response was YES. [2024-06-28 01:37:29,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 1177 events. 626/1177 cut-off events. For 3874/3874 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6402 event pairs, 181 based on Foata normal form. 1/1142 useless extension candidates. Maximal degree in co-relation 4259. Up to 983 conditions per place. [2024-06-28 01:37:29,222 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 78 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2024-06-28 01:37:29,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 829 flow [2024-06-28 01:37:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:37:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:37:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 01:37:29,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46332046332046334 [2024-06-28 01:37:29,224 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 537 flow. Second operand 7 states and 120 transitions. [2024-06-28 01:37:29,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 829 flow [2024-06-28 01:37:29,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 814 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 01:37:29,231 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 591 flow [2024-06-28 01:37:29,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2024-06-28 01:37:29,232 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2024-06-28 01:37:29,232 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 591 flow [2024-06-28 01:37:29,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:29,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:29,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:29,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:37:29,233 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:29,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash 195197359, now seen corresponding path program 3 times [2024-06-28 01:37:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:29,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514242522] [2024-06-28 01:37:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:29,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-28 01:37:29,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:29,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514242522] [2024-06-28 01:37:29,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514242522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:29,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:29,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:29,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469333829] [2024-06-28 01:37:29,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:29,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:29,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:29,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:29,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:29,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:29,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 591 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:29,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:29,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:29,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:30,059 INFO L124 PetriNetUnfolderBase]: 624/1175 cut-off events. [2024-06-28 01:37:30,060 INFO L125 PetriNetUnfolderBase]: For 4475/4475 co-relation queries the response was YES. [2024-06-28 01:37:30,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 1175 events. 624/1175 cut-off events. For 4475/4475 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6410 event pairs, 183 based on Foata normal form. 1/1140 useless extension candidates. Maximal degree in co-relation 4348. Up to 1001 conditions per place. [2024-06-28 01:37:30,066 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 78 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2024-06-28 01:37:30,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 98 transitions, 815 flow [2024-06-28 01:37:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:37:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:37:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 01:37:30,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44787644787644787 [2024-06-28 01:37:30,085 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 591 flow. Second operand 7 states and 116 transitions. [2024-06-28 01:37:30,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 98 transitions, 815 flow [2024-06-28 01:37:30,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 98 transitions, 785 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:37:30,094 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 592 flow [2024-06-28 01:37:30,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=592, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2024-06-28 01:37:30,108 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2024-06-28 01:37:30,108 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 592 flow [2024-06-28 01:37:30,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:30,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:30,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:30,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:37:30,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:30,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 347202575, now seen corresponding path program 1 times [2024-06-28 01:37:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653621192] [2024-06-28 01:37:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:30,920 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-28 01:37:30,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653621192] [2024-06-28 01:37:30,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653621192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:30,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:30,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:30,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119978601] [2024-06-28 01:37:30,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:30,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:30,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:30,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:31,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:31,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 592 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-28 01:37:31,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:31,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:31,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:31,287 INFO L124 PetriNetUnfolderBase]: 590/1068 cut-off events. [2024-06-28 01:37:31,288 INFO L125 PetriNetUnfolderBase]: For 4797/4797 co-relation queries the response was YES. [2024-06-28 01:37:31,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 1068 events. 590/1068 cut-off events. For 4797/4797 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5557 event pairs, 90 based on Foata normal form. 1/1053 useless extension candidates. Maximal degree in co-relation 4186. Up to 768 conditions per place. [2024-06-28 01:37:31,303 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 73 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-06-28 01:37:31,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 114 transitions, 924 flow [2024-06-28 01:37:31,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:37:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:37:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-28 01:37:31,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525096525096525 [2024-06-28 01:37:31,305 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 592 flow. Second operand 7 states and 136 transitions. [2024-06-28 01:37:31,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 114 transitions, 924 flow [2024-06-28 01:37:31,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 114 transitions, 887 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:31,314 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 643 flow [2024-06-28 01:37:31,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=643, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2024-06-28 01:37:31,315 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-06-28 01:37:31,315 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 643 flow [2024-06-28 01:37:31,315 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-28 01:37:31,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:31,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:31,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:37:31,316 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:31,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -506841901, now seen corresponding path program 2 times [2024-06-28 01:37:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:31,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087967974] [2024-06-28 01:37:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:32,043 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-28 01:37:32,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:32,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087967974] [2024-06-28 01:37:32,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087967974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:32,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:32,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516471873] [2024-06-28 01:37:32,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:32,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:32,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:32,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:32,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:32,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:32,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 643 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-28 01:37:32,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:32,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:32,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:32,412 INFO L124 PetriNetUnfolderBase]: 591/1062 cut-off events. [2024-06-28 01:37:32,413 INFO L125 PetriNetUnfolderBase]: For 5312/5312 co-relation queries the response was YES. [2024-06-28 01:37:32,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4398 conditions, 1062 events. 591/1062 cut-off events. For 5312/5312 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5443 event pairs, 86 based on Foata normal form. 1/1049 useless extension candidates. Maximal degree in co-relation 4358. Up to 815 conditions per place. [2024-06-28 01:37:32,420 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 70 selfloop transitions, 28 changer transitions 0/112 dead transitions. [2024-06-28 01:37:32,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 112 transitions, 929 flow [2024-06-28 01:37:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 01:37:32,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-06-28 01:37:32,421 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 643 flow. Second operand 8 states and 145 transitions. [2024-06-28 01:37:32,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 112 transitions, 929 flow [2024-06-28 01:37:32,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 894 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-28 01:37:32,430 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 700 flow [2024-06-28 01:37:32,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=700, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2024-06-28 01:37:32,431 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2024-06-28 01:37:32,433 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 700 flow [2024-06-28 01:37:32,433 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-28 01:37:32,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:32,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:32,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:37:32,433 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:32,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 351017807, now seen corresponding path program 1 times [2024-06-28 01:37:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688922634] [2024-06-28 01:37:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:33,046 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-28 01:37:33,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688922634] [2024-06-28 01:37:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688922634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:33,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90474049] [2024-06-28 01:37:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:33,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:33,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:33,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:33,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:33,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:33,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 700 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:33,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:33,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:33,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:33,393 INFO L124 PetriNetUnfolderBase]: 760/1370 cut-off events. [2024-06-28 01:37:33,393 INFO L125 PetriNetUnfolderBase]: For 7228/7228 co-relation queries the response was YES. [2024-06-28 01:37:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5485 conditions, 1370 events. 760/1370 cut-off events. For 7228/7228 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7415 event pairs, 170 based on Foata normal form. 6/1340 useless extension candidates. Maximal degree in co-relation 5442. Up to 870 conditions per place. [2024-06-28 01:37:33,402 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 97 selfloop transitions, 26 changer transitions 0/130 dead transitions. [2024-06-28 01:37:33,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 130 transitions, 1128 flow [2024-06-28 01:37:33,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:37:33,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:37:33,403 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 700 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:37:33,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 130 transitions, 1128 flow [2024-06-28 01:37:33,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 1073 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:37:33,413 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 771 flow [2024-06-28 01:37:33,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=771, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2024-06-28 01:37:33,413 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2024-06-28 01:37:33,413 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 771 flow [2024-06-28 01:37:33,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:33,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:33,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:33,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:37:33,414 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:33,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash 351012010, now seen corresponding path program 1 times [2024-06-28 01:37:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:33,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377625058] [2024-06-28 01:37:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:33,941 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-28 01:37:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377625058] [2024-06-28 01:37:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377625058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:33,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:33,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:33,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120127279] [2024-06-28 01:37:33,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:33,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:33,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:33,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:33,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:34,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:34,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 771 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:34,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:34,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:34,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:34,265 INFO L124 PetriNetUnfolderBase]: 863/1589 cut-off events. [2024-06-28 01:37:34,266 INFO L125 PetriNetUnfolderBase]: For 9166/9166 co-relation queries the response was YES. [2024-06-28 01:37:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 1589 events. 863/1589 cut-off events. For 9166/9166 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9090 event pairs, 203 based on Foata normal form. 1/1538 useless extension candidates. Maximal degree in co-relation 6827. Up to 1232 conditions per place. [2024-06-28 01:37:34,275 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 99 selfloop transitions, 29 changer transitions 0/135 dead transitions. [2024-06-28 01:37:34,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 135 transitions, 1320 flow [2024-06-28 01:37:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-28 01:37:34,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2024-06-28 01:37:34,276 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 771 flow. Second operand 8 states and 138 transitions. [2024-06-28 01:37:34,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 135 transitions, 1320 flow [2024-06-28 01:37:34,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 135 transitions, 1286 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 01:37:34,289 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 1013 flow [2024-06-28 01:37:34,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1013, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2024-06-28 01:37:34,289 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2024-06-28 01:37:34,289 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 1013 flow [2024-06-28 01:37:34,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:34,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:34,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:34,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:37:34,290 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:34,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:34,290 INFO L85 PathProgramCache]: Analyzing trace with hash 351017590, now seen corresponding path program 2 times [2024-06-28 01:37:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:34,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181508883] [2024-06-28 01:37:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:34,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:34,789 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-28 01:37:34,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:34,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181508883] [2024-06-28 01:37:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181508883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:34,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:34,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225337343] [2024-06-28 01:37:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:34,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:34,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:34,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:34,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 1013 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:34,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:34,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:34,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:35,125 INFO L124 PetriNetUnfolderBase]: 874/1603 cut-off events. [2024-06-28 01:37:35,126 INFO L125 PetriNetUnfolderBase]: For 10267/10267 co-relation queries the response was YES. [2024-06-28 01:37:35,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7207 conditions, 1603 events. 874/1603 cut-off events. For 10267/10267 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9140 event pairs, 205 based on Foata normal form. 1/1553 useless extension candidates. Maximal degree in co-relation 7157. Up to 1244 conditions per place. [2024-06-28 01:37:35,139 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 101 selfloop transitions, 28 changer transitions 0/136 dead transitions. [2024-06-28 01:37:35,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 136 transitions, 1424 flow [2024-06-28 01:37:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 01:37:35,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:37:35,143 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 1013 flow. Second operand 8 states and 136 transitions. [2024-06-28 01:37:35,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 136 transitions, 1424 flow [2024-06-28 01:37:35,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 136 transitions, 1412 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-28 01:37:35,163 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 1112 flow [2024-06-28 01:37:35,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1112, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-06-28 01:37:35,164 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2024-06-28 01:37:35,164 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 1112 flow [2024-06-28 01:37:35,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:35,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:35,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:35,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:37:35,165 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:35,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:35,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2002190607, now seen corresponding path program 2 times [2024-06-28 01:37:35,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:35,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704828795] [2024-06-28 01:37:35,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:35,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:35,652 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-28 01:37:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:35,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704828795] [2024-06-28 01:37:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704828795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:35,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:35,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886558836] [2024-06-28 01:37:35,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:35,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:35,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:35,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:35,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 1112 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:35,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:35,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:35,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:36,095 INFO L124 PetriNetUnfolderBase]: 907/1687 cut-off events. [2024-06-28 01:37:36,096 INFO L125 PetriNetUnfolderBase]: For 12159/12159 co-relation queries the response was YES. [2024-06-28 01:37:36,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7706 conditions, 1687 events. 907/1687 cut-off events. For 12159/12159 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9860 event pairs, 254 based on Foata normal form. 3/1637 useless extension candidates. Maximal degree in co-relation 7652. Up to 1338 conditions per place. [2024-06-28 01:37:36,107 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 116 selfloop transitions, 22 changer transitions 0/145 dead transitions. [2024-06-28 01:37:36,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 145 transitions, 1546 flow [2024-06-28 01:37:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 01:37:36,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-06-28 01:37:36,109 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 1112 flow. Second operand 8 states and 142 transitions. [2024-06-28 01:37:36,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 145 transitions, 1546 flow [2024-06-28 01:37:36,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 145 transitions, 1511 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:37:36,128 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 1166 flow [2024-06-28 01:37:36,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1166, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-06-28 01:37:36,129 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2024-06-28 01:37:36,129 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 1166 flow [2024-06-28 01:37:36,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:36,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:36,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:36,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:37:36,130 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:36,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash -271143259, now seen corresponding path program 3 times [2024-06-28 01:37:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:36,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733351536] [2024-06-28 01:37:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:36,667 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-28 01:37:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733351536] [2024-06-28 01:37:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733351536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:36,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:36,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792682591] [2024-06-28 01:37:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:36,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:36,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:36,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:36,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:36,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:36,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 1166 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:36,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:36,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:36,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:37,267 INFO L124 PetriNetUnfolderBase]: 940/1763 cut-off events. [2024-06-28 01:37:37,270 INFO L125 PetriNetUnfolderBase]: For 13795/13795 co-relation queries the response was YES. [2024-06-28 01:37:37,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8083 conditions, 1763 events. 940/1763 cut-off events. For 13795/13795 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10468 event pairs, 270 based on Foata normal form. 3/1707 useless extension candidates. Maximal degree in co-relation 8028. Up to 1462 conditions per place. [2024-06-28 01:37:37,305 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 116 selfloop transitions, 17 changer transitions 0/140 dead transitions. [2024-06-28 01:37:37,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 140 transitions, 1508 flow [2024-06-28 01:37:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 01:37:37,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2024-06-28 01:37:37,306 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 1166 flow. Second operand 8 states and 133 transitions. [2024-06-28 01:37:37,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 140 transitions, 1508 flow [2024-06-28 01:37:37,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 140 transitions, 1473 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 01:37:37,351 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 1196 flow [2024-06-28 01:37:37,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1196, PETRI_PLACES=121, PETRI_TRANSITIONS=119} [2024-06-28 01:37:37,352 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2024-06-28 01:37:37,352 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 1196 flow [2024-06-28 01:37:37,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:37,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:37,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:37,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:37:37,353 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:37,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -271438999, now seen corresponding path program 4 times [2024-06-28 01:37:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584463776] [2024-06-28 01:37:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:37,929 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-28 01:37:37,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:37,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584463776] [2024-06-28 01:37:37,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584463776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:37,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:37,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163784254] [2024-06-28 01:37:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:37,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:37,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:37,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:37,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:37,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:37,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 1196 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:37,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:37,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:37,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:38,386 INFO L124 PetriNetUnfolderBase]: 934/1742 cut-off events. [2024-06-28 01:37:38,386 INFO L125 PetriNetUnfolderBase]: For 13699/13699 co-relation queries the response was YES. [2024-06-28 01:37:38,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8018 conditions, 1742 events. 934/1742 cut-off events. For 13699/13699 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10291 event pairs, 260 based on Foata normal form. 3/1689 useless extension candidates. Maximal degree in co-relation 7962. Up to 1411 conditions per place. [2024-06-28 01:37:38,396 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 116 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2024-06-28 01:37:38,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 144 transitions, 1542 flow [2024-06-28 01:37:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:37:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:37:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-28 01:37:38,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-28 01:37:38,397 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 1196 flow. Second operand 9 states and 148 transitions. [2024-06-28 01:37:38,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 144 transitions, 1542 flow [2024-06-28 01:37:38,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 144 transitions, 1481 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:38,419 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 1182 flow [2024-06-28 01:37:38,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1182, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2024-06-28 01:37:38,419 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2024-06-28 01:37:38,419 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 1182 flow [2024-06-28 01:37:38,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:38,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:38,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:38,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:37:38,420 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:38,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:38,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1853014342, now seen corresponding path program 3 times [2024-06-28 01:37:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:38,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247270652] [2024-06-28 01:37:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:38,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:38,924 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-28 01:37:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247270652] [2024-06-28 01:37:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247270652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192107031] [2024-06-28 01:37:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:38,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:38,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:38,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:38,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 1182 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:38,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:38,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:38,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:39,298 INFO L124 PetriNetUnfolderBase]: 932/1751 cut-off events. [2024-06-28 01:37:39,299 INFO L125 PetriNetUnfolderBase]: For 13304/13304 co-relation queries the response was YES. [2024-06-28 01:37:39,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7927 conditions, 1751 events. 932/1751 cut-off events. For 13304/13304 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10401 event pairs, 267 based on Foata normal form. 1/1693 useless extension candidates. Maximal degree in co-relation 7870. Up to 1468 conditions per place. [2024-06-28 01:37:39,338 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 114 selfloop transitions, 16 changer transitions 0/137 dead transitions. [2024-06-28 01:37:39,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 137 transitions, 1496 flow [2024-06-28 01:37:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-28 01:37:39,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2024-06-28 01:37:39,340 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 1182 flow. Second operand 8 states and 128 transitions. [2024-06-28 01:37:39,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 137 transitions, 1496 flow [2024-06-28 01:37:39,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 137 transitions, 1428 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-28 01:37:39,371 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 1151 flow [2024-06-28 01:37:39,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1151, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2024-06-28 01:37:39,372 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 82 predicate places. [2024-06-28 01:37:39,372 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 1151 flow [2024-06-28 01:37:39,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:39,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:39,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:39,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:37:39,373 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:39,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 291317840, now seen corresponding path program 4 times [2024-06-28 01:37:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476553184] [2024-06-28 01:37:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:39,854 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-28 01:37:39,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:39,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476553184] [2024-06-28 01:37:39,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476553184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:39,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:39,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:39,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528265567] [2024-06-28 01:37:39,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:39,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:39,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:39,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:39,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:39,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 1151 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:39,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:39,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:39,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:40,415 INFO L124 PetriNetUnfolderBase]: 1081/2119 cut-off events. [2024-06-28 01:37:40,415 INFO L125 PetriNetUnfolderBase]: For 15907/15907 co-relation queries the response was YES. [2024-06-28 01:37:40,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9635 conditions, 2119 events. 1081/2119 cut-off events. For 15907/15907 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13517 event pairs, 221 based on Foata normal form. 1/2030 useless extension candidates. Maximal degree in co-relation 9578. Up to 1392 conditions per place. [2024-06-28 01:37:40,432 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 136 selfloop transitions, 67 changer transitions 0/210 dead transitions. [2024-06-28 01:37:40,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 210 transitions, 2548 flow [2024-06-28 01:37:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:37:40,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2024-06-28 01:37:40,434 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 1151 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:37:40,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 210 transitions, 2548 flow [2024-06-28 01:37:40,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 210 transitions, 2499 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:40,463 INFO L231 Difference]: Finished difference. Result has 128 places, 167 transitions, 1980 flow [2024-06-28 01:37:40,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1980, PETRI_PLACES=128, PETRI_TRANSITIONS=167} [2024-06-28 01:37:40,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2024-06-28 01:37:40,464 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 167 transitions, 1980 flow [2024-06-28 01:37:40,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:40,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:40,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:40,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:37:40,465 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:40,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 291323420, now seen corresponding path program 5 times [2024-06-28 01:37:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:40,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958058316] [2024-06-28 01:37:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958058316] [2024-06-28 01:37:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958058316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26901355] [2024-06-28 01:37:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:40,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:40,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:40,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:40,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 167 transitions, 1980 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:40,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:40,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:40,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:41,477 INFO L124 PetriNetUnfolderBase]: 1114/2181 cut-off events. [2024-06-28 01:37:41,478 INFO L125 PetriNetUnfolderBase]: For 19532/19532 co-relation queries the response was YES. [2024-06-28 01:37:41,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10866 conditions, 2181 events. 1114/2181 cut-off events. For 19532/19532 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13993 event pairs, 234 based on Foata normal form. 1/2090 useless extension candidates. Maximal degree in co-relation 10805. Up to 1422 conditions per place. [2024-06-28 01:37:41,493 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 140 selfloop transitions, 70 changer transitions 0/217 dead transitions. [2024-06-28 01:37:41,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 217 transitions, 2886 flow [2024-06-28 01:37:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-28 01:37:41,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2024-06-28 01:37:41,495 INFO L175 Difference]: Start difference. First operand has 128 places, 167 transitions, 1980 flow. Second operand 8 states and 146 transitions. [2024-06-28 01:37:41,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 217 transitions, 2886 flow [2024-06-28 01:37:41,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 217 transitions, 2787 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 01:37:41,531 INFO L231 Difference]: Finished difference. Result has 135 places, 179 transitions, 2272 flow [2024-06-28 01:37:41,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2272, PETRI_PLACES=135, PETRI_TRANSITIONS=179} [2024-06-28 01:37:41,532 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-06-28 01:37:41,532 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 179 transitions, 2272 flow [2024-06-28 01:37:41,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:41,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:41,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:41,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:37:41,532 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:41,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2121681546, now seen corresponding path program 1 times [2024-06-28 01:37:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438402396] [2024-06-28 01:37:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:42,202 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-28 01:37:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:42,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438402396] [2024-06-28 01:37:42,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438402396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:42,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:42,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737159414] [2024-06-28 01:37:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:42,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:42,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:42,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:42,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 179 transitions, 2272 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-28 01:37:42,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:42,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:42,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:42,727 INFO L124 PetriNetUnfolderBase]: 1060/2053 cut-off events. [2024-06-28 01:37:42,727 INFO L125 PetriNetUnfolderBase]: For 20347/20347 co-relation queries the response was YES. [2024-06-28 01:37:42,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10865 conditions, 2053 events. 1060/2053 cut-off events. For 20347/20347 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13056 event pairs, 143 based on Foata normal form. 2/1985 useless extension candidates. Maximal degree in co-relation 10800. Up to 1169 conditions per place. [2024-06-28 01:37:42,759 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 132 selfloop transitions, 46 changer transitions 0/216 dead transitions. [2024-06-28 01:37:42,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 216 transitions, 2828 flow [2024-06-28 01:37:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:37:42,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:37:42,767 INFO L175 Difference]: Start difference. First operand has 135 places, 179 transitions, 2272 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:37:42,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 216 transitions, 2828 flow [2024-06-28 01:37:42,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 216 transitions, 2715 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:37:42,825 INFO L231 Difference]: Finished difference. Result has 138 places, 180 transitions, 2266 flow [2024-06-28 01:37:42,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2266, PETRI_PLACES=138, PETRI_TRANSITIONS=180} [2024-06-28 01:37:42,826 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places. [2024-06-28 01:37:42,826 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 180 transitions, 2266 flow [2024-06-28 01:37:42,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-28 01:37:42,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:42,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:42,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:37:42,827 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:42,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1029361458, now seen corresponding path program 2 times [2024-06-28 01:37:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778342628] [2024-06-28 01:37:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:43,467 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-28 01:37:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:43,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778342628] [2024-06-28 01:37:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778342628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:43,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:43,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737918768] [2024-06-28 01:37:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:43,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:43,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:43,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:43,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 180 transitions, 2266 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-28 01:37:43,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:43,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:43,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:44,066 INFO L124 PetriNetUnfolderBase]: 1076/2077 cut-off events. [2024-06-28 01:37:44,067 INFO L125 PetriNetUnfolderBase]: For 21900/21900 co-relation queries the response was YES. [2024-06-28 01:37:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10927 conditions, 2077 events. 1076/2077 cut-off events. For 21900/21900 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13208 event pairs, 183 based on Foata normal form. 2/2010 useless extension candidates. Maximal degree in co-relation 10862. Up to 1294 conditions per place. [2024-06-28 01:37:44,080 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 132 selfloop transitions, 45 changer transitions 0/215 dead transitions. [2024-06-28 01:37:44,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 215 transitions, 2767 flow [2024-06-28 01:37:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:37:44,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:37:44,081 INFO L175 Difference]: Start difference. First operand has 138 places, 180 transitions, 2266 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:37:44,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 215 transitions, 2767 flow [2024-06-28 01:37:44,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 215 transitions, 2673 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 01:37:44,125 INFO L231 Difference]: Finished difference. Result has 141 places, 181 transitions, 2278 flow [2024-06-28 01:37:44,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2278, PETRI_PLACES=141, PETRI_TRANSITIONS=181} [2024-06-28 01:37:44,125 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2024-06-28 01:37:44,125 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 181 transitions, 2278 flow [2024-06-28 01:37:44,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-28 01:37:44,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:44,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:44,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:37:44,126 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:44,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1029361582, now seen corresponding path program 1 times [2024-06-28 01:37:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498664811] [2024-06-28 01:37:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:44,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498664811] [2024-06-28 01:37:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498664811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334680534] [2024-06-28 01:37:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:44,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:44,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:44,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 181 transitions, 2278 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:44,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:44,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:44,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:45,401 INFO L124 PetriNetUnfolderBase]: 1166/2219 cut-off events. [2024-06-28 01:37:45,402 INFO L125 PetriNetUnfolderBase]: For 22472/22472 co-relation queries the response was YES. [2024-06-28 01:37:45,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11606 conditions, 2219 events. 1166/2219 cut-off events. For 22472/22472 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14023 event pairs, 230 based on Foata normal form. 1/2137 useless extension candidates. Maximal degree in co-relation 11540. Up to 1253 conditions per place. [2024-06-28 01:37:45,419 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 132 selfloop transitions, 95 changer transitions 0/234 dead transitions. [2024-06-28 01:37:45,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 234 transitions, 3031 flow [2024-06-28 01:37:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:37:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:37:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-28 01:37:45,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-28 01:37:45,421 INFO L175 Difference]: Start difference. First operand has 141 places, 181 transitions, 2278 flow. Second operand 10 states and 182 transitions. [2024-06-28 01:37:45,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 234 transitions, 3031 flow [2024-06-28 01:37:45,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 234 transitions, 2932 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:45,468 INFO L231 Difference]: Finished difference. Result has 146 places, 189 transitions, 2456 flow [2024-06-28 01:37:45,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2456, PETRI_PLACES=146, PETRI_TRANSITIONS=189} [2024-06-28 01:37:45,474 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 105 predicate places. [2024-06-28 01:37:45,474 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 189 transitions, 2456 flow [2024-06-28 01:37:45,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:45,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:45,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:45,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:37:45,475 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:45,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:45,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1032157968, now seen corresponding path program 3 times [2024-06-28 01:37:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:45,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846572388] [2024-06-28 01:37:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:46,299 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-28 01:37:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846572388] [2024-06-28 01:37:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846572388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:46,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814161598] [2024-06-28 01:37:46,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:46,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:46,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:46,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:37:46,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 189 transitions, 2456 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-28 01:37:46,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:46,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:37:46,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:46,802 INFO L124 PetriNetUnfolderBase]: 1093/2200 cut-off events. [2024-06-28 01:37:46,802 INFO L125 PetriNetUnfolderBase]: For 23276/23276 co-relation queries the response was YES. [2024-06-28 01:37:46,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11335 conditions, 2200 events. 1093/2200 cut-off events. For 23276/23276 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14596 event pairs, 227 based on Foata normal form. 2/2106 useless extension candidates. Maximal degree in co-relation 11267. Up to 1450 conditions per place. [2024-06-28 01:37:46,818 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 143 selfloop transitions, 39 changer transitions 0/222 dead transitions. [2024-06-28 01:37:46,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 222 transitions, 2965 flow [2024-06-28 01:37:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 01:37:46,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:37:46,819 INFO L175 Difference]: Start difference. First operand has 146 places, 189 transitions, 2456 flow. Second operand 8 states and 148 transitions. [2024-06-28 01:37:46,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 222 transitions, 2965 flow [2024-06-28 01:37:46,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 222 transitions, 2846 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:37:46,905 INFO L231 Difference]: Finished difference. Result has 149 places, 190 transitions, 2430 flow [2024-06-28 01:37:46,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2430, PETRI_PLACES=149, PETRI_TRANSITIONS=190} [2024-06-28 01:37:46,906 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places. [2024-06-28 01:37:46,906 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 190 transitions, 2430 flow [2024-06-28 01:37:46,906 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-28 01:37:46,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:46,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:46,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:37:46,914 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:46,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1147449262, now seen corresponding path program 2 times [2024-06-28 01:37:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755647852] [2024-06-28 01:37:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:47,520 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-28 01:37:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755647852] [2024-06-28 01:37:47,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755647852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:47,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:47,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:47,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158031037] [2024-06-28 01:37:47,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:47,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:47,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:47,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:47,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:47,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:47,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 190 transitions, 2430 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:47,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:47,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:47,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:48,029 INFO L124 PetriNetUnfolderBase]: 1187/2222 cut-off events. [2024-06-28 01:37:48,030 INFO L125 PetriNetUnfolderBase]: For 23514/23514 co-relation queries the response was YES. [2024-06-28 01:37:48,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12128 conditions, 2222 events. 1187/2222 cut-off events. For 23514/23514 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13932 event pairs, 182 based on Foata normal form. 1/2151 useless extension candidates. Maximal degree in co-relation 12058. Up to 1295 conditions per place. [2024-06-28 01:37:48,047 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 114 selfloop transitions, 117 changer transitions 0/238 dead transitions. [2024-06-28 01:37:48,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 238 transitions, 3189 flow [2024-06-28 01:37:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 01:37:48,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-06-28 01:37:48,049 INFO L175 Difference]: Start difference. First operand has 149 places, 190 transitions, 2430 flow. Second operand 8 states and 154 transitions. [2024-06-28 01:37:48,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 238 transitions, 3189 flow [2024-06-28 01:37:48,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 238 transitions, 3115 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:37:48,104 INFO L231 Difference]: Finished difference. Result has 153 places, 201 transitions, 2753 flow [2024-06-28 01:37:48,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2356, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2753, PETRI_PLACES=153, PETRI_TRANSITIONS=201} [2024-06-28 01:37:48,104 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 112 predicate places. [2024-06-28 01:37:48,104 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 201 transitions, 2753 flow [2024-06-28 01:37:48,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:48,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:48,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:48,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:37:48,105 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:48,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1147627078, now seen corresponding path program 1 times [2024-06-28 01:37:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:48,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319286784] [2024-06-28 01:37:48,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:48,621 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-28 01:37:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319286784] [2024-06-28 01:37:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319286784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:48,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:48,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890069595] [2024-06-28 01:37:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:48,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:48,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:48,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:48,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:48,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:48,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 201 transitions, 2753 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:48,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:48,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:48,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:49,107 INFO L124 PetriNetUnfolderBase]: 1298/2473 cut-off events. [2024-06-28 01:37:49,108 INFO L125 PetriNetUnfolderBase]: For 30614/30614 co-relation queries the response was YES. [2024-06-28 01:37:49,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13689 conditions, 2473 events. 1298/2473 cut-off events. For 30614/30614 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16009 event pairs, 286 based on Foata normal form. 3/2384 useless extension candidates. Maximal degree in co-relation 13617. Up to 1199 conditions per place. [2024-06-28 01:37:49,127 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 161 selfloop transitions, 81 changer transitions 0/249 dead transitions. [2024-06-28 01:37:49,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 249 transitions, 3623 flow [2024-06-28 01:37:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-28 01:37:49,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2024-06-28 01:37:49,129 INFO L175 Difference]: Start difference. First operand has 153 places, 201 transitions, 2753 flow. Second operand 8 states and 158 transitions. [2024-06-28 01:37:49,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 249 transitions, 3623 flow [2024-06-28 01:37:49,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 249 transitions, 3587 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-28 01:37:49,195 INFO L231 Difference]: Finished difference. Result has 159 places, 207 transitions, 2937 flow [2024-06-28 01:37:49,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2717, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2937, PETRI_PLACES=159, PETRI_TRANSITIONS=207} [2024-06-28 01:37:49,195 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 118 predicate places. [2024-06-28 01:37:49,196 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 207 transitions, 2937 flow [2024-06-28 01:37:49,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:49,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:49,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:49,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:37:49,196 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:49,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2003528642, now seen corresponding path program 3 times [2024-06-28 01:37:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:49,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690120316] [2024-06-28 01:37:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690120316] [2024-06-28 01:37:49,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690120316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479428232] [2024-06-28 01:37:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:49,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:49,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:49,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 207 transitions, 2937 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:49,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:49,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:49,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:50,322 INFO L124 PetriNetUnfolderBase]: 1309/2564 cut-off events. [2024-06-28 01:37:50,335 INFO L125 PetriNetUnfolderBase]: For 32284/32284 co-relation queries the response was YES. [2024-06-28 01:37:50,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14330 conditions, 2564 events. 1309/2564 cut-off events. For 32284/32284 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17166 event pairs, 295 based on Foata normal form. 1/2452 useless extension candidates. Maximal degree in co-relation 14256. Up to 1654 conditions per place. [2024-06-28 01:37:50,357 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 138 selfloop transitions, 98 changer transitions 0/243 dead transitions. [2024-06-28 01:37:50,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 243 transitions, 3575 flow [2024-06-28 01:37:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:37:50,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2024-06-28 01:37:50,359 INFO L175 Difference]: Start difference. First operand has 159 places, 207 transitions, 2937 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:37:50,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 243 transitions, 3575 flow [2024-06-28 01:37:50,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 243 transitions, 3497 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 01:37:50,429 INFO L231 Difference]: Finished difference. Result has 164 places, 209 transitions, 3087 flow [2024-06-28 01:37:50,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3087, PETRI_PLACES=164, PETRI_TRANSITIONS=209} [2024-06-28 01:37:50,430 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places. [2024-06-28 01:37:50,430 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 209 transitions, 3087 flow [2024-06-28 01:37:50,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:50,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:50,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:50,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:37:50,430 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:50,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1147633588, now seen corresponding path program 2 times [2024-06-28 01:37:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:50,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231454118] [2024-06-28 01:37:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:50,941 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-28 01:37:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231454118] [2024-06-28 01:37:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231454118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808361306] [2024-06-28 01:37:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:50,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:50,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:50,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 209 transitions, 3087 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:50,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:50,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:50,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:51,479 INFO L124 PetriNetUnfolderBase]: 1303/2489 cut-off events. [2024-06-28 01:37:51,480 INFO L125 PetriNetUnfolderBase]: For 35041/35041 co-relation queries the response was YES. [2024-06-28 01:37:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14243 conditions, 2489 events. 1303/2489 cut-off events. For 35041/35041 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16188 event pairs, 274 based on Foata normal form. 3/2398 useless extension candidates. Maximal degree in co-relation 14168. Up to 1212 conditions per place. [2024-06-28 01:37:51,499 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 150 selfloop transitions, 89 changer transitions 0/246 dead transitions. [2024-06-28 01:37:51,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 246 transitions, 3832 flow [2024-06-28 01:37:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 01:37:51,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-06-28 01:37:51,500 INFO L175 Difference]: Start difference. First operand has 164 places, 209 transitions, 3087 flow. Second operand 8 states and 154 transitions. [2024-06-28 01:37:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 246 transitions, 3832 flow [2024-06-28 01:37:51,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 246 transitions, 3636 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:51,565 INFO L231 Difference]: Finished difference. Result has 166 places, 209 transitions, 3075 flow [2024-06-28 01:37:51,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3075, PETRI_PLACES=166, PETRI_TRANSITIONS=209} [2024-06-28 01:37:51,565 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places. [2024-06-28 01:37:51,565 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 209 transitions, 3075 flow [2024-06-28 01:37:51,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:51,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:51,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:51,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:37:51,566 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:51,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2003355662, now seen corresponding path program 4 times [2024-06-28 01:37:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:51,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061489033] [2024-06-28 01:37:51,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:37:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061489033] [2024-06-28 01:37:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061489033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20105509] [2024-06-28 01:37:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:52,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:52,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:52,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:52,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:52,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 209 transitions, 3075 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:52,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:52,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:52,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:52,782 INFO L124 PetriNetUnfolderBase]: 1314/2545 cut-off events. [2024-06-28 01:37:52,782 INFO L125 PetriNetUnfolderBase]: For 35230/35230 co-relation queries the response was YES. [2024-06-28 01:37:52,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14518 conditions, 2545 events. 1314/2545 cut-off events. For 35230/35230 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16804 event pairs, 305 based on Foata normal form. 1/2442 useless extension candidates. Maximal degree in co-relation 14442. Up to 1662 conditions per place. [2024-06-28 01:37:52,799 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 147 selfloop transitions, 88 changer transitions 0/242 dead transitions. [2024-06-28 01:37:52,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 242 transitions, 3701 flow [2024-06-28 01:37:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:37:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:37:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 01:37:52,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2024-06-28 01:37:52,801 INFO L175 Difference]: Start difference. First operand has 166 places, 209 transitions, 3075 flow. Second operand 8 states and 143 transitions. [2024-06-28 01:37:52,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 242 transitions, 3701 flow [2024-06-28 01:37:52,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 242 transitions, 3530 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:52,870 INFO L231 Difference]: Finished difference. Result has 168 places, 211 transitions, 3116 flow [2024-06-28 01:37:52,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2904, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3116, PETRI_PLACES=168, PETRI_TRANSITIONS=211} [2024-06-28 01:37:52,870 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2024-06-28 01:37:52,871 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 211 transitions, 3116 flow [2024-06-28 01:37:52,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:52,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:52,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:52,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:37:52,871 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:52,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2003528456, now seen corresponding path program 3 times [2024-06-28 01:37:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:52,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975208883] [2024-06-28 01:37:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:53,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-28 01:37:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975208883] [2024-06-28 01:37:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975208883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:53,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441823965] [2024-06-28 01:37:53,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:53,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:53,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:53,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:53,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:53,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 211 transitions, 3116 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:53,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:53,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:53,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:54,111 INFO L124 PetriNetUnfolderBase]: 1479/2760 cut-off events. [2024-06-28 01:37:54,112 INFO L125 PetriNetUnfolderBase]: For 38137/38137 co-relation queries the response was YES. [2024-06-28 01:37:54,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15321 conditions, 2760 events. 1479/2760 cut-off events. For 38137/38137 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 18129 event pairs, 367 based on Foata normal form. 3/2669 useless extension candidates. Maximal degree in co-relation 15244. Up to 1629 conditions per place. [2024-06-28 01:37:54,133 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 172 selfloop transitions, 79 changer transitions 0/258 dead transitions. [2024-06-28 01:37:54,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 258 transitions, 3911 flow [2024-06-28 01:37:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:37:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:37:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-28 01:37:54,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894894894894895 [2024-06-28 01:37:54,134 INFO L175 Difference]: Start difference. First operand has 168 places, 211 transitions, 3116 flow. Second operand 9 states and 163 transitions. [2024-06-28 01:37:54,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 258 transitions, 3911 flow [2024-06-28 01:37:54,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 258 transitions, 3733 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:54,255 INFO L231 Difference]: Finished difference. Result has 173 places, 220 transitions, 3266 flow [2024-06-28 01:37:54,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2938, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3266, PETRI_PLACES=173, PETRI_TRANSITIONS=220} [2024-06-28 01:37:54,256 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2024-06-28 01:37:54,256 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 220 transitions, 3266 flow [2024-06-28 01:37:54,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:54,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:54,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:54,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:37:54,257 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:54,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1673265300, now seen corresponding path program 1 times [2024-06-28 01:37:54,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:54,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550651534] [2024-06-28 01:37:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:54,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:54,970 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-28 01:37:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:54,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550651534] [2024-06-28 01:37:54,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550651534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:54,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:54,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:37:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315604064] [2024-06-28 01:37:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:54,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:37:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:37:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:37:55,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:55,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 220 transitions, 3266 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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-28 01:37:55,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:55,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:55,644 INFO L124 PetriNetUnfolderBase]: 1481/2759 cut-off events. [2024-06-28 01:37:55,644 INFO L125 PetriNetUnfolderBase]: For 40000/40000 co-relation queries the response was YES. [2024-06-28 01:37:55,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15886 conditions, 2759 events. 1481/2759 cut-off events. For 40000/40000 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18154 event pairs, 400 based on Foata normal form. 2/2668 useless extension candidates. Maximal degree in co-relation 15806. Up to 2281 conditions per place. [2024-06-28 01:37:55,668 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 224 selfloop transitions, 23 changer transitions 0/254 dead transitions. [2024-06-28 01:37:55,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 254 transitions, 3884 flow [2024-06-28 01:37:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:37:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:37:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 01:37:55,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:37:55,674 INFO L175 Difference]: Start difference. First operand has 173 places, 220 transitions, 3266 flow. Second operand 9 states and 153 transitions. [2024-06-28 01:37:55,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 254 transitions, 3884 flow [2024-06-28 01:37:55,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 254 transitions, 3805 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 01:37:55,775 INFO L231 Difference]: Finished difference. Result has 178 places, 224 transitions, 3280 flow [2024-06-28 01:37:55,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3187, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3280, PETRI_PLACES=178, PETRI_TRANSITIONS=224} [2024-06-28 01:37:55,776 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 137 predicate places. [2024-06-28 01:37:55,776 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 224 transitions, 3280 flow [2024-06-28 01:37:55,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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-28 01:37:55,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:55,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:55,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:37:55,777 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:55,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:55,778 INFO L85 PathProgramCache]: Analyzing trace with hash 175326528, now seen corresponding path program 4 times [2024-06-28 01:37:55,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:55,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504751550] [2024-06-28 01:37:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:55,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:56,425 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-28 01:37:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504751550] [2024-06-28 01:37:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504751550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:56,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945410955] [2024-06-28 01:37:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:56,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:56,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:56,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:56,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:56,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 224 transitions, 3280 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:56,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:56,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:56,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:57,064 INFO L124 PetriNetUnfolderBase]: 1553/2924 cut-off events. [2024-06-28 01:37:57,065 INFO L125 PetriNetUnfolderBase]: For 44669/44669 co-relation queries the response was YES. [2024-06-28 01:37:57,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16541 conditions, 2924 events. 1553/2924 cut-off events. For 44669/44669 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19631 event pairs, 445 based on Foata normal form. 3/2822 useless extension candidates. Maximal degree in co-relation 16459. Up to 2214 conditions per place. [2024-06-28 01:37:57,091 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 220 selfloop transitions, 34 changer transitions 0/261 dead transitions. [2024-06-28 01:37:57,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 261 transitions, 4097 flow [2024-06-28 01:37:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:37:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:37:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-28 01:37:57,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2024-06-28 01:37:57,093 INFO L175 Difference]: Start difference. First operand has 178 places, 224 transitions, 3280 flow. Second operand 9 states and 156 transitions. [2024-06-28 01:37:57,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 261 transitions, 4097 flow [2024-06-28 01:37:57,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 261 transitions, 4042 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:57,209 INFO L231 Difference]: Finished difference. Result has 181 places, 228 transitions, 3338 flow [2024-06-28 01:37:57,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3225, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3338, PETRI_PLACES=181, PETRI_TRANSITIONS=228} [2024-06-28 01:37:57,209 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places. [2024-06-28 01:37:57,210 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 228 transitions, 3338 flow [2024-06-28 01:37:57,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:57,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:57,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:57,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:37:57,210 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:57,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1673591048, now seen corresponding path program 5 times [2024-06-28 01:37:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:57,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383839483] [2024-06-28 01:37:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:57,736 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-28 01:37:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383839483] [2024-06-28 01:37:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383839483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:57,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615068883] [2024-06-28 01:37:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:57,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:57,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:57,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 228 transitions, 3338 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:57,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:57,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:57,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:58,413 INFO L124 PetriNetUnfolderBase]: 1547/2883 cut-off events. [2024-06-28 01:37:58,414 INFO L125 PetriNetUnfolderBase]: For 44204/44204 co-relation queries the response was YES. [2024-06-28 01:37:58,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16459 conditions, 2883 events. 1547/2883 cut-off events. For 44204/44204 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19157 event pairs, 443 based on Foata normal form. 3/2789 useless extension candidates. Maximal degree in co-relation 16376. Up to 2371 conditions per place. [2024-06-28 01:37:58,439 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 227 selfloop transitions, 19 changer transitions 0/253 dead transitions. [2024-06-28 01:37:58,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 253 transitions, 3920 flow [2024-06-28 01:37:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:37:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:37:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 01:37:58,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44144144144144143 [2024-06-28 01:37:58,441 INFO L175 Difference]: Start difference. First operand has 181 places, 228 transitions, 3338 flow. Second operand 9 states and 147 transitions. [2024-06-28 01:37:58,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 253 transitions, 3920 flow [2024-06-28 01:37:58,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 253 transitions, 3831 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 01:37:58,576 INFO L231 Difference]: Finished difference. Result has 184 places, 228 transitions, 3292 flow [2024-06-28 01:37:58,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3249, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3292, PETRI_PLACES=184, PETRI_TRANSITIONS=228} [2024-06-28 01:37:58,577 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2024-06-28 01:37:58,577 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 228 transitions, 3292 flow [2024-06-28 01:37:58,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:58,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:58,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:58,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:37:58,578 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:58,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1682765498, now seen corresponding path program 6 times [2024-06-28 01:37:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:58,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717575658] [2024-06-28 01:37:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:59,119 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-28 01:37:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717575658] [2024-06-28 01:37:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717575658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:59,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:37:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206330826] [2024-06-28 01:37:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:59,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:37:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:37:59,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:37:59,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:37:59,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 228 transitions, 3292 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:59,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:59,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:37:59,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:59,837 INFO L124 PetriNetUnfolderBase]: 1541/2910 cut-off events. [2024-06-28 01:37:59,837 INFO L125 PetriNetUnfolderBase]: For 42075/42075 co-relation queries the response was YES. [2024-06-28 01:37:59,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16243 conditions, 2910 events. 1541/2910 cut-off events. For 42075/42075 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19607 event pairs, 418 based on Foata normal form. 3/2805 useless extension candidates. Maximal degree in co-relation 16159. Up to 2206 conditions per place. [2024-06-28 01:37:59,860 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 220 selfloop transitions, 34 changer transitions 0/261 dead transitions. [2024-06-28 01:37:59,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 261 transitions, 3938 flow [2024-06-28 01:37:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:37:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:37:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 01:37:59,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:37:59,862 INFO L175 Difference]: Start difference. First operand has 184 places, 228 transitions, 3292 flow. Second operand 9 states and 153 transitions. [2024-06-28 01:37:59,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 261 transitions, 3938 flow [2024-06-28 01:37:59,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 261 transitions, 3883 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:37:59,977 INFO L231 Difference]: Finished difference. Result has 185 places, 228 transitions, 3313 flow [2024-06-28 01:37:59,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3237, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3313, PETRI_PLACES=185, PETRI_TRANSITIONS=228} [2024-06-28 01:37:59,978 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-28 01:37:59,978 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 228 transitions, 3313 flow [2024-06-28 01:37:59,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:59,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:59,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:59,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:37:59,978 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:37:59,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1682765684, now seen corresponding path program 5 times [2024-06-28 01:37:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050895384] [2024-06-28 01:37:59,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:00,575 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-28 01:38:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050895384] [2024-06-28 01:38:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050895384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:38:00,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430840520] [2024-06-28 01:38:00,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:00,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:38:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:38:00,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:38:00,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:00,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 228 transitions, 3313 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:00,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:00,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:00,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:01,172 INFO L124 PetriNetUnfolderBase]: 1539/2889 cut-off events. [2024-06-28 01:38:01,172 INFO L125 PetriNetUnfolderBase]: For 41150/41150 co-relation queries the response was YES. [2024-06-28 01:38:01,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16316 conditions, 2889 events. 1539/2889 cut-off events. For 41150/41150 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19313 event pairs, 454 based on Foata normal form. 1/2788 useless extension candidates. Maximal degree in co-relation 16231. Up to 2390 conditions per place. [2024-06-28 01:38:01,198 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 220 selfloop transitions, 26 changer transitions 0/253 dead transitions. [2024-06-28 01:38:01,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 253 transitions, 3911 flow [2024-06-28 01:38:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:38:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:38:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 01:38:01,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-28 01:38:01,200 INFO L175 Difference]: Start difference. First operand has 185 places, 228 transitions, 3313 flow. Second operand 8 states and 134 transitions. [2024-06-28 01:38:01,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 253 transitions, 3911 flow [2024-06-28 01:38:01,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 253 transitions, 3830 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 01:38:01,331 INFO L231 Difference]: Finished difference. Result has 185 places, 228 transitions, 3292 flow [2024-06-28 01:38:01,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3232, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3292, PETRI_PLACES=185, PETRI_TRANSITIONS=228} [2024-06-28 01:38:01,331 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-28 01:38:01,331 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 228 transitions, 3292 flow [2024-06-28 01:38:01,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:01,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:01,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:01,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:38:01,332 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:01,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash 440919570, now seen corresponding path program 7 times [2024-06-28 01:38:01,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:01,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512218139] [2024-06-28 01:38:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:01,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-28 01:38:01,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512218139] [2024-06-28 01:38:01,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512218139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:01,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:01,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:38:01,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426855932] [2024-06-28 01:38:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:01,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:38:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:38:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:38:01,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:01,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 228 transitions, 3292 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:01,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:01,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:01,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:02,689 INFO L124 PetriNetUnfolderBase]: 1890/3583 cut-off events. [2024-06-28 01:38:02,690 INFO L125 PetriNetUnfolderBase]: For 43250/43250 co-relation queries the response was YES. [2024-06-28 01:38:02,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18589 conditions, 3583 events. 1890/3583 cut-off events. For 43250/43250 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25255 event pairs, 373 based on Foata normal form. 3/3443 useless extension candidates. Maximal degree in co-relation 18503. Up to 1980 conditions per place. [2024-06-28 01:38:02,723 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 208 selfloop transitions, 110 changer transitions 0/325 dead transitions. [2024-06-28 01:38:02,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 325 transitions, 4767 flow [2024-06-28 01:38:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-28 01:38:02,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2024-06-28 01:38:02,724 INFO L175 Difference]: Start difference. First operand has 185 places, 228 transitions, 3292 flow. Second operand 9 states and 174 transitions. [2024-06-28 01:38:02,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 325 transitions, 4767 flow [2024-06-28 01:38:02,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 325 transitions, 4705 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 01:38:02,859 INFO L231 Difference]: Finished difference. Result has 190 places, 271 transitions, 3955 flow [2024-06-28 01:38:02,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3232, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3955, PETRI_PLACES=190, PETRI_TRANSITIONS=271} [2024-06-28 01:38:02,859 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places. [2024-06-28 01:38:02,859 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 271 transitions, 3955 flow [2024-06-28 01:38:02,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:02,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:02,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:02,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:38:02,860 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:02,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1673253427, now seen corresponding path program 1 times [2024-06-28 01:38:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772574938] [2024-06-28 01:38:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:03,929 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-28 01:38:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772574938] [2024-06-28 01:38:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772574938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:03,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:03,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738472445] [2024-06-28 01:38:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:03,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:03,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:04,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:04,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 271 transitions, 3955 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:04,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:04,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:04,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:04,802 INFO L124 PetriNetUnfolderBase]: 1887/3416 cut-off events. [2024-06-28 01:38:04,802 INFO L125 PetriNetUnfolderBase]: For 47450/47450 co-relation queries the response was YES. [2024-06-28 01:38:04,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 3416 events. 1887/3416 cut-off events. For 47450/47450 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23140 event pairs, 563 based on Foata normal form. 2/3321 useless extension candidates. Maximal degree in co-relation 20081. Up to 2924 conditions per place. [2024-06-28 01:38:04,837 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 272 selfloop transitions, 22 changer transitions 0/301 dead transitions. [2024-06-28 01:38:04,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 301 transitions, 4653 flow [2024-06-28 01:38:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 01:38:04,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-06-28 01:38:04,838 INFO L175 Difference]: Start difference. First operand has 190 places, 271 transitions, 3955 flow. Second operand 9 states and 151 transitions. [2024-06-28 01:38:04,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 301 transitions, 4653 flow [2024-06-28 01:38:04,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 301 transitions, 4420 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 01:38:04,986 INFO L231 Difference]: Finished difference. Result has 193 places, 271 transitions, 3770 flow [2024-06-28 01:38:04,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3722, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3770, PETRI_PLACES=193, PETRI_TRANSITIONS=271} [2024-06-28 01:38:04,987 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 152 predicate places. [2024-06-28 01:38:04,987 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 271 transitions, 3770 flow [2024-06-28 01:38:04,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:04,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:04,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:04,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:38:04,988 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:04,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -862908327, now seen corresponding path program 1 times [2024-06-28 01:38:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448691434] [2024-06-28 01:38:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:05,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:05,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448691434] [2024-06-28 01:38:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448691434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:05,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:05,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:38:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706813087] [2024-06-28 01:38:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:05,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:38:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:05,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:38:05,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:38:05,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-28 01:38:05,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 271 transitions, 3770 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:05,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:05,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-28 01:38:05,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:05,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][295], [Black: 507#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 189#true, Black: 381#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 373#true, Black: 521#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 214#true, Black: 398#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 407#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 537#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 410#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 577#true, Black: 423#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 551#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L775true, 253#true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 227#true, 74#true, Black: 435#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 12#L762true, Black: 308#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 573#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 567#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 561#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 314#true, Black: 196#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 323#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 318#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1)), Black: 325#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 602#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 80#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 587#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 468#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 343#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 222#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 59#true, Black: 357#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 557#true, 149#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 230#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 5#L832true, Black: 232#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 486#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 494#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$w_buff1_used~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1)), Black: 369#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 248#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 402#true]) [2024-06-28 01:38:05,533 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-28 01:38:05,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-28 01:38:05,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-28 01:38:05,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-28 01:38:05,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][335], [Black: 507#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 189#true, Black: 381#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 373#true, Black: 521#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 214#true, Black: 398#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 407#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 537#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 410#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 577#true, Black: 423#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 551#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L775true, 253#true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 227#true, 609#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#true, Black: 435#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 12#L762true, Black: 308#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 573#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 567#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 561#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 314#true, Black: 196#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 323#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 318#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1)), Black: 325#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 80#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 587#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 468#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 343#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 222#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 59#true, 29#L18-1true, Black: 357#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 557#true, 149#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 230#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 232#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 486#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 494#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$w_buff1_used~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1)), Black: 369#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 248#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 402#true]) [2024-06-28 01:38:05,610 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-06-28 01:38:05,610 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-28 01:38:05,611 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-28 01:38:05,611 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-28 01:38:05,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][335], [Black: 507#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 189#true, Black: 381#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 373#true, Black: 521#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 214#true, Black: 398#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 407#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 537#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 410#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 577#true, 6#L18-5true, Black: 423#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 551#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L775true, 253#true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 227#true, 609#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#true, Black: 435#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 12#L762true, Black: 308#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 573#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 567#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 561#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 314#true, Black: 196#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 323#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 318#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1)), Black: 325#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 80#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 587#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 468#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 343#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 222#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 59#true, Black: 357#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 557#true, 149#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 230#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 232#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 486#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 494#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$w_buff1_used~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1)), Black: 369#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 248#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 402#true]) [2024-06-28 01:38:05,660 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-28 01:38:05,660 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:38:05,660 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:38:05,660 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:38:05,705 INFO L124 PetriNetUnfolderBase]: 2280/3963 cut-off events. [2024-06-28 01:38:05,706 INFO L125 PetriNetUnfolderBase]: For 37563/39265 co-relation queries the response was YES. [2024-06-28 01:38:05,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21006 conditions, 3963 events. 2280/3963 cut-off events. For 37563/39265 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 26039 event pairs, 300 based on Foata normal form. 492/4237 useless extension candidates. Maximal degree in co-relation 20916. Up to 1807 conditions per place. [2024-06-28 01:38:05,743 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 191 selfloop transitions, 44 changer transitions 141/501 dead transitions. [2024-06-28 01:38:05,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 501 transitions, 7617 flow [2024-06-28 01:38:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:38:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:38:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-28 01:38:05,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-28 01:38:05,745 INFO L175 Difference]: Start difference. First operand has 193 places, 271 transitions, 3770 flow. Second operand 8 states and 178 transitions. [2024-06-28 01:38:05,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 501 transitions, 7617 flow [2024-06-28 01:38:05,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 501 transitions, 7494 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-28 01:38:05,872 INFO L231 Difference]: Finished difference. Result has 198 places, 274 transitions, 3905 flow [2024-06-28 01:38:05,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3712, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3905, PETRI_PLACES=198, PETRI_TRANSITIONS=274} [2024-06-28 01:38:05,873 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places. [2024-06-28 01:38:05,873 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 274 transitions, 3905 flow [2024-06-28 01:38:05,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:05,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:05,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:05,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:38:05,874 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:05,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash 809599707, now seen corresponding path program 1 times [2024-06-28 01:38:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:05,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647636724] [2024-06-28 01:38:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:06,737 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-28 01:38:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647636724] [2024-06-28 01:38:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647636724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:06,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545946171] [2024-06-28 01:38:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:06,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:06,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:06,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 274 transitions, 3905 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:06,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:06,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:06,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:07,563 INFO L124 PetriNetUnfolderBase]: 1871/3472 cut-off events. [2024-06-28 01:38:07,564 INFO L125 PetriNetUnfolderBase]: For 44209/44246 co-relation queries the response was YES. [2024-06-28 01:38:07,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20907 conditions, 3472 events. 1871/3472 cut-off events. For 44209/44246 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23671 event pairs, 408 based on Foata normal form. 39/3486 useless extension candidates. Maximal degree in co-relation 20812. Up to 2542 conditions per place. [2024-06-28 01:38:07,599 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 211 selfloop transitions, 88 changer transitions 7/314 dead transitions. [2024-06-28 01:38:07,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 314 transitions, 4755 flow [2024-06-28 01:38:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:38:07,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804804804804805 [2024-06-28 01:38:07,601 INFO L175 Difference]: Start difference. First operand has 198 places, 274 transitions, 3905 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:38:07,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 314 transitions, 4755 flow [2024-06-28 01:38:07,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 314 transitions, 4751 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:38:07,787 INFO L231 Difference]: Finished difference. Result has 204 places, 275 transitions, 4110 flow [2024-06-28 01:38:07,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3901, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4110, PETRI_PLACES=204, PETRI_TRANSITIONS=275} [2024-06-28 01:38:07,787 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 163 predicate places. [2024-06-28 01:38:07,787 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 275 transitions, 4110 flow [2024-06-28 01:38:07,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:07,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:07,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:07,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:38:07,788 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:07,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1843561267, now seen corresponding path program 2 times [2024-06-28 01:38:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626598818] [2024-06-28 01:38:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:08,427 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-28 01:38:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626598818] [2024-06-28 01:38:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626598818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:08,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745359373] [2024-06-28 01:38:08,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:08,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:08,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:08,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:08,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:08,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 275 transitions, 4110 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:08,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:08,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:08,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:09,138 INFO L124 PetriNetUnfolderBase]: 1758/3220 cut-off events. [2024-06-28 01:38:09,138 INFO L125 PetriNetUnfolderBase]: For 44211/44260 co-relation queries the response was YES. [2024-06-28 01:38:09,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19507 conditions, 3220 events. 1758/3220 cut-off events. For 44211/44260 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21237 event pairs, 320 based on Foata normal form. 51/3249 useless extension candidates. Maximal degree in co-relation 19409. Up to 2086 conditions per place. [2024-06-28 01:38:09,172 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 217 selfloop transitions, 90 changer transitions 0/315 dead transitions. [2024-06-28 01:38:09,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 315 transitions, 5021 flow [2024-06-28 01:38:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-28 01:38:09,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-06-28 01:38:09,173 INFO L175 Difference]: Start difference. First operand has 204 places, 275 transitions, 4110 flow. Second operand 9 states and 161 transitions. [2024-06-28 01:38:09,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 315 transitions, 5021 flow [2024-06-28 01:38:09,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 315 transitions, 4754 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-28 01:38:09,335 INFO L231 Difference]: Finished difference. Result has 205 places, 279 transitions, 4087 flow [2024-06-28 01:38:09,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3847, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4087, PETRI_PLACES=205, PETRI_TRANSITIONS=279} [2024-06-28 01:38:09,335 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 164 predicate places. [2024-06-28 01:38:09,335 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 279 transitions, 4087 flow [2024-06-28 01:38:09,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:09,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:09,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:09,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:38:09,336 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:09,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1845435217, now seen corresponding path program 3 times [2024-06-28 01:38:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:09,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040173984] [2024-06-28 01:38:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:09,987 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-28 01:38:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040173984] [2024-06-28 01:38:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040173984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:09,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030266490] [2024-06-28 01:38:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:09,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:09,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:10,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:10,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 279 transitions, 4087 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:10,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:10,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:10,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:10,800 INFO L124 PetriNetUnfolderBase]: 1787/3258 cut-off events. [2024-06-28 01:38:10,801 INFO L125 PetriNetUnfolderBase]: For 46269/46334 co-relation queries the response was YES. [2024-06-28 01:38:10,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19612 conditions, 3258 events. 1787/3258 cut-off events. For 46269/46334 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 21457 event pairs, 332 based on Foata normal form. 67/3225 useless extension candidates. Maximal degree in co-relation 19514. Up to 2248 conditions per place. [2024-06-28 01:38:10,838 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 210 selfloop transitions, 103 changer transitions 0/321 dead transitions. [2024-06-28 01:38:10,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 321 transitions, 5038 flow [2024-06-28 01:38:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:38:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:38:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:38:10,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-28 01:38:10,839 INFO L175 Difference]: Start difference. First operand has 205 places, 279 transitions, 4087 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:38:10,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 321 transitions, 5038 flow [2024-06-28 01:38:11,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 321 transitions, 4896 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:38:11,013 INFO L231 Difference]: Finished difference. Result has 212 places, 282 transitions, 4203 flow [2024-06-28 01:38:11,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3953, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4203, PETRI_PLACES=212, PETRI_TRANSITIONS=282} [2024-06-28 01:38:11,014 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 171 predicate places. [2024-06-28 01:38:11,014 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 282 transitions, 4203 flow [2024-06-28 01:38:11,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:11,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:11,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:11,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:38:11,015 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:11,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1262622835, now seen corresponding path program 4 times [2024-06-28 01:38:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764030820] [2024-06-28 01:38:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764030820] [2024-06-28 01:38:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764030820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263681201] [2024-06-28 01:38:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:11,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:11,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:11,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 282 transitions, 4203 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:11,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:11,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:11,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:12,312 INFO L124 PetriNetUnfolderBase]: 1811/3312 cut-off events. [2024-06-28 01:38:12,312 INFO L125 PetriNetUnfolderBase]: For 48482/48542 co-relation queries the response was YES. [2024-06-28 01:38:12,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20197 conditions, 3312 events. 1811/3312 cut-off events. For 48482/48542 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22011 event pairs, 370 based on Foata normal form. 62/3274 useless extension candidates. Maximal degree in co-relation 20096. Up to 2347 conditions per place. [2024-06-28 01:38:12,345 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 202 selfloop transitions, 111 changer transitions 0/321 dead transitions. [2024-06-28 01:38:12,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 321 transitions, 5085 flow [2024-06-28 01:38:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-28 01:38:12,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2024-06-28 01:38:12,346 INFO L175 Difference]: Start difference. First operand has 212 places, 282 transitions, 4203 flow. Second operand 9 states and 158 transitions. [2024-06-28 01:38:12,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 321 transitions, 5085 flow [2024-06-28 01:38:12,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 321 transitions, 4931 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 01:38:12,511 INFO L231 Difference]: Finished difference. Result has 215 places, 290 transitions, 4383 flow [2024-06-28 01:38:12,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4051, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4383, PETRI_PLACES=215, PETRI_TRANSITIONS=290} [2024-06-28 01:38:12,512 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places. [2024-06-28 01:38:12,512 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 290 transitions, 4383 flow [2024-06-28 01:38:12,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:12,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:12,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:12,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:38:12,513 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:12,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1845439092, now seen corresponding path program 1 times [2024-06-28 01:38:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:12,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514781689] [2024-06-28 01:38:12,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:12,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:13,162 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-28 01:38:13,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:13,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514781689] [2024-06-28 01:38:13,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514781689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:13,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916032324] [2024-06-28 01:38:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:13,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:13,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:13,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:13,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 290 transitions, 4383 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:13,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:13,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:13,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:14,136 INFO L124 PetriNetUnfolderBase]: 1873/3356 cut-off events. [2024-06-28 01:38:14,137 INFO L125 PetriNetUnfolderBase]: For 52673/52738 co-relation queries the response was YES. [2024-06-28 01:38:14,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20914 conditions, 3356 events. 1873/3356 cut-off events. For 52673/52738 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21944 event pairs, 393 based on Foata normal form. 68/3325 useless extension candidates. Maximal degree in co-relation 20811. Up to 1085 conditions per place. [2024-06-28 01:38:14,172 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 198 selfloop transitions, 150 changer transitions 0/356 dead transitions. [2024-06-28 01:38:14,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 356 transitions, 5553 flow [2024-06-28 01:38:14,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:38:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:38:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2024-06-28 01:38:14,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:38:14,174 INFO L175 Difference]: Start difference. First operand has 215 places, 290 transitions, 4383 flow. Second operand 12 states and 222 transitions. [2024-06-28 01:38:14,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 356 transitions, 5553 flow [2024-06-28 01:38:14,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 356 transitions, 5416 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-28 01:38:14,400 INFO L231 Difference]: Finished difference. Result has 224 places, 296 transitions, 4681 flow [2024-06-28 01:38:14,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4254, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4681, PETRI_PLACES=224, PETRI_TRANSITIONS=296} [2024-06-28 01:38:14,401 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 183 predicate places. [2024-06-28 01:38:14,401 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 296 transitions, 4681 flow [2024-06-28 01:38:14,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:14,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:14,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:14,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:38:14,402 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:14,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1932130747, now seen corresponding path program 5 times [2024-06-28 01:38:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730750953] [2024-06-28 01:38:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:15,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730750953] [2024-06-28 01:38:15,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730750953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:15,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:15,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202429794] [2024-06-28 01:38:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:15,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:15,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:15,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:15,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:15,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 296 transitions, 4681 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:15,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:15,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:15,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:15,880 INFO L124 PetriNetUnfolderBase]: 1870/3443 cut-off events. [2024-06-28 01:38:15,880 INFO L125 PetriNetUnfolderBase]: For 54521/54574 co-relation queries the response was YES. [2024-06-28 01:38:15,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22209 conditions, 3443 events. 1870/3443 cut-off events. For 54521/54574 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 23039 event pairs, 392 based on Foata normal form. 55/3387 useless extension candidates. Maximal degree in co-relation 22103. Up to 2590 conditions per place. [2024-06-28 01:38:15,922 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 231 selfloop transitions, 93 changer transitions 0/332 dead transitions. [2024-06-28 01:38:15,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 332 transitions, 5537 flow [2024-06-28 01:38:15,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:38:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:38:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-28 01:38:15,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:38:15,923 INFO L175 Difference]: Start difference. First operand has 224 places, 296 transitions, 4681 flow. Second operand 10 states and 170 transitions. [2024-06-28 01:38:15,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 332 transitions, 5537 flow [2024-06-28 01:38:16,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 332 transitions, 5355 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:16,227 INFO L231 Difference]: Finished difference. Result has 227 places, 296 transitions, 4691 flow [2024-06-28 01:38:16,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4499, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4691, PETRI_PLACES=227, PETRI_TRANSITIONS=296} [2024-06-28 01:38:16,228 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places. [2024-06-28 01:38:16,228 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 296 transitions, 4691 flow [2024-06-28 01:38:16,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:16,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:16,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:16,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:38:16,229 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:16,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1211186001, now seen corresponding path program 6 times [2024-06-28 01:38:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213799278] [2024-06-28 01:38:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213799278] [2024-06-28 01:38:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213799278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362920964] [2024-06-28 01:38:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:16,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:17,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:17,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 296 transitions, 4691 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:17,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:17,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:17,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:17,787 INFO L124 PetriNetUnfolderBase]: 1883/3442 cut-off events. [2024-06-28 01:38:17,787 INFO L125 PetriNetUnfolderBase]: For 53661/53719 co-relation queries the response was YES. [2024-06-28 01:38:17,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22395 conditions, 3442 events. 1883/3442 cut-off events. For 53661/53719 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23047 event pairs, 305 based on Foata normal form. 60/3397 useless extension candidates. Maximal degree in co-relation 22287. Up to 2465 conditions per place. [2024-06-28 01:38:17,831 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 222 selfloop transitions, 106 changer transitions 0/336 dead transitions. [2024-06-28 01:38:17,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 336 transitions, 5658 flow [2024-06-28 01:38:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-28 01:38:17,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2024-06-28 01:38:17,833 INFO L175 Difference]: Start difference. First operand has 227 places, 296 transitions, 4691 flow. Second operand 9 states and 166 transitions. [2024-06-28 01:38:17,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 336 transitions, 5658 flow [2024-06-28 01:38:18,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 336 transitions, 5484 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:18,122 INFO L231 Difference]: Finished difference. Result has 230 places, 298 transitions, 4762 flow [2024-06-28 01:38:18,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4517, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4762, PETRI_PLACES=230, PETRI_TRANSITIONS=298} [2024-06-28 01:38:18,123 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 189 predicate places. [2024-06-28 01:38:18,123 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 298 transitions, 4762 flow [2024-06-28 01:38:18,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:18,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:18,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:18,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:38:18,124 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:18,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1211189876, now seen corresponding path program 2 times [2024-06-28 01:38:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660271222] [2024-06-28 01:38:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:18,745 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-28 01:38:18,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660271222] [2024-06-28 01:38:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660271222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596056784] [2024-06-28 01:38:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:18,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:18,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:18,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 298 transitions, 4762 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:18,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:18,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:18,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:19,808 INFO L124 PetriNetUnfolderBase]: 1916/3432 cut-off events. [2024-06-28 01:38:19,809 INFO L125 PetriNetUnfolderBase]: For 56479/56539 co-relation queries the response was YES. [2024-06-28 01:38:19,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22701 conditions, 3432 events. 1916/3432 cut-off events. For 56479/56539 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22605 event pairs, 287 based on Foata normal form. 63/3390 useless extension candidates. Maximal degree in co-relation 22591. Up to 1281 conditions per place. [2024-06-28 01:38:19,858 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 197 selfloop transitions, 161 changer transitions 0/366 dead transitions. [2024-06-28 01:38:19,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 366 transitions, 5971 flow [2024-06-28 01:38:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:38:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:38:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-28 01:38:19,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-28 01:38:19,860 INFO L175 Difference]: Start difference. First operand has 230 places, 298 transitions, 4762 flow. Second operand 11 states and 213 transitions. [2024-06-28 01:38:19,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 366 transitions, 5971 flow [2024-06-28 01:38:20,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 366 transitions, 5695 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 01:38:20,183 INFO L231 Difference]: Finished difference. Result has 233 places, 301 transitions, 4849 flow [2024-06-28 01:38:20,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4486, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4849, PETRI_PLACES=233, PETRI_TRANSITIONS=301} [2024-06-28 01:38:20,183 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places. [2024-06-28 01:38:20,184 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 301 transitions, 4849 flow [2024-06-28 01:38:20,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:20,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:20,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:20,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:38:20,184 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:20,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1979988941, now seen corresponding path program 7 times [2024-06-28 01:38:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479638943] [2024-06-28 01:38:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:20,806 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-28 01:38:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479638943] [2024-06-28 01:38:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479638943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:20,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:20,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:20,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090074619] [2024-06-28 01:38:20,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:20,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:20,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:20,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:20,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:20,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 301 transitions, 4849 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:20,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:20,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:20,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:21,795 INFO L124 PetriNetUnfolderBase]: 1929/3526 cut-off events. [2024-06-28 01:38:21,796 INFO L125 PetriNetUnfolderBase]: For 58858/58920 co-relation queries the response was YES. [2024-06-28 01:38:21,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23340 conditions, 3526 events. 1929/3526 cut-off events. For 58858/58920 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23692 event pairs, 362 based on Foata normal form. 64/3482 useless extension candidates. Maximal degree in co-relation 23230. Up to 2623 conditions per place. [2024-06-28 01:38:21,850 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 228 selfloop transitions, 108 changer transitions 0/344 dead transitions. [2024-06-28 01:38:21,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 344 transitions, 5771 flow [2024-06-28 01:38:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:38:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:38:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:38:21,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-28 01:38:21,852 INFO L175 Difference]: Start difference. First operand has 233 places, 301 transitions, 4849 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:38:21,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 344 transitions, 5771 flow [2024-06-28 01:38:22,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 344 transitions, 5412 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-28 01:38:22,231 INFO L231 Difference]: Finished difference. Result has 234 places, 302 transitions, 4725 flow [2024-06-28 01:38:22,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4490, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4725, PETRI_PLACES=234, PETRI_TRANSITIONS=302} [2024-06-28 01:38:22,232 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places. [2024-06-28 01:38:22,232 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 302 transitions, 4725 flow [2024-06-28 01:38:22,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:22,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:22,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:22,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:38:22,233 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:22,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1974476676, now seen corresponding path program 3 times [2024-06-28 01:38:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592141674] [2024-06-28 01:38:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:22,843 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-28 01:38:22,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:22,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592141674] [2024-06-28 01:38:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592141674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482589282] [2024-06-28 01:38:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:22,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:22,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:22,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 302 transitions, 4725 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:22,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:22,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:22,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:23,666 INFO L124 PetriNetUnfolderBase]: 1962/3568 cut-off events. [2024-06-28 01:38:23,667 INFO L125 PetriNetUnfolderBase]: For 60518/60560 co-relation queries the response was YES. [2024-06-28 01:38:23,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22904 conditions, 3568 events. 1962/3568 cut-off events. For 60518/60560 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23978 event pairs, 371 based on Foata normal form. 45/3505 useless extension candidates. Maximal degree in co-relation 22793. Up to 1769 conditions per place. [2024-06-28 01:38:23,704 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 216 selfloop transitions, 135 changer transitions 0/359 dead transitions. [2024-06-28 01:38:23,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 359 transitions, 5776 flow [2024-06-28 01:38:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-28 01:38:23,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195195195195195 [2024-06-28 01:38:23,706 INFO L175 Difference]: Start difference. First operand has 234 places, 302 transitions, 4725 flow. Second operand 9 states and 173 transitions. [2024-06-28 01:38:23,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 359 transitions, 5776 flow [2024-06-28 01:38:23,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 359 transitions, 5559 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:38:23,977 INFO L231 Difference]: Finished difference. Result has 235 places, 305 transitions, 4823 flow [2024-06-28 01:38:23,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4823, PETRI_PLACES=235, PETRI_TRANSITIONS=305} [2024-06-28 01:38:23,978 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 194 predicate places. [2024-06-28 01:38:23,978 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 305 transitions, 4823 flow [2024-06-28 01:38:23,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:23,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:23,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:23,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:38:23,979 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:23,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1974482256, now seen corresponding path program 4 times [2024-06-28 01:38:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2566786] [2024-06-28 01:38:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:24,657 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-28 01:38:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2566786] [2024-06-28 01:38:24,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2566786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:24,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:24,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:24,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981667922] [2024-06-28 01:38:24,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:24,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:24,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:24,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:24,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 305 transitions, 4823 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:24,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:24,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:24,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:25,571 INFO L124 PetriNetUnfolderBase]: 2012/3651 cut-off events. [2024-06-28 01:38:25,571 INFO L125 PetriNetUnfolderBase]: For 65256/65298 co-relation queries the response was YES. [2024-06-28 01:38:25,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24042 conditions, 3651 events. 2012/3651 cut-off events. For 65256/65298 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24570 event pairs, 368 based on Foata normal form. 43/3584 useless extension candidates. Maximal degree in co-relation 23930. Up to 1728 conditions per place. [2024-06-28 01:38:25,617 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 221 selfloop transitions, 142 changer transitions 0/371 dead transitions. [2024-06-28 01:38:25,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 371 transitions, 6062 flow [2024-06-28 01:38:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:38:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:38:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 01:38:25,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-28 01:38:25,619 INFO L175 Difference]: Start difference. First operand has 235 places, 305 transitions, 4823 flow. Second operand 10 states and 193 transitions. [2024-06-28 01:38:25,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 371 transitions, 6062 flow [2024-06-28 01:38:25,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 371 transitions, 5790 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:25,948 INFO L231 Difference]: Finished difference. Result has 239 places, 310 transitions, 4929 flow [2024-06-28 01:38:25,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4551, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4929, PETRI_PLACES=239, PETRI_TRANSITIONS=310} [2024-06-28 01:38:25,949 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2024-06-28 01:38:25,949 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 310 transitions, 4929 flow [2024-06-28 01:38:25,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:25,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:25,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:25,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:38:25,950 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:25,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:25,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1599692945, now seen corresponding path program 8 times [2024-06-28 01:38:25,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:25,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116908392] [2024-06-28 01:38:25,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:26,626 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-28 01:38:26,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:26,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116908392] [2024-06-28 01:38:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116908392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:26,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:26,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448531014] [2024-06-28 01:38:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:26,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:26,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 310 transitions, 4929 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:26,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:26,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:26,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:27,522 INFO L124 PetriNetUnfolderBase]: 2025/3739 cut-off events. [2024-06-28 01:38:27,522 INFO L125 PetriNetUnfolderBase]: For 69081/69127 co-relation queries the response was YES. [2024-06-28 01:38:27,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24477 conditions, 3739 events. 2025/3739 cut-off events. For 69081/69127 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25562 event pairs, 432 based on Foata normal form. 48/3665 useless extension candidates. Maximal degree in co-relation 24363. Up to 2879 conditions per place. [2024-06-28 01:38:27,568 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 246 selfloop transitions, 89 changer transitions 0/343 dead transitions. [2024-06-28 01:38:27,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 343 transitions, 5797 flow [2024-06-28 01:38:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:38:27,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-28 01:38:27,569 INFO L175 Difference]: Start difference. First operand has 239 places, 310 transitions, 4929 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:38:27,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 343 transitions, 5797 flow [2024-06-28 01:38:27,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 343 transitions, 5626 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:38:27,973 INFO L231 Difference]: Finished difference. Result has 242 places, 311 transitions, 4956 flow [2024-06-28 01:38:27,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4758, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4956, PETRI_PLACES=242, PETRI_TRANSITIONS=311} [2024-06-28 01:38:27,974 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 201 predicate places. [2024-06-28 01:38:27,974 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 311 transitions, 4956 flow [2024-06-28 01:38:27,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:27,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:27,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:27,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:38:27,975 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:27,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1599485400, now seen corresponding path program 5 times [2024-06-28 01:38:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:27,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130695512] [2024-06-28 01:38:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130695512] [2024-06-28 01:38:28,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130695512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:28,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:28,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933442165] [2024-06-28 01:38:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:28,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:28,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:28,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:28,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:28,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:28,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 311 transitions, 4956 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:28,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:28,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:28,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:29,659 INFO L124 PetriNetUnfolderBase]: 2019/3638 cut-off events. [2024-06-28 01:38:29,659 INFO L125 PetriNetUnfolderBase]: For 65838/65881 co-relation queries the response was YES. [2024-06-28 01:38:29,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24308 conditions, 3638 events. 2019/3638 cut-off events. For 65838/65881 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24330 event pairs, 370 based on Foata normal form. 46/3582 useless extension candidates. Maximal degree in co-relation 24192. Up to 1860 conditions per place. [2024-06-28 01:38:29,703 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 206 selfloop transitions, 143 changer transitions 0/357 dead transitions. [2024-06-28 01:38:29,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 357 transitions, 5916 flow [2024-06-28 01:38:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 01:38:29,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-28 01:38:29,704 INFO L175 Difference]: Start difference. First operand has 242 places, 311 transitions, 4956 flow. Second operand 9 states and 169 transitions. [2024-06-28 01:38:29,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 357 transitions, 5916 flow [2024-06-28 01:38:30,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 357 transitions, 5722 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:30,103 INFO L231 Difference]: Finished difference. Result has 244 places, 311 transitions, 5058 flow [2024-06-28 01:38:30,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4762, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5058, PETRI_PLACES=244, PETRI_TRANSITIONS=311} [2024-06-28 01:38:30,104 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 203 predicate places. [2024-06-28 01:38:30,104 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 311 transitions, 5058 flow [2024-06-28 01:38:30,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:30,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:30,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:30,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:38:30,104 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:30,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash -331615843, now seen corresponding path program 1 times [2024-06-28 01:38:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544580611] [2024-06-28 01:38:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:30,800 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-28 01:38:30,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:30,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544580611] [2024-06-28 01:38:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544580611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:30,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304669473] [2024-06-28 01:38:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:30,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:30,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:30,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 311 transitions, 5058 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:30,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:30,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:30,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:31,752 INFO L124 PetriNetUnfolderBase]: 2021/3546 cut-off events. [2024-06-28 01:38:31,752 INFO L125 PetriNetUnfolderBase]: For 65424/65480 co-relation queries the response was YES. [2024-06-28 01:38:31,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24604 conditions, 3546 events. 2021/3546 cut-off events. For 65424/65480 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23105 event pairs, 570 based on Foata normal form. 58/3512 useless extension candidates. Maximal degree in co-relation 24487. Up to 3141 conditions per place. [2024-06-28 01:38:31,788 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 312 selfloop transitions, 23 changer transitions 0/343 dead transitions. [2024-06-28 01:38:31,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 343 transitions, 5876 flow [2024-06-28 01:38:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 01:38:31,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:38:31,790 INFO L175 Difference]: Start difference. First operand has 244 places, 311 transitions, 5058 flow. Second operand 9 states and 153 transitions. [2024-06-28 01:38:31,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 343 transitions, 5876 flow [2024-06-28 01:38:32,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 343 transitions, 5578 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:38:32,100 INFO L231 Difference]: Finished difference. Result has 245 places, 313 transitions, 4833 flow [2024-06-28 01:38:32,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4760, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4833, PETRI_PLACES=245, PETRI_TRANSITIONS=313} [2024-06-28 01:38:32,101 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2024-06-28 01:38:32,101 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 313 transitions, 4833 flow [2024-06-28 01:38:32,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:32,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:32,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:32,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:38:32,101 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:32,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:32,102 INFO L85 PathProgramCache]: Analyzing trace with hash -625920140, now seen corresponding path program 6 times [2024-06-28 01:38:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:32,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067440590] [2024-06-28 01:38:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:32,745 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-28 01:38:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067440590] [2024-06-28 01:38:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067440590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283612151] [2024-06-28 01:38:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:32,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:32,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:32,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:32,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:32,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 313 transitions, 4833 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:32,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:32,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:32,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:33,663 INFO L124 PetriNetUnfolderBase]: 2054/3718 cut-off events. [2024-06-28 01:38:33,664 INFO L125 PetriNetUnfolderBase]: For 65529/65583 co-relation queries the response was YES. [2024-06-28 01:38:33,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24334 conditions, 3718 events. 2054/3718 cut-off events. For 65529/65583 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 25123 event pairs, 547 based on Foata normal form. 57/3661 useless extension candidates. Maximal degree in co-relation 24216. Up to 2835 conditions per place. [2024-06-28 01:38:33,706 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 300 selfloop transitions, 54 changer transitions 0/362 dead transitions. [2024-06-28 01:38:33,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 362 transitions, 5844 flow [2024-06-28 01:38:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 01:38:33,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-28 01:38:33,708 INFO L175 Difference]: Start difference. First operand has 245 places, 313 transitions, 4833 flow. Second operand 9 states and 162 transitions. [2024-06-28 01:38:33,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 362 transitions, 5844 flow [2024-06-28 01:38:34,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 362 transitions, 5787 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:34,065 INFO L231 Difference]: Finished difference. Result has 247 places, 316 transitions, 4940 flow [2024-06-28 01:38:34,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4776, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4940, PETRI_PLACES=247, PETRI_TRANSITIONS=316} [2024-06-28 01:38:34,065 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 206 predicate places. [2024-06-28 01:38:34,065 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 316 transitions, 4940 flow [2024-06-28 01:38:34,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:34,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:34,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:34,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:38:34,066 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:34,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash -626127530, now seen corresponding path program 7 times [2024-06-28 01:38:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:34,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999663917] [2024-06-28 01:38:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:34,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:34,653 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-28 01:38:34,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:34,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999663917] [2024-06-28 01:38:34,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999663917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:34,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:34,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:34,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830422415] [2024-06-28 01:38:34,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:34,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:34,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:34,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:34,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:34,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:34,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 316 transitions, 4940 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:34,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:34,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:34,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:35,603 INFO L124 PetriNetUnfolderBase]: 2087/3732 cut-off events. [2024-06-28 01:38:35,604 INFO L125 PetriNetUnfolderBase]: For 67782/67835 co-relation queries the response was YES. [2024-06-28 01:38:35,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24894 conditions, 3732 events. 2087/3732 cut-off events. For 67782/67835 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 25035 event pairs, 510 based on Foata normal form. 56/3686 useless extension candidates. Maximal degree in co-relation 24775. Up to 2736 conditions per place. [2024-06-28 01:38:35,645 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 303 selfloop transitions, 63 changer transitions 0/374 dead transitions. [2024-06-28 01:38:35,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 374 transitions, 6145 flow [2024-06-28 01:38:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:38:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:38:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 01:38:35,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-06-28 01:38:35,646 INFO L175 Difference]: Start difference. First operand has 247 places, 316 transitions, 4940 flow. Second operand 10 states and 181 transitions. [2024-06-28 01:38:35,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 374 transitions, 6145 flow [2024-06-28 01:38:36,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 374 transitions, 6022 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:36,028 INFO L231 Difference]: Finished difference. Result has 250 places, 319 transitions, 5000 flow [2024-06-28 01:38:36,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4817, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5000, PETRI_PLACES=250, PETRI_TRANSITIONS=319} [2024-06-28 01:38:36,029 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places. [2024-06-28 01:38:36,029 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 319 transitions, 5000 flow [2024-06-28 01:38:36,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:36,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:36,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:38:36,029 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:36,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash -626127685, now seen corresponding path program 9 times [2024-06-28 01:38:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54627505] [2024-06-28 01:38:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:36,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:36,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54627505] [2024-06-28 01:38:36,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54627505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:36,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:36,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132899423] [2024-06-28 01:38:36,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:36,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:36,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:36,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:36,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:36,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 319 transitions, 5000 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:36,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:36,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:36,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:37,720 INFO L124 PetriNetUnfolderBase]: 2084/3693 cut-off events. [2024-06-28 01:38:37,721 INFO L125 PetriNetUnfolderBase]: For 64525/64580 co-relation queries the response was YES. [2024-06-28 01:38:37,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24775 conditions, 3693 events. 2084/3693 cut-off events. For 64525/64580 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 24432 event pairs, 609 based on Foata normal form. 57/3643 useless extension candidates. Maximal degree in co-relation 24655. Up to 3272 conditions per place. [2024-06-28 01:38:37,764 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 311 selfloop transitions, 27 changer transitions 0/346 dead transitions. [2024-06-28 01:38:37,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 346 transitions, 5828 flow [2024-06-28 01:38:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-28 01:38:37,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843843843843844 [2024-06-28 01:38:37,765 INFO L175 Difference]: Start difference. First operand has 250 places, 319 transitions, 5000 flow. Second operand 9 states and 146 transitions. [2024-06-28 01:38:37,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 346 transitions, 5828 flow [2024-06-28 01:38:38,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 346 transitions, 5523 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-28 01:38:38,135 INFO L231 Difference]: Finished difference. Result has 249 places, 319 transitions, 4753 flow [2024-06-28 01:38:38,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4695, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4753, PETRI_PLACES=249, PETRI_TRANSITIONS=319} [2024-06-28 01:38:38,137 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 208 predicate places. [2024-06-28 01:38:38,138 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 319 transitions, 4753 flow [2024-06-28 01:38:38,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:38,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:38,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:38,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:38:38,138 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:38,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash -341714000, now seen corresponding path program 8 times [2024-06-28 01:38:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919021452] [2024-06-28 01:38:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:38,797 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-28 01:38:38,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919021452] [2024-06-28 01:38:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919021452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:38,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:38,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:38:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784070067] [2024-06-28 01:38:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:38,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:38:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:38,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:38:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:38:38,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:38,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 319 transitions, 4753 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:38,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:38,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:38,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:39,719 INFO L124 PetriNetUnfolderBase]: 2078/3712 cut-off events. [2024-06-28 01:38:39,719 INFO L125 PetriNetUnfolderBase]: For 60756/60812 co-relation queries the response was YES. [2024-06-28 01:38:39,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23279 conditions, 3712 events. 2078/3712 cut-off events. For 60756/60812 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24781 event pairs, 574 based on Foata normal form. 59/3660 useless extension candidates. Maximal degree in co-relation 23160. Up to 3113 conditions per place. [2024-06-28 01:38:39,762 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 320 selfloop transitions, 28 changer transitions 0/356 dead transitions. [2024-06-28 01:38:39,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 356 transitions, 5639 flow [2024-06-28 01:38:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:38:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:38:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 01:38:39,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2024-06-28 01:38:39,768 INFO L175 Difference]: Start difference. First operand has 249 places, 319 transitions, 4753 flow. Second operand 9 states and 155 transitions. [2024-06-28 01:38:39,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 356 transitions, 5639 flow [2024-06-28 01:38:40,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 356 transitions, 5571 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:40,153 INFO L231 Difference]: Finished difference. Result has 251 places, 319 transitions, 4750 flow [2024-06-28 01:38:40,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4685, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4750, PETRI_PLACES=251, PETRI_TRANSITIONS=319} [2024-06-28 01:38:40,155 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2024-06-28 01:38:40,155 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 319 transitions, 4750 flow [2024-06-28 01:38:40,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:40,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:40,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:40,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:38:40,155 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:40,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1665400565, now seen corresponding path program 1 times [2024-06-28 01:38:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535465908] [2024-06-28 01:38:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:40,956 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-28 01:38:40,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:40,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535465908] [2024-06-28 01:38:40,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535465908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:40,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:40,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333185815] [2024-06-28 01:38:40,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:40,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:40,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:40,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:41,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:41,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 319 transitions, 4750 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:41,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:41,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:41,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:42,027 INFO L124 PetriNetUnfolderBase]: 2095/3851 cut-off events. [2024-06-28 01:38:42,028 INFO L125 PetriNetUnfolderBase]: For 61369/61435 co-relation queries the response was YES. [2024-06-28 01:38:42,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23626 conditions, 3851 events. 2095/3851 cut-off events. For 61369/61435 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26324 event pairs, 306 based on Foata normal form. 68/3811 useless extension candidates. Maximal degree in co-relation 23506. Up to 1814 conditions per place. [2024-06-28 01:38:42,081 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 272 selfloop transitions, 130 changer transitions 0/410 dead transitions. [2024-06-28 01:38:42,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 410 transitions, 6441 flow [2024-06-28 01:38:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:38:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:38:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-06-28 01:38:42,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47911547911547914 [2024-06-28 01:38:42,082 INFO L175 Difference]: Start difference. First operand has 251 places, 319 transitions, 4750 flow. Second operand 11 states and 195 transitions. [2024-06-28 01:38:42,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 410 transitions, 6441 flow [2024-06-28 01:38:42,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 410 transitions, 6336 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-28 01:38:42,447 INFO L231 Difference]: Finished difference. Result has 257 places, 356 transitions, 5596 flow [2024-06-28 01:38:42,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4669, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5596, PETRI_PLACES=257, PETRI_TRANSITIONS=356} [2024-06-28 01:38:42,448 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places. [2024-06-28 01:38:42,448 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 356 transitions, 5596 flow [2024-06-28 01:38:42,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:42,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:42,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:42,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:38:42,449 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:42,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1231742607, now seen corresponding path program 2 times [2024-06-28 01:38:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965762861] [2024-06-28 01:38:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:43,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965762861] [2024-06-28 01:38:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965762861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854701188] [2024-06-28 01:38:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:43,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:43,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:43,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 356 transitions, 5596 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:43,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:43,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:43,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:44,495 INFO L124 PetriNetUnfolderBase]: 2303/4167 cut-off events. [2024-06-28 01:38:44,496 INFO L125 PetriNetUnfolderBase]: For 71975/72029 co-relation queries the response was YES. [2024-06-28 01:38:44,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27494 conditions, 4167 events. 2303/4167 cut-off events. For 71975/72029 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 28786 event pairs, 516 based on Foata normal form. 56/4107 useless extension candidates. Maximal degree in co-relation 27370. Up to 2785 conditions per place. [2024-06-28 01:38:44,541 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 314 selfloop transitions, 120 changer transitions 0/442 dead transitions. [2024-06-28 01:38:44,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 442 transitions, 7427 flow [2024-06-28 01:38:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:38:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:38:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-06-28 01:38:44,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2024-06-28 01:38:44,561 INFO L175 Difference]: Start difference. First operand has 257 places, 356 transitions, 5596 flow. Second operand 11 states and 191 transitions. [2024-06-28 01:38:44,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 442 transitions, 7427 flow [2024-06-28 01:38:45,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 442 transitions, 7330 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-28 01:38:45,065 INFO L231 Difference]: Finished difference. Result has 268 places, 385 transitions, 6387 flow [2024-06-28 01:38:45,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6387, PETRI_PLACES=268, PETRI_TRANSITIONS=385} [2024-06-28 01:38:45,066 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 227 predicate places. [2024-06-28 01:38:45,066 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 385 transitions, 6387 flow [2024-06-28 01:38:45,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:45,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:45,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:45,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:38:45,067 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:45,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1231627287, now seen corresponding path program 3 times [2024-06-28 01:38:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350215635] [2024-06-28 01:38:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:45,783 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-28 01:38:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350215635] [2024-06-28 01:38:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350215635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:45,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:45,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047559748] [2024-06-28 01:38:45,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:45,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:45,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:45,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 385 transitions, 6387 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:45,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:45,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:45,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:47,054 INFO L124 PetriNetUnfolderBase]: 2363/4308 cut-off events. [2024-06-28 01:38:47,054 INFO L125 PetriNetUnfolderBase]: For 79813/79894 co-relation queries the response was YES. [2024-06-28 01:38:47,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28605 conditions, 4308 events. 2363/4308 cut-off events. For 79813/79894 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 29965 event pairs, 356 based on Foata normal form. 83/4276 useless extension candidates. Maximal degree in co-relation 28476. Up to 2423 conditions per place. [2024-06-28 01:38:47,108 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 282 selfloop transitions, 155 changer transitions 0/445 dead transitions. [2024-06-28 01:38:47,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 445 transitions, 7791 flow [2024-06-28 01:38:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:38:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:38:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:38:47,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-06-28 01:38:47,117 INFO L175 Difference]: Start difference. First operand has 268 places, 385 transitions, 6387 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:38:47,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 445 transitions, 7791 flow [2024-06-28 01:38:47,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 445 transitions, 7767 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 01:38:47,715 INFO L231 Difference]: Finished difference. Result has 276 places, 391 transitions, 6757 flow [2024-06-28 01:38:47,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6363, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6757, PETRI_PLACES=276, PETRI_TRANSITIONS=391} [2024-06-28 01:38:47,715 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-06-28 01:38:47,716 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 391 transitions, 6757 flow [2024-06-28 01:38:47,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:47,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:47,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:47,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 01:38:47,716 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:47,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1374037971, now seen corresponding path program 4 times [2024-06-28 01:38:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479550160] [2024-06-28 01:38:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:48,510 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-28 01:38:48,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479550160] [2024-06-28 01:38:48,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479550160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:48,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643173696] [2024-06-28 01:38:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:48,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:48,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:48,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:48,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 391 transitions, 6757 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:48,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:48,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:48,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:49,853 INFO L124 PetriNetUnfolderBase]: 2496/4467 cut-off events. [2024-06-28 01:38:49,854 INFO L125 PetriNetUnfolderBase]: For 115365/115450 co-relation queries the response was YES. [2024-06-28 01:38:49,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30277 conditions, 4467 events. 2496/4467 cut-off events. For 115365/115450 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30855 event pairs, 443 based on Foata normal form. 105/4454 useless extension candidates. Maximal degree in co-relation 30145. Up to 1596 conditions per place. [2024-06-28 01:38:49,915 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 231 selfloop transitions, 227 changer transitions 0/466 dead transitions. [2024-06-28 01:38:49,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 466 transitions, 8152 flow [2024-06-28 01:38:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:38:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:38:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 243 transitions. [2024-06-28 01:38:49,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051975051975052 [2024-06-28 01:38:49,916 INFO L175 Difference]: Start difference. First operand has 276 places, 391 transitions, 6757 flow. Second operand 13 states and 243 transitions. [2024-06-28 01:38:49,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 466 transitions, 8152 flow [2024-06-28 01:38:50,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 466 transitions, 7904 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-28 01:38:50,489 INFO L231 Difference]: Finished difference. Result has 285 places, 395 transitions, 7044 flow [2024-06-28 01:38:50,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6517, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7044, PETRI_PLACES=285, PETRI_TRANSITIONS=395} [2024-06-28 01:38:50,490 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 244 predicate places. [2024-06-28 01:38:50,490 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 395 transitions, 7044 flow [2024-06-28 01:38:50,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:50,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:50,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:50,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 01:38:50,490 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:50,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1374038157, now seen corresponding path program 1 times [2024-06-28 01:38:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525363670] [2024-06-28 01:38:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:51,213 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-28 01:38:51,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525363670] [2024-06-28 01:38:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525363670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:51,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489014545] [2024-06-28 01:38:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:51,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:51,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:51,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:51,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 395 transitions, 7044 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:51,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:51,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:51,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:52,450 INFO L124 PetriNetUnfolderBase]: 2518/4473 cut-off events. [2024-06-28 01:38:52,451 INFO L125 PetriNetUnfolderBase]: For 85415/85496 co-relation queries the response was YES. [2024-06-28 01:38:52,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31550 conditions, 4473 events. 2518/4473 cut-off events. For 85415/85496 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30658 event pairs, 529 based on Foata normal form. 83/4437 useless extension candidates. Maximal degree in co-relation 31416. Up to 1638 conditions per place. [2024-06-28 01:38:52,517 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 227 selfloop transitions, 212 changer transitions 0/447 dead transitions. [2024-06-28 01:38:52,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 447 transitions, 8356 flow [2024-06-28 01:38:52,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:38:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:38:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:38:52,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:38:52,518 INFO L175 Difference]: Start difference. First operand has 285 places, 395 transitions, 7044 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:38:52,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 447 transitions, 8356 flow [2024-06-28 01:38:53,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 447 transitions, 7916 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-28 01:38:53,055 INFO L231 Difference]: Finished difference. Result has 286 places, 401 transitions, 7250 flow [2024-06-28 01:38:53,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6604, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7250, PETRI_PLACES=286, PETRI_TRANSITIONS=401} [2024-06-28 01:38:53,056 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places. [2024-06-28 01:38:53,056 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 401 transitions, 7250 flow [2024-06-28 01:38:53,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:53,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:53,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:53,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 01:38:53,057 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:53,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash -371132113, now seen corresponding path program 2 times [2024-06-28 01:38:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108998421] [2024-06-28 01:38:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:53,873 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-28 01:38:53,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:53,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108998421] [2024-06-28 01:38:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108998421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:53,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:53,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131253778] [2024-06-28 01:38:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:53,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:53,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:53,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:53,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:53,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 401 transitions, 7250 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:53,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:53,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:53,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:55,136 INFO L124 PetriNetUnfolderBase]: 2562/4682 cut-off events. [2024-06-28 01:38:55,136 INFO L125 PetriNetUnfolderBase]: For 88015/88079 co-relation queries the response was YES. [2024-06-28 01:38:55,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32864 conditions, 4682 events. 2562/4682 cut-off events. For 88015/88079 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 33049 event pairs, 531 based on Foata normal form. 66/4605 useless extension candidates. Maximal degree in co-relation 32728. Up to 2744 conditions per place. [2024-06-28 01:38:55,208 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 290 selfloop transitions, 166 changer transitions 0/464 dead transitions. [2024-06-28 01:38:55,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 464 transitions, 8605 flow [2024-06-28 01:38:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:38:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:38:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-06-28 01:38:55,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914004914004914 [2024-06-28 01:38:55,210 INFO L175 Difference]: Start difference. First operand has 286 places, 401 transitions, 7250 flow. Second operand 11 states and 200 transitions. [2024-06-28 01:38:55,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 464 transitions, 8605 flow [2024-06-28 01:38:55,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 464 transitions, 8523 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 01:38:55,858 INFO L231 Difference]: Finished difference. Result has 294 places, 413 transitions, 7710 flow [2024-06-28 01:38:55,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7170, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7710, PETRI_PLACES=294, PETRI_TRANSITIONS=413} [2024-06-28 01:38:55,859 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places. [2024-06-28 01:38:55,859 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 413 transitions, 7710 flow [2024-06-28 01:38:55,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:55,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:55,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:55,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 01:38:55,859 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:55,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1245045773, now seen corresponding path program 3 times [2024-06-28 01:38:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:55,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182573140] [2024-06-28 01:38:55,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:56,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:56,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182573140] [2024-06-28 01:38:56,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182573140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:56,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:56,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:56,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31425418] [2024-06-28 01:38:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:56,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:56,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:56,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:56,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:56,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 413 transitions, 7710 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:56,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:56,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:56,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:58,091 INFO L124 PetriNetUnfolderBase]: 2606/4760 cut-off events. [2024-06-28 01:38:58,091 INFO L125 PetriNetUnfolderBase]: For 95357/95421 co-relation queries the response was YES. [2024-06-28 01:38:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34395 conditions, 4760 events. 2606/4760 cut-off events. For 95357/95421 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 33655 event pairs, 529 based on Foata normal form. 66/4680 useless extension candidates. Maximal degree in co-relation 34255. Up to 2740 conditions per place. [2024-06-28 01:38:58,154 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 291 selfloop transitions, 175 changer transitions 0/474 dead transitions. [2024-06-28 01:38:58,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 474 transitions, 9051 flow [2024-06-28 01:38:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:38:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:38:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-06-28 01:38:58,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48423423423423423 [2024-06-28 01:38:58,156 INFO L175 Difference]: Start difference. First operand has 294 places, 413 transitions, 7710 flow. Second operand 12 states and 215 transitions. [2024-06-28 01:38:58,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 474 transitions, 9051 flow [2024-06-28 01:38:58,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 474 transitions, 8718 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 01:38:58,732 INFO L231 Difference]: Finished difference. Result has 300 places, 419 transitions, 7865 flow [2024-06-28 01:38:58,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7377, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7865, PETRI_PLACES=300, PETRI_TRANSITIONS=419} [2024-06-28 01:38:58,732 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2024-06-28 01:38:58,732 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 419 transitions, 7865 flow [2024-06-28 01:38:58,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:58,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:58,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:58,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 01:38:58,733 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:38:58,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1783488245, now seen corresponding path program 5 times [2024-06-28 01:38:58,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:58,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030766290] [2024-06-28 01:38:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:58,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:59,584 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-28 01:38:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030766290] [2024-06-28 01:38:59,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030766290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:59,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:59,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:38:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196905188] [2024-06-28 01:38:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:59,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:38:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:38:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:38:59,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:38:59,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 419 transitions, 7865 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:59,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:59,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:38:59,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:01,051 INFO L124 PetriNetUnfolderBase]: 2638/4796 cut-off events. [2024-06-28 01:39:01,052 INFO L125 PetriNetUnfolderBase]: For 97666/97732 co-relation queries the response was YES. [2024-06-28 01:39:01,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34826 conditions, 4796 events. 2638/4796 cut-off events. For 97666/97732 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34006 event pairs, 519 based on Foata normal form. 68/4719 useless extension candidates. Maximal degree in co-relation 34684. Up to 2541 conditions per place. [2024-06-28 01:39:01,126 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 300 selfloop transitions, 166 changer transitions 0/474 dead transitions. [2024-06-28 01:39:01,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 474 transitions, 9124 flow [2024-06-28 01:39:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:39:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:39:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-28 01:39:01,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-06-28 01:39:01,127 INFO L175 Difference]: Start difference. First operand has 300 places, 419 transitions, 7865 flow. Second operand 10 states and 192 transitions. [2024-06-28 01:39:01,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 474 transitions, 9124 flow [2024-06-28 01:39:01,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 474 transitions, 8783 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-28 01:39:01,943 INFO L231 Difference]: Finished difference. Result has 303 places, 421 transitions, 7902 flow [2024-06-28 01:39:01,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7524, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7902, PETRI_PLACES=303, PETRI_TRANSITIONS=421} [2024-06-28 01:39:01,944 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places. [2024-06-28 01:39:01,944 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 421 transitions, 7902 flow [2024-06-28 01:39:01,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:01,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:01,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:01,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 01:39:01,945 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:01,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -233487865, now seen corresponding path program 6 times [2024-06-28 01:39:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008342023] [2024-06-28 01:39:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:02,717 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-28 01:39:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008342023] [2024-06-28 01:39:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008342023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308158979] [2024-06-28 01:39:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:02,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:02,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:02,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 421 transitions, 7902 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:02,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:02,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:02,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:04,250 INFO L124 PetriNetUnfolderBase]: 2654/4821 cut-off events. [2024-06-28 01:39:04,250 INFO L125 PetriNetUnfolderBase]: For 98586/98655 co-relation queries the response was YES. [2024-06-28 01:39:04,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34958 conditions, 4821 events. 2654/4821 cut-off events. For 98586/98655 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 34216 event pairs, 508 based on Foata normal form. 71/4747 useless extension candidates. Maximal degree in co-relation 34814. Up to 2433 conditions per place. [2024-06-28 01:39:04,320 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 293 selfloop transitions, 178 changer transitions 0/479 dead transitions. [2024-06-28 01:39:04,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 479 transitions, 9186 flow [2024-06-28 01:39:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:39:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:39:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-28 01:39:04,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085995085995086 [2024-06-28 01:39:04,321 INFO L175 Difference]: Start difference. First operand has 303 places, 421 transitions, 7902 flow. Second operand 11 states and 207 transitions. [2024-06-28 01:39:04,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 479 transitions, 9186 flow [2024-06-28 01:39:05,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 479 transitions, 8862 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-28 01:39:05,021 INFO L231 Difference]: Finished difference. Result has 307 places, 422 transitions, 7957 flow [2024-06-28 01:39:05,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7578, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7957, PETRI_PLACES=307, PETRI_TRANSITIONS=422} [2024-06-28 01:39:05,022 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 266 predicate places. [2024-06-28 01:39:05,022 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 422 transitions, 7957 flow [2024-06-28 01:39:05,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:05,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:05,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:05,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 01:39:05,023 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:05,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -233483029, now seen corresponding path program 4 times [2024-06-28 01:39:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665805251] [2024-06-28 01:39:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:05,872 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-28 01:39:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665805251] [2024-06-28 01:39:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665805251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:05,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857378050] [2024-06-28 01:39:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:05,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:05,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:05,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 422 transitions, 7957 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:05,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:05,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:07,455 INFO L124 PetriNetUnfolderBase]: 2676/4884 cut-off events. [2024-06-28 01:39:07,456 INFO L125 PetriNetUnfolderBase]: For 100800/100865 co-relation queries the response was YES. [2024-06-28 01:39:07,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35409 conditions, 4884 events. 2676/4884 cut-off events. For 100800/100865 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 34757 event pairs, 543 based on Foata normal form. 67/4805 useless extension candidates. Maximal degree in co-relation 35264. Up to 2771 conditions per place. [2024-06-28 01:39:07,523 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 288 selfloop transitions, 187 changer transitions 0/483 dead transitions. [2024-06-28 01:39:07,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 483 transitions, 9272 flow [2024-06-28 01:39:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:39:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:39:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2024-06-28 01:39:07,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781704781704782 [2024-06-28 01:39:07,524 INFO L175 Difference]: Start difference. First operand has 307 places, 422 transitions, 7957 flow. Second operand 13 states and 230 transitions. [2024-06-28 01:39:07,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 483 transitions, 9272 flow [2024-06-28 01:39:08,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 483 transitions, 8959 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:39:08,304 INFO L231 Difference]: Finished difference. Result has 313 places, 424 transitions, 8066 flow [2024-06-28 01:39:08,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7644, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8066, PETRI_PLACES=313, PETRI_TRANSITIONS=424} [2024-06-28 01:39:08,305 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2024-06-28 01:39:08,305 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 424 transitions, 8066 flow [2024-06-28 01:39:08,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:08,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:08,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:08,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 01:39:08,306 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:08,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -375893899, now seen corresponding path program 7 times [2024-06-28 01:39:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792310025] [2024-06-28 01:39:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:09,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-28 01:39:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792310025] [2024-06-28 01:39:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792310025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:09,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:09,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684398444] [2024-06-28 01:39:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:09,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:09,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:09,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:09,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:09,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:09,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 424 transitions, 8066 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:09,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:09,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:09,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:10,480 INFO L124 PetriNetUnfolderBase]: 2824/5131 cut-off events. [2024-06-28 01:39:10,481 INFO L125 PetriNetUnfolderBase]: For 104364/104447 co-relation queries the response was YES. [2024-06-28 01:39:10,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37009 conditions, 5131 events. 2824/5131 cut-off events. For 104364/104447 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 37051 event pairs, 706 based on Foata normal form. 85/5071 useless extension candidates. Maximal degree in co-relation 36863. Up to 3789 conditions per place. [2024-06-28 01:39:10,544 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 372 selfloop transitions, 115 changer transitions 0/495 dead transitions. [2024-06-28 01:39:10,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 495 transitions, 9690 flow [2024-06-28 01:39:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:39:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:39:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-06-28 01:39:10,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2024-06-28 01:39:10,550 INFO L175 Difference]: Start difference. First operand has 313 places, 424 transitions, 8066 flow. Second operand 11 states and 191 transitions. [2024-06-28 01:39:10,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 495 transitions, 9690 flow [2024-06-28 01:39:11,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 495 transitions, 9289 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-28 01:39:11,273 INFO L231 Difference]: Finished difference. Result has 318 places, 440 transitions, 8300 flow [2024-06-28 01:39:11,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7672, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8300, PETRI_PLACES=318, PETRI_TRANSITIONS=440} [2024-06-28 01:39:11,274 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 277 predicate places. [2024-06-28 01:39:11,274 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 440 transitions, 8300 flow [2024-06-28 01:39:11,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:11,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:11,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:11,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 01:39:11,276 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:11,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1107938511, now seen corresponding path program 8 times [2024-06-28 01:39:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931210009] [2024-06-28 01:39:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:12,001 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-28 01:39:12,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931210009] [2024-06-28 01:39:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931210009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446661253] [2024-06-28 01:39:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:12,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:12,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:12,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:12,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:12,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 440 transitions, 8300 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:12,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:12,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:12,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:13,798 INFO L124 PetriNetUnfolderBase]: 2959/5365 cut-off events. [2024-06-28 01:39:13,798 INFO L125 PetriNetUnfolderBase]: For 132922/133011 co-relation queries the response was YES. [2024-06-28 01:39:13,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38952 conditions, 5365 events. 2959/5365 cut-off events. For 132922/133011 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 38811 event pairs, 434 based on Foata normal form. 91/5308 useless extension candidates. Maximal degree in co-relation 38800. Up to 2208 conditions per place. [2024-06-28 01:39:13,887 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 282 selfloop transitions, 213 changer transitions 0/503 dead transitions. [2024-06-28 01:39:13,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 503 transitions, 9809 flow [2024-06-28 01:39:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:39:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:39:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-28 01:39:13,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459459459459459 [2024-06-28 01:39:13,889 INFO L175 Difference]: Start difference. First operand has 318 places, 440 transitions, 8300 flow. Second operand 10 states and 202 transitions. [2024-06-28 01:39:13,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 503 transitions, 9809 flow [2024-06-28 01:39:15,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 503 transitions, 9661 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-28 01:39:15,054 INFO L231 Difference]: Finished difference. Result has 324 places, 442 transitions, 8627 flow [2024-06-28 01:39:15,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8161, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8627, PETRI_PLACES=324, PETRI_TRANSITIONS=442} [2024-06-28 01:39:15,055 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 283 predicate places. [2024-06-28 01:39:15,055 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 442 transitions, 8627 flow [2024-06-28 01:39:15,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:15,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:15,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 01:39:15,056 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:15,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1250113905, now seen corresponding path program 9 times [2024-06-28 01:39:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:15,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605475923] [2024-06-28 01:39:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:15,873 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-28 01:39:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605475923] [2024-06-28 01:39:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605475923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189131843] [2024-06-28 01:39:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:15,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:15,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:16,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 442 transitions, 8627 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:16,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:16,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:16,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:17,683 INFO L124 PetriNetUnfolderBase]: 3048/5793 cut-off events. [2024-06-28 01:39:17,683 INFO L125 PetriNetUnfolderBase]: For 149390/149485 co-relation queries the response was YES. [2024-06-28 01:39:17,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41484 conditions, 5793 events. 3048/5793 cut-off events. For 149390/149485 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 44308 event pairs, 550 based on Foata normal form. 97/5681 useless extension candidates. Maximal degree in co-relation 41330. Up to 3665 conditions per place. [2024-06-28 01:39:17,777 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 379 selfloop transitions, 128 changer transitions 0/515 dead transitions. [2024-06-28 01:39:17,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 515 transitions, 10474 flow [2024-06-28 01:39:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:39:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:39:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-28 01:39:17,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345345345345346 [2024-06-28 01:39:17,779 INFO L175 Difference]: Start difference. First operand has 324 places, 442 transitions, 8627 flow. Second operand 9 states and 178 transitions. [2024-06-28 01:39:17,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 515 transitions, 10474 flow [2024-06-28 01:39:18,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 515 transitions, 10119 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 01:39:18,976 INFO L231 Difference]: Finished difference. Result has 330 places, 464 transitions, 9007 flow [2024-06-28 01:39:18,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8292, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9007, PETRI_PLACES=330, PETRI_TRANSITIONS=464} [2024-06-28 01:39:18,977 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 289 predicate places. [2024-06-28 01:39:18,977 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 464 transitions, 9007 flow [2024-06-28 01:39:18,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:18,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:18,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 01:39:18,978 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:18,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1250109255, now seen corresponding path program 10 times [2024-06-28 01:39:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:18,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879340884] [2024-06-28 01:39:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:19,840 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-28 01:39:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879340884] [2024-06-28 01:39:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879340884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386228121] [2024-06-28 01:39:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:19,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:19,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:19,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:19,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 464 transitions, 9007 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:19,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:19,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:19,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:21,556 INFO L124 PetriNetUnfolderBase]: 3045/5824 cut-off events. [2024-06-28 01:39:21,556 INFO L125 PetriNetUnfolderBase]: For 148211/148306 co-relation queries the response was YES. [2024-06-28 01:39:21,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42858 conditions, 5824 events. 3045/5824 cut-off events. For 148211/148306 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 44877 event pairs, 576 based on Foata normal form. 97/5700 useless extension candidates. Maximal degree in co-relation 42699. Up to 3722 conditions per place. [2024-06-28 01:39:21,636 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 370 selfloop transitions, 134 changer transitions 0/512 dead transitions. [2024-06-28 01:39:21,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 512 transitions, 10432 flow [2024-06-28 01:39:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:39:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:39:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-28 01:39:21,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255255255255256 [2024-06-28 01:39:21,640 INFO L175 Difference]: Start difference. First operand has 330 places, 464 transitions, 9007 flow. Second operand 9 states and 175 transitions. [2024-06-28 01:39:21,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 512 transitions, 10432 flow [2024-06-28 01:39:22,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 512 transitions, 10414 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-28 01:39:22,750 INFO L231 Difference]: Finished difference. Result has 338 places, 464 transitions, 9262 flow [2024-06-28 01:39:22,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8989, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9262, PETRI_PLACES=338, PETRI_TRANSITIONS=464} [2024-06-28 01:39:22,750 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 297 predicate places. [2024-06-28 01:39:22,751 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 464 transitions, 9262 flow [2024-06-28 01:39:22,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:22,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:22,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:22,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 01:39:22,751 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:22,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1432949027, now seen corresponding path program 5 times [2024-06-28 01:39:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:22,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842397555] [2024-06-28 01:39:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:39:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:23,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842397555] [2024-06-28 01:39:23,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842397555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:23,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:23,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:23,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038547541] [2024-06-28 01:39:23,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:23,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:23,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:23,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:23,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:23,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 464 transitions, 9262 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:23,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:23,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:23,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:25,164 INFO L124 PetriNetUnfolderBase]: 3104/5552 cut-off events. [2024-06-28 01:39:25,165 INFO L125 PetriNetUnfolderBase]: For 154364/154454 co-relation queries the response was YES. [2024-06-28 01:39:25,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43906 conditions, 5552 events. 3104/5552 cut-off events. For 154364/154454 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 40157 event pairs, 433 based on Foata normal form. 92/5509 useless extension candidates. Maximal degree in co-relation 43744. Up to 2790 conditions per place. [2024-06-28 01:39:25,243 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 274 selfloop transitions, 250 changer transitions 0/532 dead transitions. [2024-06-28 01:39:25,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 532 transitions, 11004 flow [2024-06-28 01:39:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:39:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:39:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-28 01:39:25,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351351351351351 [2024-06-28 01:39:25,244 INFO L175 Difference]: Start difference. First operand has 338 places, 464 transitions, 9262 flow. Second operand 10 states and 198 transitions. [2024-06-28 01:39:25,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 532 transitions, 11004 flow [2024-06-28 01:39:26,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 532 transitions, 10794 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:39:26,611 INFO L231 Difference]: Finished difference. Result has 343 places, 477 transitions, 9906 flow [2024-06-28 01:39:26,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9060, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9906, PETRI_PLACES=343, PETRI_TRANSITIONS=477} [2024-06-28 01:39:26,612 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 302 predicate places. [2024-06-28 01:39:26,612 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 477 transitions, 9906 flow [2024-06-28 01:39:26,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:26,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:26,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:26,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 01:39:26,612 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:26,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1103176725, now seen corresponding path program 6 times [2024-06-28 01:39:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598607651] [2024-06-28 01:39:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:27,425 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-28 01:39:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:27,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598607651] [2024-06-28 01:39:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598607651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:27,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:27,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:27,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201953591] [2024-06-28 01:39:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:27,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:27,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:27,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:27,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:27,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:27,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 477 transitions, 9906 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:27,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:27,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:27,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:29,102 INFO L124 PetriNetUnfolderBase]: 3148/5816 cut-off events. [2024-06-28 01:39:29,102 INFO L125 PetriNetUnfolderBase]: For 164896/164962 co-relation queries the response was YES. [2024-06-28 01:39:29,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45952 conditions, 5816 events. 3148/5816 cut-off events. For 164896/164962 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 43414 event pairs, 607 based on Foata normal form. 68/5702 useless extension candidates. Maximal degree in co-relation 45787. Up to 3727 conditions per place. [2024-06-28 01:39:29,187 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 342 selfloop transitions, 190 changer transitions 0/540 dead transitions. [2024-06-28 01:39:29,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 540 transitions, 11426 flow [2024-06-28 01:39:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:39:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:39:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-06-28 01:39:29,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036855036855037 [2024-06-28 01:39:29,188 INFO L175 Difference]: Start difference. First operand has 343 places, 477 transitions, 9906 flow. Second operand 11 states and 205 transitions. [2024-06-28 01:39:29,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 540 transitions, 11426 flow [2024-06-28 01:39:30,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 540 transitions, 11207 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-28 01:39:30,541 INFO L231 Difference]: Finished difference. Result has 351 places, 483 transitions, 10220 flow [2024-06-28 01:39:30,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9687, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10220, PETRI_PLACES=351, PETRI_TRANSITIONS=483} [2024-06-28 01:39:30,541 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 310 predicate places. [2024-06-28 01:39:30,541 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 483 transitions, 10220 flow [2024-06-28 01:39:30,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:30,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:30,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 01:39:30,542 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:30,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1072977735, now seen corresponding path program 11 times [2024-06-28 01:39:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829884267] [2024-06-28 01:39:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:39:31,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829884267] [2024-06-28 01:39:31,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829884267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:31,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073106475] [2024-06-28 01:39:31,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:31,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:31,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:31,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:31,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:31,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 483 transitions, 10220 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:31,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:31,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:33,139 INFO L124 PetriNetUnfolderBase]: 3248/6040 cut-off events. [2024-06-28 01:39:33,139 INFO L125 PetriNetUnfolderBase]: For 200660/200729 co-relation queries the response was YES. [2024-06-28 01:39:33,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47716 conditions, 6040 events. 3248/6040 cut-off events. For 200660/200729 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 45917 event pairs, 610 based on Foata normal form. 83/5928 useless extension candidates. Maximal degree in co-relation 47548. Up to 3717 conditions per place. [2024-06-28 01:39:33,236 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 359 selfloop transitions, 176 changer transitions 0/543 dead transitions. [2024-06-28 01:39:33,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 543 transitions, 11728 flow [2024-06-28 01:39:33,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:39:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:39:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 01:39:33,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:39:33,238 INFO L175 Difference]: Start difference. First operand has 351 places, 483 transitions, 10220 flow. Second operand 10 states and 190 transitions. [2024-06-28 01:39:33,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 543 transitions, 11728 flow [2024-06-28 01:39:34,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 543 transitions, 11354 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 01:39:34,811 INFO L231 Difference]: Finished difference. Result has 355 places, 484 transitions, 10228 flow [2024-06-28 01:39:34,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9846, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10228, PETRI_PLACES=355, PETRI_TRANSITIONS=484} [2024-06-28 01:39:34,815 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 314 predicate places. [2024-06-28 01:39:34,815 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 484 transitions, 10228 flow [2024-06-28 01:39:34,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:34,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:34,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:34,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 01:39:34,816 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:34,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash -936942945, now seen corresponding path program 7 times [2024-06-28 01:39:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:34,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738313436] [2024-06-28 01:39:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:35,702 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-28 01:39:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:35,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738313436] [2024-06-28 01:39:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738313436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:35,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:35,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453508702] [2024-06-28 01:39:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:35,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:35,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:35,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:35,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:35,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 484 transitions, 10228 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:35,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:35,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:35,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:37,616 INFO L124 PetriNetUnfolderBase]: 3270/6114 cut-off events. [2024-06-28 01:39:37,617 INFO L125 PetriNetUnfolderBase]: For 173358/173428 co-relation queries the response was YES. [2024-06-28 01:39:37,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47960 conditions, 6114 events. 3270/6114 cut-off events. For 173358/173428 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 46708 event pairs, 648 based on Foata normal form. 72/5984 useless extension candidates. Maximal degree in co-relation 47791. Up to 3945 conditions per place. [2024-06-28 01:39:37,723 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 371 selfloop transitions, 172 changer transitions 0/551 dead transitions. [2024-06-28 01:39:37,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 551 transitions, 11812 flow [2024-06-28 01:39:37,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:39:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:39:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-06-28 01:39:37,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036855036855037 [2024-06-28 01:39:37,725 INFO L175 Difference]: Start difference. First operand has 355 places, 484 transitions, 10228 flow. Second operand 11 states and 205 transitions. [2024-06-28 01:39:37,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 551 transitions, 11812 flow [2024-06-28 01:39:39,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 551 transitions, 11461 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 01:39:39,302 INFO L231 Difference]: Finished difference. Result has 359 places, 489 transitions, 10340 flow [2024-06-28 01:39:39,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9877, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10340, PETRI_PLACES=359, PETRI_TRANSITIONS=489} [2024-06-28 01:39:39,303 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 318 predicate places. [2024-06-28 01:39:39,303 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 489 transitions, 10340 flow [2024-06-28 01:39:39,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:39,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:39,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:39,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 01:39:39,304 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:39,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:39,304 INFO L85 PathProgramCache]: Analyzing trace with hash -930686835, now seen corresponding path program 8 times [2024-06-28 01:39:39,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:39,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550581963] [2024-06-28 01:39:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:39,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:39:40,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:40,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550581963] [2024-06-28 01:39:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550581963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221652321] [2024-06-28 01:39:40,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:40,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:40,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:40,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:40,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:40,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 489 transitions, 10340 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:40,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:40,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:40,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:41,903 INFO L124 PetriNetUnfolderBase]: 3350/6209 cut-off events. [2024-06-28 01:39:41,904 INFO L125 PetriNetUnfolderBase]: For 178080/178149 co-relation queries the response was YES. [2024-06-28 01:39:41,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49128 conditions, 6209 events. 3350/6209 cut-off events. For 178080/178149 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 47188 event pairs, 638 based on Foata normal form. 71/6083 useless extension candidates. Maximal degree in co-relation 48957. Up to 3995 conditions per place. [2024-06-28 01:39:41,999 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 360 selfloop transitions, 186 changer transitions 0/554 dead transitions. [2024-06-28 01:39:42,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 554 transitions, 11969 flow [2024-06-28 01:39:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:39:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:39:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2024-06-28 01:39:42,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987714987714988 [2024-06-28 01:39:42,001 INFO L175 Difference]: Start difference. First operand has 359 places, 489 transitions, 10340 flow. Second operand 11 states and 203 transitions. [2024-06-28 01:39:42,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 554 transitions, 11969 flow [2024-06-28 01:39:43,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 554 transitions, 11585 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-28 01:39:43,507 INFO L231 Difference]: Finished difference. Result has 363 places, 499 transitions, 10566 flow [2024-06-28 01:39:43,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9968, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10566, PETRI_PLACES=363, PETRI_TRANSITIONS=499} [2024-06-28 01:39:43,508 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 322 predicate places. [2024-06-28 01:39:43,508 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 499 transitions, 10566 flow [2024-06-28 01:39:43,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:43,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:43,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:43,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 01:39:43,509 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:43,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1245640419, now seen corresponding path program 9 times [2024-06-28 01:39:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863334311] [2024-06-28 01:39:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:44,300 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-28 01:39:44,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863334311] [2024-06-28 01:39:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863334311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819140112] [2024-06-28 01:39:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:44,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:44,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 499 transitions, 10566 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:44,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:44,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:44,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:46,084 INFO L124 PetriNetUnfolderBase]: 3372/6329 cut-off events. [2024-06-28 01:39:46,084 INFO L125 PetriNetUnfolderBase]: For 181996/182062 co-relation queries the response was YES. [2024-06-28 01:39:46,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49631 conditions, 6329 events. 3372/6329 cut-off events. For 181996/182062 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 48758 event pairs, 654 based on Foata normal form. 68/6173 useless extension candidates. Maximal degree in co-relation 49458. Up to 3986 conditions per place. [2024-06-28 01:39:46,182 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 349 selfloop transitions, 205 changer transitions 0/562 dead transitions. [2024-06-28 01:39:46,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 562 transitions, 12086 flow [2024-06-28 01:39:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:39:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:39:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions. [2024-06-28 01:39:46,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:39:46,183 INFO L175 Difference]: Start difference. First operand has 363 places, 499 transitions, 10566 flow. Second operand 12 states and 220 transitions. [2024-06-28 01:39:46,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 562 transitions, 12086 flow [2024-06-28 01:39:47,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 562 transitions, 11676 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-28 01:39:47,668 INFO L231 Difference]: Finished difference. Result has 367 places, 501 transitions, 10630 flow [2024-06-28 01:39:47,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10156, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10630, PETRI_PLACES=367, PETRI_TRANSITIONS=501} [2024-06-28 01:39:47,669 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 326 predicate places. [2024-06-28 01:39:47,669 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 501 transitions, 10630 flow [2024-06-28 01:39:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:47,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:47,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:47,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 01:39:47,670 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:47,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1079406825, now seen corresponding path program 12 times [2024-06-28 01:39:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023548212] [2024-06-28 01:39:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:48,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-28 01:39:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023548212] [2024-06-28 01:39:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023548212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:48,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236050456] [2024-06-28 01:39:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:48,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:48,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:48,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 501 transitions, 10630 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:48,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:48,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:48,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:50,191 INFO L124 PetriNetUnfolderBase]: 3411/6436 cut-off events. [2024-06-28 01:39:50,191 INFO L125 PetriNetUnfolderBase]: For 187071/187145 co-relation queries the response was YES. [2024-06-28 01:39:50,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50298 conditions, 6436 events. 3411/6436 cut-off events. For 187071/187145 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 50335 event pairs, 702 based on Foata normal form. 76/6289 useless extension candidates. Maximal degree in co-relation 50124. Up to 4776 conditions per place. [2024-06-28 01:39:50,299 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 403 selfloop transitions, 159 changer transitions 0/570 dead transitions. [2024-06-28 01:39:50,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 570 transitions, 12440 flow [2024-06-28 01:39:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:39:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:39:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 01:39:50,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-06-28 01:39:50,301 INFO L175 Difference]: Start difference. First operand has 367 places, 501 transitions, 10630 flow. Second operand 10 states and 181 transitions. [2024-06-28 01:39:50,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 570 transitions, 12440 flow [2024-06-28 01:39:52,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 570 transitions, 12023 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-28 01:39:52,191 INFO L231 Difference]: Finished difference. Result has 371 places, 519 transitions, 11004 flow [2024-06-28 01:39:52,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10213, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11004, PETRI_PLACES=371, PETRI_TRANSITIONS=519} [2024-06-28 01:39:52,192 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 330 predicate places. [2024-06-28 01:39:52,192 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 519 transitions, 11004 flow [2024-06-28 01:39:52,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:52,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:52,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:52,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 01:39:52,193 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:52,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1949132215, now seen corresponding path program 10 times [2024-06-28 01:39:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:52,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713059356] [2024-06-28 01:39:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:39:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713059356] [2024-06-28 01:39:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713059356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:53,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068667862] [2024-06-28 01:39:53,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:53,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:53,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:53,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:53,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 519 transitions, 11004 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:53,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:53,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:53,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:39:54,949 INFO L124 PetriNetUnfolderBase]: 3457/6369 cut-off events. [2024-06-28 01:39:54,950 INFO L125 PetriNetUnfolderBase]: For 185153/185227 co-relation queries the response was YES. [2024-06-28 01:39:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50550 conditions, 6369 events. 3457/6369 cut-off events. For 185153/185227 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 48485 event pairs, 610 based on Foata normal form. 76/6248 useless extension candidates. Maximal degree in co-relation 50373. Up to 3772 conditions per place. [2024-06-28 01:39:55,070 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 352 selfloop transitions, 228 changer transitions 0/588 dead transitions. [2024-06-28 01:39:55,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 588 transitions, 12714 flow [2024-06-28 01:39:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:39:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:39:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-28 01:39:55,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515970515970516 [2024-06-28 01:39:55,072 INFO L175 Difference]: Start difference. First operand has 371 places, 519 transitions, 11004 flow. Second operand 11 states and 210 transitions. [2024-06-28 01:39:55,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 588 transitions, 12714 flow [2024-06-28 01:39:57,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 588 transitions, 12457 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-28 01:39:57,082 INFO L231 Difference]: Finished difference. Result has 377 places, 529 transitions, 11484 flow [2024-06-28 01:39:57,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10747, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11484, PETRI_PLACES=377, PETRI_TRANSITIONS=529} [2024-06-28 01:39:57,082 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 336 predicate places. [2024-06-28 01:39:57,083 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 529 transitions, 11484 flow [2024-06-28 01:39:57,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:57,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:39:57,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:39:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 01:39:57,083 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:39:57,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:39:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1079233845, now seen corresponding path program 13 times [2024-06-28 01:39:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:39:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203174954] [2024-06-28 01:39:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:39:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:39:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:39:58,001 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-28 01:39:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:39:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203174954] [2024-06-28 01:39:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203174954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:39:58,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:39:58,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:39:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552275704] [2024-06-28 01:39:58,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:39:58,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:39:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:39:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:39:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:39:58,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:39:58,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 529 transitions, 11484 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:39:58,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:39:58,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:39:58,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:00,271 INFO L124 PetriNetUnfolderBase]: 3557/6641 cut-off events. [2024-06-28 01:40:00,271 INFO L125 PetriNetUnfolderBase]: For 225371/225445 co-relation queries the response was YES. [2024-06-28 01:40:00,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52629 conditions, 6641 events. 3557/6641 cut-off events. For 225371/225445 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 51691 event pairs, 699 based on Foata normal form. 88/6510 useless extension candidates. Maximal degree in co-relation 52452. Up to 4194 conditions per place. [2024-06-28 01:40:00,399 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 406 selfloop transitions, 174 changer transitions 0/588 dead transitions. [2024-06-28 01:40:00,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 588 transitions, 13014 flow [2024-06-28 01:40:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-28 01:40:00,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2024-06-28 01:40:00,401 INFO L175 Difference]: Start difference. First operand has 377 places, 529 transitions, 11484 flow. Second operand 10 states and 194 transitions. [2024-06-28 01:40:00,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 588 transitions, 13014 flow [2024-06-28 01:40:02,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 588 transitions, 12907 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-28 01:40:02,183 INFO L231 Difference]: Finished difference. Result has 383 places, 530 transitions, 11759 flow [2024-06-28 01:40:02,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11377, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11759, PETRI_PLACES=383, PETRI_TRANSITIONS=530} [2024-06-28 01:40:02,184 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 342 predicate places. [2024-06-28 01:40:02,184 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 530 transitions, 11759 flow [2024-06-28 01:40:02,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:02,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:02,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:02,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 01:40:02,186 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:02,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1079411475, now seen corresponding path program 14 times [2024-06-28 01:40:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:02,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985902456] [2024-06-28 01:40:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:02,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:02,851 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-28 01:40:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985902456] [2024-06-28 01:40:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985902456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:02,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:02,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:40:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810432056] [2024-06-28 01:40:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:02,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:40:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:02,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:40:02,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:40:02,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:02,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 530 transitions, 11759 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:02,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:02,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:02,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:04,821 INFO L124 PetriNetUnfolderBase]: 3582/6751 cut-off events. [2024-06-28 01:40:04,821 INFO L125 PetriNetUnfolderBase]: For 200553/200631 co-relation queries the response was YES. [2024-06-28 01:40:04,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53793 conditions, 6751 events. 3582/6751 cut-off events. For 200553/200631 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 53363 event pairs, 766 based on Foata normal form. 80/6599 useless extension candidates. Maximal degree in co-relation 53614. Up to 4962 conditions per place. [2024-06-28 01:40:04,925 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 414 selfloop transitions, 164 changer transitions 0/586 dead transitions. [2024-06-28 01:40:04,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 586 transitions, 13337 flow [2024-06-28 01:40:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-28 01:40:04,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-28 01:40:04,926 INFO L175 Difference]: Start difference. First operand has 383 places, 530 transitions, 11759 flow. Second operand 10 states and 182 transitions. [2024-06-28 01:40:04,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 586 transitions, 13337 flow [2024-06-28 01:40:06,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 586 transitions, 12970 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-28 01:40:06,716 INFO L231 Difference]: Finished difference. Result has 385 places, 534 transitions, 11835 flow [2024-06-28 01:40:06,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11392, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11835, PETRI_PLACES=385, PETRI_TRANSITIONS=534} [2024-06-28 01:40:06,718 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 344 predicate places. [2024-06-28 01:40:06,718 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 534 transitions, 11835 flow [2024-06-28 01:40:06,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:06,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:06,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:06,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 01:40:06,719 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:06,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1246579663, now seen corresponding path program 1 times [2024-06-28 01:40:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:06,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331739076] [2024-06-28 01:40:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:07,609 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-28 01:40:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331739076] [2024-06-28 01:40:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331739076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:07,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:07,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:40:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583614223] [2024-06-28 01:40:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:07,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:40:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:40:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:40:07,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:07,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 534 transitions, 11835 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:07,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:07,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:07,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:09,520 INFO L124 PetriNetUnfolderBase]: 3598/6439 cut-off events. [2024-06-28 01:40:09,520 INFO L125 PetriNetUnfolderBase]: For 202624/202710 co-relation queries the response was YES. [2024-06-28 01:40:09,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53348 conditions, 6439 events. 3598/6439 cut-off events. For 202624/202710 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 48153 event pairs, 1158 based on Foata normal form. 88/6358 useless extension candidates. Maximal degree in co-relation 53167. Up to 5684 conditions per place. [2024-06-28 01:40:09,626 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 521 selfloop transitions, 47 changer transitions 0/576 dead transitions. [2024-06-28 01:40:09,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 576 transitions, 13227 flow [2024-06-28 01:40:09,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 01:40:09,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-28 01:40:09,628 INFO L175 Difference]: Start difference. First operand has 385 places, 534 transitions, 11835 flow. Second operand 10 states and 171 transitions. [2024-06-28 01:40:09,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 576 transitions, 13227 flow [2024-06-28 01:40:11,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 576 transitions, 13069 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-28 01:40:11,512 INFO L231 Difference]: Finished difference. Result has 391 places, 535 transitions, 11794 flow [2024-06-28 01:40:11,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11677, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11794, PETRI_PLACES=391, PETRI_TRANSITIONS=535} [2024-06-28 01:40:11,513 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 350 predicate places. [2024-06-28 01:40:11,513 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 535 transitions, 11794 flow [2024-06-28 01:40:11,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:11,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:11,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:11,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 01:40:11,513 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:11,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1205554781, now seen corresponding path program 11 times [2024-06-28 01:40:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:11,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776682921] [2024-06-28 01:40:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:11,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:12,307 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-28 01:40:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776682921] [2024-06-28 01:40:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776682921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:40:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028879111] [2024-06-28 01:40:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:12,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:40:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:40:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:40:12,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:12,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 535 transitions, 11794 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:12,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:12,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:12,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:14,248 INFO L124 PetriNetUnfolderBase]: 3656/6531 cut-off events. [2024-06-28 01:40:14,248 INFO L125 PetriNetUnfolderBase]: For 203937/204024 co-relation queries the response was YES. [2024-06-28 01:40:14,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54183 conditions, 6531 events. 3656/6531 cut-off events. For 203937/204024 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 48897 event pairs, 1174 based on Foata normal form. 89/6455 useless extension candidates. Maximal degree in co-relation 54000. Up to 5721 conditions per place. [2024-06-28 01:40:14,350 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 540 selfloop transitions, 42 changer transitions 0/590 dead transitions. [2024-06-28 01:40:14,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 590 transitions, 13398 flow [2024-06-28 01:40:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:40:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:40:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-06-28 01:40:14,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2024-06-28 01:40:14,351 INFO L175 Difference]: Start difference. First operand has 391 places, 535 transitions, 11794 flow. Second operand 11 states and 189 transitions. [2024-06-28 01:40:14,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 590 transitions, 13398 flow [2024-06-28 01:40:16,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 590 transitions, 13293 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:40:16,030 INFO L231 Difference]: Finished difference. Result has 396 places, 543 transitions, 11965 flow [2024-06-28 01:40:16,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11689, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11965, PETRI_PLACES=396, PETRI_TRANSITIONS=543} [2024-06-28 01:40:16,031 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 355 predicate places. [2024-06-28 01:40:16,031 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 543 transitions, 11965 flow [2024-06-28 01:40:16,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:16,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:16,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:16,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 01:40:16,032 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:16,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1690146677, now seen corresponding path program 2 times [2024-06-28 01:40:16,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:16,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806644748] [2024-06-28 01:40:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:16,900 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-28 01:40:16,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:16,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806644748] [2024-06-28 01:40:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806644748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:40:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073172760] [2024-06-28 01:40:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:16,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:40:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:40:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:40:16,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:16,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 543 transitions, 11965 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:16,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:16,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:16,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:18,882 INFO L124 PetriNetUnfolderBase]: 3672/6542 cut-off events. [2024-06-28 01:40:18,882 INFO L125 PetriNetUnfolderBase]: For 206957/207044 co-relation queries the response was YES. [2024-06-28 01:40:18,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54415 conditions, 6542 events. 3672/6542 cut-off events. For 206957/207044 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 48847 event pairs, 1199 based on Foata normal form. 89/6462 useless extension candidates. Maximal degree in co-relation 54230. Up to 5925 conditions per place. [2024-06-28 01:40:18,996 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 542 selfloop transitions, 27 changer transitions 0/577 dead transitions. [2024-06-28 01:40:18,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 577 transitions, 13271 flow [2024-06-28 01:40:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 01:40:19,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2024-06-28 01:40:19,012 INFO L175 Difference]: Start difference. First operand has 396 places, 543 transitions, 11965 flow. Second operand 10 states and 166 transitions. [2024-06-28 01:40:19,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 577 transitions, 13271 flow [2024-06-28 01:40:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 577 transitions, 13150 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 01:40:21,431 INFO L231 Difference]: Finished difference. Result has 399 places, 544 transitions, 11923 flow [2024-06-28 01:40:21,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11844, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11923, PETRI_PLACES=399, PETRI_TRANSITIONS=544} [2024-06-28 01:40:21,432 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 358 predicate places. [2024-06-28 01:40:21,432 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 544 transitions, 11923 flow [2024-06-28 01:40:21,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:21,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:21,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:21,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 01:40:21,433 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:21,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash 292459313, now seen corresponding path program 3 times [2024-06-28 01:40:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172939786] [2024-06-28 01:40:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:22,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-28 01:40:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172939786] [2024-06-28 01:40:22,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172939786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:22,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:22,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:40:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503550502] [2024-06-28 01:40:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:22,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:40:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:40:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:40:22,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:22,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 544 transitions, 11923 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:22,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:22,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:22,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:24,834 INFO L124 PetriNetUnfolderBase]: 3688/6564 cut-off events. [2024-06-28 01:40:24,834 INFO L125 PetriNetUnfolderBase]: For 209056/209143 co-relation queries the response was YES. [2024-06-28 01:40:24,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54342 conditions, 6564 events. 3688/6564 cut-off events. For 209056/209143 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 49014 event pairs, 1208 based on Foata normal form. 89/6487 useless extension candidates. Maximal degree in co-relation 54156. Up to 5973 conditions per place. [2024-06-28 01:40:24,948 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 547 selfloop transitions, 24 changer transitions 0/579 dead transitions. [2024-06-28 01:40:24,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 579 transitions, 13275 flow [2024-06-28 01:40:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-28 01:40:24,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2024-06-28 01:40:24,950 INFO L175 Difference]: Start difference. First operand has 399 places, 544 transitions, 11923 flow. Second operand 10 states and 164 transitions. [2024-06-28 01:40:24,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 579 transitions, 13275 flow [2024-06-28 01:40:26,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 579 transitions, 13208 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:40:26,884 INFO L231 Difference]: Finished difference. Result has 402 places, 547 transitions, 11979 flow [2024-06-28 01:40:26,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11856, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11979, PETRI_PLACES=402, PETRI_TRANSITIONS=547} [2024-06-28 01:40:26,885 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 361 predicate places. [2024-06-28 01:40:26,885 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 547 transitions, 11979 flow [2024-06-28 01:40:26,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:26,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:26,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:26,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 01:40:26,886 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:26,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1205554595, now seen corresponding path program 15 times [2024-06-28 01:40:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56925750] [2024-06-28 01:40:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:40:27,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56925750] [2024-06-28 01:40:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56925750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:27,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:27,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:40:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128038317] [2024-06-28 01:40:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:27,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:40:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:27,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:40:27,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:40:27,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:27,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 547 transitions, 11979 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:27,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:27,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:27,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:29,999 INFO L124 PetriNetUnfolderBase]: 3788/6761 cut-off events. [2024-06-28 01:40:30,000 INFO L125 PetriNetUnfolderBase]: For 253791/253878 co-relation queries the response was YES. [2024-06-28 01:40:30,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55185 conditions, 6761 events. 3788/6761 cut-off events. For 253791/253878 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 50910 event pairs, 1208 based on Foata normal form. 101/6697 useless extension candidates. Maximal degree in co-relation 54997. Up to 5763 conditions per place. [2024-06-28 01:40:30,123 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 545 selfloop transitions, 39 changer transitions 0/592 dead transitions. [2024-06-28 01:40:30,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 592 transitions, 13412 flow [2024-06-28 01:40:30,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-28 01:40:30,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-06-28 01:40:30,124 INFO L175 Difference]: Start difference. First operand has 402 places, 547 transitions, 11979 flow. Second operand 10 states and 176 transitions. [2024-06-28 01:40:30,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 592 transitions, 13412 flow [2024-06-28 01:40:32,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 592 transitions, 13349 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 01:40:32,013 INFO L231 Difference]: Finished difference. Result has 405 places, 548 transitions, 12032 flow [2024-06-28 01:40:32,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11916, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12032, PETRI_PLACES=405, PETRI_TRANSITIONS=548} [2024-06-28 01:40:32,016 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 364 predicate places. [2024-06-28 01:40:32,016 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 548 transitions, 12032 flow [2024-06-28 01:40:32,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:32,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:32,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:32,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 01:40:32,016 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:32,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2071559371, now seen corresponding path program 4 times [2024-06-28 01:40:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656036282] [2024-06-28 01:40:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:32,983 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-28 01:40:32,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:32,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656036282] [2024-06-28 01:40:32,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656036282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:32,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:32,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:40:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712031356] [2024-06-28 01:40:32,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:32,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:40:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:40:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:40:33,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:33,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 548 transitions, 12032 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:33,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:33,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:33,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:35,253 INFO L124 PetriNetUnfolderBase]: 3804/6806 cut-off events. [2024-06-28 01:40:35,253 INFO L125 PetriNetUnfolderBase]: For 218569/218655 co-relation queries the response was YES. [2024-06-28 01:40:35,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55465 conditions, 6806 events. 3804/6806 cut-off events. For 218569/218655 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51451 event pairs, 1241 based on Foata normal form. 88/6720 useless extension candidates. Maximal degree in co-relation 55276. Up to 6123 conditions per place. [2024-06-28 01:40:35,370 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 546 selfloop transitions, 34 changer transitions 0/588 dead transitions. [2024-06-28 01:40:35,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 588 transitions, 13424 flow [2024-06-28 01:40:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-28 01:40:35,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-06-28 01:40:35,371 INFO L175 Difference]: Start difference. First operand has 405 places, 548 transitions, 12032 flow. Second operand 10 states and 169 transitions. [2024-06-28 01:40:35,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 588 transitions, 13424 flow [2024-06-28 01:40:37,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 588 transitions, 13339 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:40:37,306 INFO L231 Difference]: Finished difference. Result has 407 places, 549 transitions, 12044 flow [2024-06-28 01:40:37,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11947, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12044, PETRI_PLACES=407, PETRI_TRANSITIONS=549} [2024-06-28 01:40:37,307 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 366 predicate places. [2024-06-28 01:40:37,307 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 549 transitions, 12044 flow [2024-06-28 01:40:37,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:37,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:37,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:37,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-28 01:40:37,307 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:37,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1518597431, now seen corresponding path program 12 times [2024-06-28 01:40:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668295173] [2024-06-28 01:40:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:38,241 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-28 01:40:38,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668295173] [2024-06-28 01:40:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668295173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:40:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382344366] [2024-06-28 01:40:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:38,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:40:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:40:38,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:40:38,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:38,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 549 transitions, 12044 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:38,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:38,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:38,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:40,288 INFO L124 PetriNetUnfolderBase]: 3817/6806 cut-off events. [2024-06-28 01:40:40,288 INFO L125 PetriNetUnfolderBase]: For 216985/217072 co-relation queries the response was YES. [2024-06-28 01:40:40,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55463 conditions, 6806 events. 3817/6806 cut-off events. For 216985/217072 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51278 event pairs, 1276 based on Foata normal form. 90/6729 useless extension candidates. Maximal degree in co-relation 55273. Up to 6159 conditions per place. [2024-06-28 01:40:40,407 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 552 selfloop transitions, 30 changer transitions 0/590 dead transitions. [2024-06-28 01:40:40,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 590 transitions, 13503 flow [2024-06-28 01:40:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-28 01:40:40,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2024-06-28 01:40:40,408 INFO L175 Difference]: Start difference. First operand has 407 places, 549 transitions, 12044 flow. Second operand 10 states and 168 transitions. [2024-06-28 01:40:40,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 590 transitions, 13503 flow [2024-06-28 01:40:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 590 transitions, 13401 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-28 01:40:42,276 INFO L231 Difference]: Finished difference. Result has 412 places, 558 transitions, 12191 flow [2024-06-28 01:40:42,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11942, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12191, PETRI_PLACES=412, PETRI_TRANSITIONS=558} [2024-06-28 01:40:42,276 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 371 predicate places. [2024-06-28 01:40:42,276 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 558 transitions, 12191 flow [2024-06-28 01:40:42,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:42,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:42,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:42,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-28 01:40:42,277 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:42,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1994610077, now seen corresponding path program 5 times [2024-06-28 01:40:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306689928] [2024-06-28 01:40:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:43,091 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-28 01:40:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306689928] [2024-06-28 01:40:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306689928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:43,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:43,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:40:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439459809] [2024-06-28 01:40:43,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:43,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:40:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:40:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:40:43,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:43,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 558 transitions, 12191 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:43,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:43,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:43,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:45,429 INFO L124 PetriNetUnfolderBase]: 3822/6818 cut-off events. [2024-06-28 01:40:45,430 INFO L125 PetriNetUnfolderBase]: For 211996/212083 co-relation queries the response was YES. [2024-06-28 01:40:45,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55734 conditions, 6818 events. 3822/6818 cut-off events. For 211996/212083 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51287 event pairs, 1273 based on Foata normal form. 89/6736 useless extension candidates. Maximal degree in co-relation 55541. Up to 6213 conditions per place. [2024-06-28 01:40:45,568 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 557 selfloop transitions, 27 changer transitions 0/592 dead transitions. [2024-06-28 01:40:45,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 592 transitions, 13525 flow [2024-06-28 01:40:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-28 01:40:45,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2024-06-28 01:40:45,569 INFO L175 Difference]: Start difference. First operand has 412 places, 558 transitions, 12191 flow. Second operand 10 states and 165 transitions. [2024-06-28 01:40:45,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 592 transitions, 13525 flow [2024-06-28 01:40:47,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 592 transitions, 13407 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-28 01:40:47,506 INFO L231 Difference]: Finished difference. Result has 418 places, 561 transitions, 12189 flow [2024-06-28 01:40:47,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12073, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12189, PETRI_PLACES=418, PETRI_TRANSITIONS=561} [2024-06-28 01:40:47,507 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 377 predicate places. [2024-06-28 01:40:47,507 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 561 transitions, 12189 flow [2024-06-28 01:40:47,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:47,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:47,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:47,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-28 01:40:47,508 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:47,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1051885401, now seen corresponding path program 13 times [2024-06-28 01:40:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466142919] [2024-06-28 01:40:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:48,311 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-28 01:40:48,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:48,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466142919] [2024-06-28 01:40:48,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466142919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:48,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:48,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:40:48,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727989333] [2024-06-28 01:40:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:48,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:40:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:40:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:40:48,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:48,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 561 transitions, 12189 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:48,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:48,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:48,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:50,478 INFO L124 PetriNetUnfolderBase]: 3880/7004 cut-off events. [2024-06-28 01:40:50,478 INFO L125 PetriNetUnfolderBase]: For 221329/221414 co-relation queries the response was YES. [2024-06-28 01:40:50,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56946 conditions, 7004 events. 3880/7004 cut-off events. For 221329/221414 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 53599 event pairs, 1231 based on Foata normal form. 87/6899 useless extension candidates. Maximal degree in co-relation 56751. Up to 5844 conditions per place. [2024-06-28 01:40:50,594 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 535 selfloop transitions, 78 changer transitions 0/621 dead transitions. [2024-06-28 01:40:50,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 621 transitions, 13911 flow [2024-06-28 01:40:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:40:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:40:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-28 01:40:50,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157248157248156 [2024-06-28 01:40:50,595 INFO L175 Difference]: Start difference. First operand has 418 places, 561 transitions, 12189 flow. Second operand 11 states and 196 transitions. [2024-06-28 01:40:50,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 621 transitions, 13911 flow [2024-06-28 01:40:52,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 621 transitions, 13823 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-28 01:40:52,467 INFO L231 Difference]: Finished difference. Result has 423 places, 569 transitions, 12461 flow [2024-06-28 01:40:52,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12101, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12461, PETRI_PLACES=423, PETRI_TRANSITIONS=569} [2024-06-28 01:40:52,467 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 382 predicate places. [2024-06-28 01:40:52,468 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 569 transitions, 12461 flow [2024-06-28 01:40:52,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:52,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:52,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:52,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-28 01:40:52,468 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:52,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2071313107, now seen corresponding path program 16 times [2024-06-28 01:40:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:52,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246865605] [2024-06-28 01:40:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:53,326 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-28 01:40:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246865605] [2024-06-28 01:40:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246865605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:53,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:53,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:40:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415842464] [2024-06-28 01:40:53,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:53,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:40:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:40:53,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:40:53,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:53,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 569 transitions, 12461 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:53,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:53,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:53,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:40:55,640 INFO L124 PetriNetUnfolderBase]: 3980/7174 cut-off events. [2024-06-28 01:40:55,640 INFO L125 PetriNetUnfolderBase]: For 272742/272827 co-relation queries the response was YES. [2024-06-28 01:40:55,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58099 conditions, 7174 events. 3980/7174 cut-off events. For 272742/272827 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 55118 event pairs, 1252 based on Foata normal form. 99/7084 useless extension candidates. Maximal degree in co-relation 57902. Up to 5830 conditions per place. [2024-06-28 01:40:55,762 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 538 selfloop transitions, 75 changer transitions 0/621 dead transitions. [2024-06-28 01:40:55,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 621 transitions, 14033 flow [2024-06-28 01:40:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:40:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:40:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 01:40:55,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-28 01:40:55,763 INFO L175 Difference]: Start difference. First operand has 423 places, 569 transitions, 12461 flow. Second operand 10 states and 183 transitions. [2024-06-28 01:40:55,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 621 transitions, 14033 flow [2024-06-28 01:40:57,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 621 transitions, 13822 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-28 01:40:57,823 INFO L231 Difference]: Finished difference. Result has 425 places, 570 transitions, 12440 flow [2024-06-28 01:40:57,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12250, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12440, PETRI_PLACES=425, PETRI_TRANSITIONS=570} [2024-06-28 01:40:57,823 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 384 predicate places. [2024-06-28 01:40:57,824 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 570 transitions, 12440 flow [2024-06-28 01:40:57,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:57,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:40:57,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:40:57,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-28 01:40:57,824 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:40:57,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:40:57,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2065057183, now seen corresponding path program 14 times [2024-06-28 01:40:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:40:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973999227] [2024-06-28 01:40:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:40:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:40:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:40:58,591 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-28 01:40:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:40:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973999227] [2024-06-28 01:40:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973999227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:40:58,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:40:58,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:40:58,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512487312] [2024-06-28 01:40:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:40:58,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:40:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:40:58,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:40:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:40:58,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:40:58,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 570 transitions, 12440 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:40:58,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:40:58,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:40:58,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:01,069 INFO L124 PetriNetUnfolderBase]: 4013/7228 cut-off events. [2024-06-28 01:41:01,069 INFO L125 PetriNetUnfolderBase]: For 230529/230615 co-relation queries the response was YES. [2024-06-28 01:41:01,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58461 conditions, 7228 events. 4013/7228 cut-off events. For 230529/230615 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 55556 event pairs, 1257 based on Foata normal form. 88/7131 useless extension candidates. Maximal degree in co-relation 58263. Up to 6099 conditions per place. [2024-06-28 01:41:01,183 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 537 selfloop transitions, 81 changer transitions 0/626 dead transitions. [2024-06-28 01:41:01,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 626 transitions, 14112 flow [2024-06-28 01:41:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:41:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:41:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-28 01:41:01,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742014742014742 [2024-06-28 01:41:01,185 INFO L175 Difference]: Start difference. First operand has 425 places, 570 transitions, 12440 flow. Second operand 11 states and 193 transitions. [2024-06-28 01:41:01,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 626 transitions, 14112 flow [2024-06-28 01:41:03,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 626 transitions, 13953 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-28 01:41:03,297 INFO L231 Difference]: Finished difference. Result has 429 places, 574 transitions, 12574 flow [2024-06-28 01:41:03,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12281, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12574, PETRI_PLACES=429, PETRI_TRANSITIONS=574} [2024-06-28 01:41:03,317 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 388 predicate places. [2024-06-28 01:41:03,317 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 574 transitions, 12574 flow [2024-06-28 01:41:03,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:03,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:03,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:03,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-28 01:41:03,317 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:03,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:03,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2064879367, now seen corresponding path program 17 times [2024-06-28 01:41:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:03,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311615566] [2024-06-28 01:41:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:04,009 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-28 01:41:04,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:04,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311615566] [2024-06-28 01:41:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311615566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:04,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:04,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:41:04,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111413180] [2024-06-28 01:41:04,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:04,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:41:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:04,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:41:04,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:41:04,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:04,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 574 transitions, 12574 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:04,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:04,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:04,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:06,718 INFO L124 PetriNetUnfolderBase]: 4129/7492 cut-off events. [2024-06-28 01:41:06,718 INFO L125 PetriNetUnfolderBase]: For 283382/283468 co-relation queries the response was YES. [2024-06-28 01:41:06,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60662 conditions, 7492 events. 4129/7492 cut-off events. For 283382/283468 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 58277 event pairs, 1199 based on Foata normal form. 88/7384 useless extension candidates. Maximal degree in co-relation 60462. Up to 5411 conditions per place. [2024-06-28 01:41:06,887 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 530 selfloop transitions, 89 changer transitions 0/627 dead transitions. [2024-06-28 01:41:06,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 627 transitions, 14343 flow [2024-06-28 01:41:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:41:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:41:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 01:41:06,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-28 01:41:06,889 INFO L175 Difference]: Start difference. First operand has 429 places, 574 transitions, 12574 flow. Second operand 10 states and 183 transitions. [2024-06-28 01:41:06,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 627 transitions, 14343 flow [2024-06-28 01:41:09,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 627 transitions, 14103 flow, removed 34 selfloop flow, removed 9 redundant places. [2024-06-28 01:41:09,966 INFO L231 Difference]: Finished difference. Result has 430 places, 575 transitions, 12545 flow [2024-06-28 01:41:09,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12334, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12545, PETRI_PLACES=430, PETRI_TRANSITIONS=575} [2024-06-28 01:41:09,967 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 389 predicate places. [2024-06-28 01:41:09,967 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 575 transitions, 12545 flow [2024-06-28 01:41:09,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:09,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:09,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:09,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-28 01:41:09,968 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:09,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2064884203, now seen corresponding path program 15 times [2024-06-28 01:41:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804940011] [2024-06-28 01:41:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:10,742 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-28 01:41:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804940011] [2024-06-28 01:41:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804940011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:41:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263780424] [2024-06-28 01:41:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:10,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:41:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:41:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:41:10,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:10,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 575 transitions, 12545 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:10,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:10,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:13,422 INFO L124 PetriNetUnfolderBase]: 4144/7572 cut-off events. [2024-06-28 01:41:13,422 INFO L125 PetriNetUnfolderBase]: For 278200/278285 co-relation queries the response was YES. [2024-06-28 01:41:13,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60692 conditions, 7572 events. 4144/7572 cut-off events. For 278200/278285 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 59269 event pairs, 1243 based on Foata normal form. 87/7447 useless extension candidates. Maximal degree in co-relation 60493. Up to 5879 conditions per place. [2024-06-28 01:41:13,548 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 501 selfloop transitions, 129 changer transitions 0/638 dead transitions. [2024-06-28 01:41:13,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 638 transitions, 14417 flow [2024-06-28 01:41:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:41:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:41:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-06-28 01:41:13,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2024-06-28 01:41:13,549 INFO L175 Difference]: Start difference. First operand has 430 places, 575 transitions, 12545 flow. Second operand 12 states and 208 transitions. [2024-06-28 01:41:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 638 transitions, 14417 flow [2024-06-28 01:41:16,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 638 transitions, 14211 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-28 01:41:16,045 INFO L231 Difference]: Finished difference. Result has 437 places, 584 transitions, 12930 flow [2024-06-28 01:41:16,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12359, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12930, PETRI_PLACES=437, PETRI_TRANSITIONS=584} [2024-06-28 01:41:16,046 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 396 predicate places. [2024-06-28 01:41:16,046 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 584 transitions, 12930 flow [2024-06-28 01:41:16,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:16,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:16,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:16,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-28 01:41:16,047 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:16,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2064884017, now seen corresponding path program 18 times [2024-06-28 01:41:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812746720] [2024-06-28 01:41:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:16,734 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-28 01:41:16,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:16,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812746720] [2024-06-28 01:41:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812746720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:16,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:41:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684801488] [2024-06-28 01:41:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:16,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:41:16,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:41:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:41:16,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:16,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 584 transitions, 12930 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:16,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:16,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:16,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:19,296 INFO L124 PetriNetUnfolderBase]: 4125/7501 cut-off events. [2024-06-28 01:41:19,296 INFO L125 PetriNetUnfolderBase]: For 273773/273858 co-relation queries the response was YES. [2024-06-28 01:41:19,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59621 conditions, 7501 events. 4125/7501 cut-off events. For 273773/273858 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58402 event pairs, 1251 based on Foata normal form. 99/7395 useless extension candidates. Maximal degree in co-relation 59419. Up to 5919 conditions per place. [2024-06-28 01:41:19,426 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 545 selfloop transitions, 90 changer transitions 0/643 dead transitions. [2024-06-28 01:41:19,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 643 transitions, 14577 flow [2024-06-28 01:41:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:41:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:41:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-06-28 01:41:19,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49385749385749383 [2024-06-28 01:41:19,428 INFO L175 Difference]: Start difference. First operand has 437 places, 584 transitions, 12930 flow. Second operand 11 states and 201 transitions. [2024-06-28 01:41:19,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 643 transitions, 14577 flow [2024-06-28 01:41:22,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 643 transitions, 14199 flow, removed 70 selfloop flow, removed 8 redundant places. [2024-06-28 01:41:22,164 INFO L231 Difference]: Finished difference. Result has 440 places, 584 transitions, 12742 flow [2024-06-28 01:41:22,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12552, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12742, PETRI_PLACES=440, PETRI_TRANSITIONS=584} [2024-06-28 01:41:22,165 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 399 predicate places. [2024-06-28 01:41:22,165 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 584 transitions, 12742 flow [2024-06-28 01:41:22,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:22,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:22,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:22,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-28 01:41:22,166 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:22,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2120667099, now seen corresponding path program 19 times [2024-06-28 01:41:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:22,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404698581] [2024-06-28 01:41:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:22,871 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-28 01:41:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404698581] [2024-06-28 01:41:22,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404698581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:22,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:22,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:41:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532163477] [2024-06-28 01:41:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:22,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:41:22,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:22,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:41:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:41:22,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:22,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 584 transitions, 12742 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:22,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:22,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:22,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:25,988 INFO L124 PetriNetUnfolderBase]: 4785/8823 cut-off events. [2024-06-28 01:41:25,988 INFO L125 PetriNetUnfolderBase]: For 238616/238716 co-relation queries the response was YES. [2024-06-28 01:41:26,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69623 conditions, 8823 events. 4785/8823 cut-off events. For 238616/238716 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 71658 event pairs, 1205 based on Foata normal form. 102/8673 useless extension candidates. Maximal degree in co-relation 69422. Up to 5597 conditions per place. [2024-06-28 01:41:26,148 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 515 selfloop transitions, 257 changer transitions 0/780 dead transitions. [2024-06-28 01:41:26,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 780 transitions, 18002 flow [2024-06-28 01:41:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:41:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:41:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 249 transitions. [2024-06-28 01:41:26,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5176715176715176 [2024-06-28 01:41:26,151 INFO L175 Difference]: Start difference. First operand has 440 places, 584 transitions, 12742 flow. Second operand 13 states and 249 transitions. [2024-06-28 01:41:26,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 780 transitions, 18002 flow [2024-06-28 01:41:28,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 780 transitions, 17753 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-28 01:41:28,746 INFO L231 Difference]: Finished difference. Result has 450 places, 682 transitions, 15965 flow [2024-06-28 01:41:28,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12538, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15965, PETRI_PLACES=450, PETRI_TRANSITIONS=682} [2024-06-28 01:41:28,746 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 409 predicate places. [2024-06-28 01:41:28,747 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 682 transitions, 15965 flow [2024-06-28 01:41:28,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:28,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:28,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:28,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-28 01:41:28,747 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:28,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2146728479, now seen corresponding path program 20 times [2024-06-28 01:41:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:28,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167413700] [2024-06-28 01:41:28,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:29,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-28 01:41:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:29,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167413700] [2024-06-28 01:41:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167413700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:29,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:29,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:41:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953266697] [2024-06-28 01:41:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:29,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:41:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:41:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:41:29,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:29,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 682 transitions, 15965 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:29,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:29,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:29,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:32,479 INFO L124 PetriNetUnfolderBase]: 4810/8958 cut-off events. [2024-06-28 01:41:32,480 INFO L125 PetriNetUnfolderBase]: For 250278/250382 co-relation queries the response was YES. [2024-06-28 01:41:32,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72402 conditions, 8958 events. 4810/8958 cut-off events. For 250278/250382 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 73688 event pairs, 1236 based on Foata normal form. 106/8783 useless extension candidates. Maximal degree in co-relation 72193. Up to 6246 conditions per place. [2024-06-28 01:41:32,640 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 581 selfloop transitions, 176 changer transitions 0/765 dead transitions. [2024-06-28 01:41:32,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 765 transitions, 18575 flow [2024-06-28 01:41:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:41:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:41:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2024-06-28 01:41:32,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257985257985258 [2024-06-28 01:41:32,642 INFO L175 Difference]: Start difference. First operand has 450 places, 682 transitions, 15965 flow. Second operand 11 states and 214 transitions. [2024-06-28 01:41:32,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 765 transitions, 18575 flow [2024-06-28 01:41:35,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 765 transitions, 18558 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:41:35,299 INFO L231 Difference]: Finished difference. Result has 461 places, 686 transitions, 16403 flow [2024-06-28 01:41:35,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15948, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16403, PETRI_PLACES=461, PETRI_TRANSITIONS=686} [2024-06-28 01:41:35,300 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 420 predicate places. [2024-06-28 01:41:35,300 INFO L495 AbstractCegarLoop]: Abstraction has has 461 places, 686 transitions, 16403 flow [2024-06-28 01:41:35,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:35,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:35,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:35,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-28 01:41:35,301 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:35,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash -679855289, now seen corresponding path program 21 times [2024-06-28 01:41:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980516200] [2024-06-28 01:41:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:35,908 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-28 01:41:35,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:35,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980516200] [2024-06-28 01:41:35,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980516200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:41:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698790106] [2024-06-28 01:41:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:35,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:41:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:41:35,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:41:35,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:36,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 686 transitions, 16403 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:36,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:36,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:36,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:39,042 INFO L124 PetriNetUnfolderBase]: 5004/9548 cut-off events. [2024-06-28 01:41:39,042 INFO L125 PetriNetUnfolderBase]: For 264560/264698 co-relation queries the response was YES. [2024-06-28 01:41:39,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77745 conditions, 9548 events. 5004/9548 cut-off events. For 264560/264698 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 80866 event pairs, 1040 based on Foata normal form. 140/9353 useless extension candidates. Maximal degree in co-relation 77532. Up to 6300 conditions per place. [2024-06-28 01:41:39,227 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 505 selfloop transitions, 288 changer transitions 0/801 dead transitions. [2024-06-28 01:41:39,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 801 transitions, 20080 flow [2024-06-28 01:41:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:41:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:41:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:41:39,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:41:39,228 INFO L175 Difference]: Start difference. First operand has 461 places, 686 transitions, 16403 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:41:39,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 801 transitions, 20080 flow [2024-06-28 01:41:42,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 801 transitions, 19771 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:42,013 INFO L231 Difference]: Finished difference. Result has 469 places, 747 transitions, 18596 flow [2024-06-28 01:41:42,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16094, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18596, PETRI_PLACES=469, PETRI_TRANSITIONS=747} [2024-06-28 01:41:42,014 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 428 predicate places. [2024-06-28 01:41:42,014 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 747 transitions, 18596 flow [2024-06-28 01:41:42,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:42,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:42,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:42,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-28 01:41:42,015 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:42,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2019842732, now seen corresponding path program 1 times [2024-06-28 01:41:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247530678] [2024-06-28 01:41:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:42,781 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-28 01:41:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:42,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247530678] [2024-06-28 01:41:42,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247530678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:42,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:42,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:41:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326792763] [2024-06-28 01:41:42,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:42,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:41:42,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:42,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:41:42,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:41:42,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:42,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 747 transitions, 18596 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:42,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:42,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:42,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:46,034 INFO L124 PetriNetUnfolderBase]: 5196/9493 cut-off events. [2024-06-28 01:41:46,034 INFO L125 PetriNetUnfolderBase]: For 350426/350551 co-relation queries the response was YES. [2024-06-28 01:41:46,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81888 conditions, 9493 events. 5196/9493 cut-off events. For 350426/350551 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 77472 event pairs, 968 based on Foata normal form. 133/9393 useless extension candidates. Maximal degree in co-relation 81670. Up to 4250 conditions per place. [2024-06-28 01:41:46,238 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 494 selfloop transitions, 315 changer transitions 0/817 dead transitions. [2024-06-28 01:41:46,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 817 transitions, 20862 flow [2024-06-28 01:41:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:41:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:41:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-28 01:41:46,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-28 01:41:46,239 INFO L175 Difference]: Start difference. First operand has 469 places, 747 transitions, 18596 flow. Second operand 11 states and 212 transitions. [2024-06-28 01:41:46,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 817 transitions, 20862 flow [2024-06-28 01:41:50,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 817 transitions, 20606 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:50,639 INFO L231 Difference]: Finished difference. Result has 479 places, 756 transitions, 19322 flow [2024-06-28 01:41:50,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18340, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19322, PETRI_PLACES=479, PETRI_TRANSITIONS=756} [2024-06-28 01:41:50,640 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 438 predicate places. [2024-06-28 01:41:50,640 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 756 transitions, 19322 flow [2024-06-28 01:41:50,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:50,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:50,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:50,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-28 01:41:50,641 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:50,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -474258614, now seen corresponding path program 2 times [2024-06-28 01:41:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575308925] [2024-06-28 01:41:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:51,433 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-28 01:41:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575308925] [2024-06-28 01:41:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575308925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:41:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411084021] [2024-06-28 01:41:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:51,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:41:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:41:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:41:51,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:41:51,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 756 transitions, 19322 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:51,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:51,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:41:51,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:55,425 INFO L124 PetriNetUnfolderBase]: 5329/9975 cut-off events. [2024-06-28 01:41:55,426 INFO L125 PetriNetUnfolderBase]: For 420117/420259 co-relation queries the response was YES. [2024-06-28 01:41:55,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85847 conditions, 9975 events. 5329/9975 cut-off events. For 420117/420259 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 83639 event pairs, 950 based on Foata normal form. 150/9811 useless extension candidates. Maximal degree in co-relation 85626. Up to 3596 conditions per place. [2024-06-28 01:41:55,634 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 466 selfloop transitions, 355 changer transitions 0/829 dead transitions. [2024-06-28 01:41:55,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 829 transitions, 21655 flow [2024-06-28 01:41:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:41:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:41:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-28 01:41:55,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2024-06-28 01:41:55,635 INFO L175 Difference]: Start difference. First operand has 479 places, 756 transitions, 19322 flow. Second operand 12 states and 237 transitions. [2024-06-28 01:41:55,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 829 transitions, 21655 flow [2024-06-28 01:41:59,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 829 transitions, 21270 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:41:59,742 INFO L231 Difference]: Finished difference. Result has 484 places, 758 transitions, 19687 flow [2024-06-28 01:41:59,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18937, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=353, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19687, PETRI_PLACES=484, PETRI_TRANSITIONS=758} [2024-06-28 01:41:59,743 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 443 predicate places. [2024-06-28 01:41:59,743 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 758 transitions, 19687 flow [2024-06-28 01:41:59,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:59,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:59,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:59,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-28 01:41:59,744 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:59,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash -470683694, now seen corresponding path program 3 times [2024-06-28 01:41:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:59,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444743185] [2024-06-28 01:41:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:00,676 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-28 01:42:00,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:00,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444743185] [2024-06-28 01:42:00,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444743185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:00,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:42:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626997949] [2024-06-28 01:42:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:00,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:42:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:42:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:42:00,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:42:00,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 758 transitions, 19687 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:00,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:00,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:42:00,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:05,004 INFO L124 PetriNetUnfolderBase]: 5281/9899 cut-off events. [2024-06-28 01:42:05,005 INFO L125 PetriNetUnfolderBase]: For 374624/374767 co-relation queries the response was YES. [2024-06-28 01:42:05,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85231 conditions, 9899 events. 5281/9899 cut-off events. For 374624/374767 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 82967 event pairs, 863 based on Foata normal form. 151/9738 useless extension candidates. Maximal degree in co-relation 85008. Up to 3821 conditions per place. [2024-06-28 01:42:05,179 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 453 selfloop transitions, 374 changer transitions 0/835 dead transitions. [2024-06-28 01:42:05,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 835 transitions, 22081 flow [2024-06-28 01:42:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:42:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:42:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 250 transitions. [2024-06-28 01:42:05,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197505197505198 [2024-06-28 01:42:05,180 INFO L175 Difference]: Start difference. First operand has 484 places, 758 transitions, 19687 flow. Second operand 13 states and 250 transitions. [2024-06-28 01:42:05,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 835 transitions, 22081 flow [2024-06-28 01:42:08,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 835 transitions, 21393 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:08,970 INFO L231 Difference]: Finished difference. Result has 490 places, 759 transitions, 19798 flow [2024-06-28 01:42:08,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18999, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=373, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=19798, PETRI_PLACES=490, PETRI_TRANSITIONS=759} [2024-06-28 01:42:08,971 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 449 predicate places. [2024-06-28 01:42:08,971 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 759 transitions, 19798 flow [2024-06-28 01:42:08,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:08,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:08,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:08,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-28 01:42:08,971 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:08,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -354489126, now seen corresponding path program 4 times [2024-06-28 01:42:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883348532] [2024-06-28 01:42:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:09,776 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-28 01:42:09,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:09,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883348532] [2024-06-28 01:42:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883348532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:09,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:09,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:42:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759627956] [2024-06-28 01:42:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:09,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:42:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:42:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:42:09,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:42:09,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 759 transitions, 19798 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:09,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:09,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:42:09,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:13,827 INFO L124 PetriNetUnfolderBase]: 5365/9900 cut-off events. [2024-06-28 01:42:13,828 INFO L125 PetriNetUnfolderBase]: For 389466/389598 co-relation queries the response was YES. [2024-06-28 01:42:13,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86071 conditions, 9900 events. 5365/9900 cut-off events. For 389466/389598 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 82310 event pairs, 1020 based on Foata normal form. 142/9767 useless extension candidates. Maximal degree in co-relation 85846. Up to 5128 conditions per place. [2024-06-28 01:42:14,022 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 406 selfloop transitions, 400 changer transitions 0/814 dead transitions. [2024-06-28 01:42:14,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 814 transitions, 21764 flow [2024-06-28 01:42:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:42:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:42:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-28 01:42:14,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085995085995086 [2024-06-28 01:42:14,024 INFO L175 Difference]: Start difference. First operand has 490 places, 759 transitions, 19798 flow. Second operand 11 states and 207 transitions. [2024-06-28 01:42:14,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 814 transitions, 21764 flow [2024-06-28 01:42:17,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 814 transitions, 21099 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:42:17,751 INFO L231 Difference]: Finished difference. Result has 492 places, 759 transitions, 19939 flow [2024-06-28 01:42:17,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19133, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=400, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19939, PETRI_PLACES=492, PETRI_TRANSITIONS=759} [2024-06-28 01:42:17,751 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 451 predicate places. [2024-06-28 01:42:17,752 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 759 transitions, 19939 flow [2024-06-28 01:42:17,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:17,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:17,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:17,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-28 01:42:17,752 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:17,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -354494706, now seen corresponding path program 5 times [2024-06-28 01:42:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:17,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418911733] [2024-06-28 01:42:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:18,596 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-28 01:42:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418911733] [2024-06-28 01:42:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418911733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:42:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769728713] [2024-06-28 01:42:18,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:18,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:42:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:42:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:42:18,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:42:18,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 759 transitions, 19939 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:18,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:18,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:42:18,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:22,929 INFO L124 PetriNetUnfolderBase]: 5417/10148 cut-off events. [2024-06-28 01:42:22,929 INFO L125 PetriNetUnfolderBase]: For 385666/385805 co-relation queries the response was YES. [2024-06-28 01:42:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87080 conditions, 10148 events. 5417/10148 cut-off events. For 385666/385805 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 85688 event pairs, 980 based on Foata normal form. 147/9986 useless extension candidates. Maximal degree in co-relation 86854. Up to 4500 conditions per place. [2024-06-28 01:42:23,121 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 457 selfloop transitions, 373 changer transitions 0/838 dead transitions. [2024-06-28 01:42:23,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 838 transitions, 22363 flow [2024-06-28 01:42:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:42:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:42:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 262 transitions. [2024-06-28 01:42:23,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057915057915058 [2024-06-28 01:42:23,122 INFO L175 Difference]: Start difference. First operand has 492 places, 759 transitions, 19939 flow. Second operand 14 states and 262 transitions. [2024-06-28 01:42:23,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 838 transitions, 22363 flow [2024-06-28 01:42:26,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 838 transitions, 21582 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:26,945 INFO L231 Difference]: Finished difference. Result has 498 places, 759 transitions, 19917 flow [2024-06-28 01:42:26,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19158, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=373, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=19917, PETRI_PLACES=498, PETRI_TRANSITIONS=759} [2024-06-28 01:42:26,946 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 457 predicate places. [2024-06-28 01:42:26,946 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 759 transitions, 19917 flow [2024-06-28 01:42:26,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:26,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:26,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:26,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-28 01:42:26,947 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:26,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1379807352, now seen corresponding path program 6 times [2024-06-28 01:42:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242845669] [2024-06-28 01:42:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:27,977 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-28 01:42:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242845669] [2024-06-28 01:42:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242845669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:27,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:27,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:42:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290769451] [2024-06-28 01:42:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:27,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:42:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:42:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:42:28,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:42:28,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 759 transitions, 19917 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:28,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:28,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:42:28,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:32,324 INFO L124 PetriNetUnfolderBase]: 5485/10479 cut-off events. [2024-06-28 01:42:32,325 INFO L125 PetriNetUnfolderBase]: For 405904/406013 co-relation queries the response was YES. [2024-06-28 01:42:32,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88156 conditions, 10479 events. 5485/10479 cut-off events. For 405904/406013 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 90613 event pairs, 1311 based on Foata normal form. 119/10235 useless extension candidates. Maximal degree in co-relation 87929. Up to 7329 conditions per place. [2024-06-28 01:42:32,532 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 605 selfloop transitions, 208 changer transitions 0/821 dead transitions. [2024-06-28 01:42:32,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 821 transitions, 21997 flow [2024-06-28 01:42:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:42:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:42:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2024-06-28 01:42:32,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49774774774774777 [2024-06-28 01:42:32,533 INFO L175 Difference]: Start difference. First operand has 498 places, 759 transitions, 19917 flow. Second operand 12 states and 221 transitions. [2024-06-28 01:42:32,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 821 transitions, 21997 flow [2024-06-28 01:42:36,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 821 transitions, 21236 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-28 01:42:36,017 INFO L231 Difference]: Finished difference. Result has 498 places, 760 transitions, 19597 flow [2024-06-28 01:42:36,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19156, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19597, PETRI_PLACES=498, PETRI_TRANSITIONS=760} [2024-06-28 01:42:36,018 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 457 predicate places. [2024-06-28 01:42:36,018 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 760 transitions, 19597 flow [2024-06-28 01:42:36,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:36,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:36,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:36,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-28 01:42:36,019 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:36,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1374444972, now seen corresponding path program 7 times [2024-06-28 01:42:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381137587] [2024-06-28 01:42:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381137587] [2024-06-28 01:42:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381137587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:37,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:37,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:42:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636471869] [2024-06-28 01:42:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:37,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:42:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:42:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:42:37,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:42:37,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 760 transitions, 19597 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:37,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:37,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:42:37,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:41,300 INFO L124 PetriNetUnfolderBase]: 5594/10400 cut-off events. [2024-06-28 01:42:41,300 INFO L125 PetriNetUnfolderBase]: For 402971/403082 co-relation queries the response was YES. [2024-06-28 01:42:41,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87978 conditions, 10400 events. 5594/10400 cut-off events. For 402971/403082 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 88174 event pairs, 1256 based on Foata normal form. 121/10240 useless extension candidates. Maximal degree in co-relation 87750. Up to 7259 conditions per place. [2024-06-28 01:42:41,512 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 569 selfloop transitions, 256 changer transitions 0/833 dead transitions. [2024-06-28 01:42:41,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 833 transitions, 21896 flow [2024-06-28 01:42:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:42:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:42:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-28 01:42:41,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110565110565111 [2024-06-28 01:42:41,514 INFO L175 Difference]: Start difference. First operand has 498 places, 760 transitions, 19597 flow. Second operand 11 states and 208 transitions. [2024-06-28 01:42:41,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 833 transitions, 21896 flow [2024-06-28 01:42:45,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 833 transitions, 21506 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 01:42:45,411 INFO L231 Difference]: Finished difference. Result has 503 places, 771 transitions, 20029 flow [2024-06-28 01:42:45,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19207, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20029, PETRI_PLACES=503, PETRI_TRANSITIONS=771} [2024-06-28 01:42:45,412 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 462 predicate places. [2024-06-28 01:42:45,412 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 771 transitions, 20029 flow [2024-06-28 01:42:45,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:45,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:45,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:45,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-28 01:42:45,413 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:45,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1351961660, now seen corresponding path program 8 times [2024-06-28 01:42:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:45,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497374197] [2024-06-28 01:42:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:46,394 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-28 01:42:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497374197] [2024-06-28 01:42:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497374197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:46,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:46,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:42:46,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012721133] [2024-06-28 01:42:46,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:46,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:42:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:42:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:42:46,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:42:46,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 771 transitions, 20029 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:46,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:46,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:42:46,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:50,660 INFO L124 PetriNetUnfolderBase]: 5597/10417 cut-off events. [2024-06-28 01:42:50,660 INFO L125 PetriNetUnfolderBase]: For 359393/359504 co-relation queries the response was YES. [2024-06-28 01:42:50,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87616 conditions, 10417 events. 5597/10417 cut-off events. For 359393/359504 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 88250 event pairs, 1225 based on Foata normal form. 121/10253 useless extension candidates. Maximal degree in co-relation 87384. Up to 7121 conditions per place.