./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_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/rfi001_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/rfi001_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/rfi001_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:43:02,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:43:02,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:43:02,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:43:02,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:43:02,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:43:02,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:43:02,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:43:02,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:43:02,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:43:02,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:43:02,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:43:02,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:43:02,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:43:02,906 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:43:02,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:43:02,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:43:02,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:43:02,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:43:02,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:43:02,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:43:02,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:43:02,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:43:02,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:43:02,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:43:02,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:43:02,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:43:02,909 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:43:02,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:43:02,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:43:02,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:43:02,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:43:02,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:43:02,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:43:02,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:43:02,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:43:02,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:43:02,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:43:02,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:43:02,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:43:02,913 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:43:02,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:43:02,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:43:02,913 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:43:03,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:43:03,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:43:03,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:43:03,147 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:43:03,148 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:43:03,148 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/rfi001_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-28 01:43:03,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:43:03,314 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:43:03,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:43:04,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:43:04,547 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:43:04,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:43:04,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a881f3548/683748ec77674e958a186f775602a7a2/FLAGf503d663e [2024-06-28 01:43:04,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a881f3548/683748ec77674e958a186f775602a7a2 [2024-06-28 01:43:04,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:43:04,575 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:43:04,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:43:04,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:43:04,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:43:04,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:43:03" (1/2) ... [2024-06-28 01:43:04,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747353cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:43:04, skipping insertion in model container [2024-06-28 01:43:04,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:43:03" (1/2) ... [2024-06-28 01:43:04,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ff0cce5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:43:04, skipping insertion in model container [2024-06-28 01:43:04,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:43:04" (2/2) ... [2024-06-28 01:43:04,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747353cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:04, skipping insertion in model container [2024-06-28 01:43:04,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:43:04" (2/2) ... [2024-06-28 01:43:04,587 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:43:04,636 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:43:04,637 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:43:04,637 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:43:04,638 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:43:04,638 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-28 01:43:04,713 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:43:04,866 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-28 01:43:04,989 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:43:05,004 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:43:05,039 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:43:05,119 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:43:05,155 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:43:05,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05 WrapperNode [2024-06-28 01:43:05,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:43:05,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:43:05,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:43:05,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:43:05,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,216 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2024-06-28 01:43:05,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:43:05,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:43:05,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:43:05,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:43:05,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,248 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:43:05,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:43:05,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:43:05,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:43:05,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:43:05,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (1/1) ... [2024-06-28 01:43:05,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:43:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:43:05,293 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:43:05,297 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:43:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:43:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:43:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:43:05,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:43:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:43:05,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:43:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:43:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:43:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:43:05,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:43:05,329 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:43:05,445 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:43:05,448 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:43:05,729 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:43:05,729 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:43:05,823 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:43:05,824 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:43:05,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:43:05 BoogieIcfgContainer [2024-06-28 01:43:05,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:43:05,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:43:05,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:43:05,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:43:05,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:43:03" (1/4) ... [2024-06-28 01:43:05,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e419779 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:43:05, skipping insertion in model container [2024-06-28 01:43:05,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:43:04" (2/4) ... [2024-06-28 01:43:05,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e419779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:43:05, skipping insertion in model container [2024-06-28 01:43:05,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:05" (3/4) ... [2024-06-28 01:43:05,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e419779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:43:05, skipping insertion in model container [2024-06-28 01:43:05,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:43:05" (4/4) ... [2024-06-28 01:43:05,840 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:43:05,854 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:43:05,854 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 01:43:05,854 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:43:05,898 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:43:05,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:43:05,976 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-28 01:43:05,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:43:05,981 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:43:05,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:43:05,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-28 01:43:05,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:43:06,005 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;@79ec0ab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:43:06,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 01:43:06,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:43:06,009 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:43:06,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:43:06,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:06,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:43:06,010 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:43:06,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 315654007, now seen corresponding path program 1 times [2024-06-28 01:43:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:06,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587640014] [2024-06-28 01:43:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:06,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587640014] [2024-06-28 01:43:06,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587640014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:43:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495027382] [2024-06-28 01:43:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:06,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:43:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:06,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:43:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:43:06,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:43:06,723 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:43:06,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:06,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:43:06,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:06,957 INFO L124 PetriNetUnfolderBase]: 559/1092 cut-off events. [2024-06-28 01:43:06,957 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-28 01:43:06,960 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:43:06,964 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-28 01:43:06,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 169 flow [2024-06-28 01:43:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:43:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:43:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-28 01:43:06,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-06-28 01:43:06,975 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:43:06,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 169 flow [2024-06-28 01:43:06,978 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:43:06,981 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-06-28 01:43:06,982 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:43:06,985 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-28 01:43:06,986 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-06-28 01:43:06,986 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:43:06,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:06,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:43:06,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:43:06,987 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:43:06,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 315654920, now seen corresponding path program 1 times [2024-06-28 01:43:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:06,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660856126] [2024-06-28 01:43:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:07,068 INFO 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:43:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660856126] [2024-06-28 01:43:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660856126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:07,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:43:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156610826] [2024-06-28 01:43:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:07,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:43:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:43:07,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:43:07,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 37 [2024-06-28 01:43:07,073 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:43:07,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:07,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 37 [2024-06-28 01:43:07,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:07,168 INFO L124 PetriNetUnfolderBase]: 169/402 cut-off events. [2024-06-28 01:43:07,168 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-28 01:43:07,169 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:43:07,170 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-06-28 01:43:07,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 171 flow [2024-06-28 01:43:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:43:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:43:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-28 01:43:07,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7657657657657657 [2024-06-28 01:43:07,173 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:43:07,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 171 flow [2024-06-28 01:43:07,174 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:43:07,176 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 92 flow [2024-06-28 01:43:07,177 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:43:07,178 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-28 01:43:07,178 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 92 flow [2024-06-28 01:43:07,178 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:43:07,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:07,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:07,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:43:07,179 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:43:07,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:07,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1599155083, now seen corresponding path program 1 times [2024-06-28 01:43:07,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:07,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113220540] [2024-06-28 01:43:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:07,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:07,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113220540] [2024-06-28 01:43:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113220540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:07,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:07,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:43:07,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213021787] [2024-06-28 01:43:07,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:07,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:43:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:43:07,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:43:07,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:43:07,635 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:43:07,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:07,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:43:07,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:07,744 INFO L124 PetriNetUnfolderBase]: 402/815 cut-off events. [2024-06-28 01:43:07,745 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-06-28 01:43:07,746 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:43:07,750 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 35 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-28 01:43:07,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 220 flow [2024-06-28 01:43:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:43:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:43:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-06-28 01:43:07,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-28 01:43:07,754 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:43:07,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 220 flow [2024-06-28 01:43:07,756 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:43:07,757 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-06-28 01:43:07,757 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:43:07,758 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-28 01:43:07,758 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-06-28 01:43:07,758 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:43:07,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:07,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:07,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:43:07,760 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:43:07,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1965800764, now seen corresponding path program 1 times [2024-06-28 01:43:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:07,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902568439] [2024-06-28 01:43:07,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:07,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:08,157 INFO 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:43:08,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:08,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902568439] [2024-06-28 01:43:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902568439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:08,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:43:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381850880] [2024-06-28 01:43:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:08,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:43:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:08,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:43:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:43:08,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:43:08,222 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:43:08,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:08,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:43:08,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:08,395 INFO L124 PetriNetUnfolderBase]: 418/854 cut-off events. [2024-06-28 01:43:08,395 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-06-28 01:43:08,396 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:43:08,399 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 46 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-28 01:43:08,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 341 flow [2024-06-28 01:43:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:43:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:43:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-28 01:43:08,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2024-06-28 01:43:08,400 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:43:08,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 341 flow [2024-06-28 01:43:08,402 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:43:08,402 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 216 flow [2024-06-28 01:43:08,403 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:43:08,403 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-28 01:43:08,403 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 216 flow [2024-06-28 01:43:08,403 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:43:08,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:08,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:43:08,404 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:43:08,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 810282356, now seen corresponding path program 1 times [2024-06-28 01:43:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710511324] [2024-06-28 01:43:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:08,992 INFO 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:43:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710511324] [2024-06-28 01:43:08,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710511324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:08,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:43:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060824385] [2024-06-28 01:43:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:08,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:43:08,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:43:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:43:09,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:43:09,034 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:43:09,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:09,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:43:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:09,207 INFO L124 PetriNetUnfolderBase]: 428/794 cut-off events. [2024-06-28 01:43:09,207 INFO L125 PetriNetUnfolderBase]: For 798/798 co-relation queries the response was YES. [2024-06-28 01:43:09,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 794 events. 428/794 cut-off events. For 798/798 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4024 event pairs, 77 based on Foata normal form. 3/787 useless extension candidates. Maximal degree in co-relation 2200. Up to 593 conditions per place. [2024-06-28 01:43:09,212 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 56 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2024-06-28 01:43:09,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 526 flow [2024-06-28 01:43:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:43:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:43:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-06-28 01:43:09,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6261261261261262 [2024-06-28 01:43:09,215 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 216 flow. Second operand 6 states and 139 transitions. [2024-06-28 01:43:09,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 526 flow [2024-06-28 01:43:09,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 522 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 01:43:09,218 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 364 flow [2024-06-28 01:43:09,219 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=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-06-28 01:43:09,219 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-28 01:43:09,219 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 364 flow [2024-06-28 01:43:09,220 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:43:09,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:09,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:09,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:43:09,221 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:43:09,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -651049893, now seen corresponding path program 1 times [2024-06-28 01:43:09,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:09,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678093323] [2024-06-28 01:43:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:09,861 INFO 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:43:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678093323] [2024-06-28 01:43:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678093323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:43:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989862966] [2024-06-28 01:43:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:09,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:43:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:43:09,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:43:09,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:43:09,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 364 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:43:09,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:09,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:43:09,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:10,192 INFO L124 PetriNetUnfolderBase]: 438/812 cut-off events. [2024-06-28 01:43:10,192 INFO L125 PetriNetUnfolderBase]: For 1539/1539 co-relation queries the response was YES. [2024-06-28 01:43:10,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 812 events. 438/812 cut-off events. For 1539/1539 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4199 event pairs, 37 based on Foata normal form. 6/808 useless extension candidates. Maximal degree in co-relation 2680. Up to 561 conditions per place. [2024-06-28 01:43:10,197 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 59 selfloop transitions, 25 changer transitions 0/94 dead transitions. [2024-06-28 01:43:10,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 648 flow [2024-06-28 01:43:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-28 01:43:10,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6023166023166023 [2024-06-28 01:43:10,200 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 364 flow. Second operand 7 states and 156 transitions. [2024-06-28 01:43:10,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 648 flow [2024-06-28 01:43:10,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 628 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-06-28 01:43:10,207 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 411 flow [2024-06-28 01:43:10,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-06-28 01:43:10,209 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-06-28 01:43:10,209 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 411 flow [2024-06-28 01:43:10,210 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:43:10,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:10,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:10,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:43:10,210 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:43:10,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:10,211 INFO L85 PathProgramCache]: Analyzing trace with hash -981548492, now seen corresponding path program 1 times [2024-06-28 01:43:10,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494415805] [2024-06-28 01:43:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:10,629 INFO 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:43:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:10,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494415805] [2024-06-28 01:43:10,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494415805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:10,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:10,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:43:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185532481] [2024-06-28 01:43:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:10,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:43:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:10,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:43:10,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:43:10,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:43:10,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 411 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:43:10,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:10,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:43:10,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:10,925 INFO L124 PetriNetUnfolderBase]: 514/1028 cut-off events. [2024-06-28 01:43:10,926 INFO L125 PetriNetUnfolderBase]: For 2013/2013 co-relation queries the response was YES. [2024-06-28 01:43:10,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 1028 events. 514/1028 cut-off events. For 2013/2013 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5657 event pairs, 156 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 3249. Up to 838 conditions per place. [2024-06-28 01:43:10,931 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 53 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-06-28 01:43:10,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 561 flow [2024-06-28 01:43:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:43:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:43:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-28 01:43:10,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-28 01:43:10,933 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 411 flow. Second operand 5 states and 91 transitions. [2024-06-28 01:43:10,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 561 flow [2024-06-28 01:43:10,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 502 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:10,937 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 380 flow [2024-06-28 01:43:10,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-06-28 01:43:10,938 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-06-28 01:43:10,938 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 380 flow [2024-06-28 01:43:10,939 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:43:10,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:10,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:10,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:43:10,939 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:43:10,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash -364326629, now seen corresponding path program 1 times [2024-06-28 01:43:10,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534533413] [2024-06-28 01:43:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:11,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:43:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:11,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534533413] [2024-06-28 01:43:11,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534533413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:11,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:43:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389205515] [2024-06-28 01:43:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:11,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:43:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:43:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:43:11,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:11,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 380 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:43:11,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:11,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:11,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:11,686 INFO L124 PetriNetUnfolderBase]: 583/1135 cut-off events. [2024-06-28 01:43:11,686 INFO L125 PetriNetUnfolderBase]: For 2084/2084 co-relation queries the response was YES. [2024-06-28 01:43:11,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 1135 events. 583/1135 cut-off events. For 2084/2084 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6194 event pairs, 178 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 3410. Up to 937 conditions per place. [2024-06-28 01:43:11,692 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 59 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-28 01:43:11,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 570 flow [2024-06-28 01:43:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:43:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:43:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-28 01:43:11,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2024-06-28 01:43:11,694 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 380 flow. Second operand 6 states and 103 transitions. [2024-06-28 01:43:11,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 570 flow [2024-06-28 01:43:11,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 545 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:43:11,699 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 399 flow [2024-06-28 01:43:11,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-06-28 01:43:11,699 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-06-28 01:43:11,699 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 399 flow [2024-06-28 01:43:11,700 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:43:11,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:11,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:11,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:43:11,705 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:43:11,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 565424084, now seen corresponding path program 1 times [2024-06-28 01:43:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185861258] [2024-06-28 01:43:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:12,203 INFO 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:43:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:12,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185861258] [2024-06-28 01:43:12,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185861258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:12,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:12,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:43:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642116972] [2024-06-28 01:43:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:12,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:43:12,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:12,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:43:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:43:12,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:43:12,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 399 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:43:12,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:12,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:43:12,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:12,449 INFO L124 PetriNetUnfolderBase]: 540/1060 cut-off events. [2024-06-28 01:43:12,449 INFO L125 PetriNetUnfolderBase]: For 2398/2398 co-relation queries the response was YES. [2024-06-28 01:43:12,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3425 conditions, 1060 events. 540/1060 cut-off events. For 2398/2398 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5761 event pairs, 124 based on Foata normal form. 2/1022 useless extension candidates. Maximal degree in co-relation 3394. Up to 798 conditions per place. [2024-06-28 01:43:12,455 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 60 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2024-06-28 01:43:12,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 635 flow [2024-06-28 01:43:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:43:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:43:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-28 01:43:12,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-06-28 01:43:12,459 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 399 flow. Second operand 6 states and 115 transitions. [2024-06-28 01:43:12,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 635 flow [2024-06-28 01:43:12,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 611 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:43:12,464 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 434 flow [2024-06-28 01:43:12,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-28 01:43:12,465 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2024-06-28 01:43:12,466 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 434 flow [2024-06-28 01:43:12,466 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:43:12,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:12,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:12,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:43:12,466 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:43:12,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:12,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1625595254, now seen corresponding path program 2 times [2024-06-28 01:43:12,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:12,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321074403] [2024-06-28 01:43:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:12,963 INFO 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:43:12,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321074403] [2024-06-28 01:43:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321074403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:12,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:43:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002236659] [2024-06-28 01:43:12,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:12,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:43:12,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:12,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:43:12,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:43:13,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:43:13,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 434 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:43:13,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:13,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:43:13,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:13,259 INFO L124 PetriNetUnfolderBase]: 544/1071 cut-off events. [2024-06-28 01:43:13,260 INFO L125 PetriNetUnfolderBase]: For 2740/2740 co-relation queries the response was YES. [2024-06-28 01:43:13,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 1071 events. 544/1071 cut-off events. For 2740/2740 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5897 event pairs, 168 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 3482. Up to 875 conditions per place. [2024-06-28 01:43:13,266 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 59 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2024-06-28 01:43:13,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 606 flow [2024-06-28 01:43:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:43:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:43:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-28 01:43:13,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-28 01:43:13,267 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 434 flow. Second operand 6 states and 106 transitions. [2024-06-28 01:43:13,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 606 flow [2024-06-28 01:43:13,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 587 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-28 01:43:13,272 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 440 flow [2024-06-28 01:43:13,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-06-28 01:43:13,273 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-06-28 01:43:13,273 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 440 flow [2024-06-28 01:43:13,273 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:43:13,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:13,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:13,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:43:13,273 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:43:13,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1590777511, now seen corresponding path program 1 times [2024-06-28 01:43:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:13,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716913285] [2024-06-28 01:43:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:13,731 INFO 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:43:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:13,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716913285] [2024-06-28 01:43:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716913285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:13,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543636308] [2024-06-28 01:43:13,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:13,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:13,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:13,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 440 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:43:13,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:13,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:13,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:14,179 INFO L124 PetriNetUnfolderBase]: 581/1115 cut-off events. [2024-06-28 01:43:14,179 INFO L125 PetriNetUnfolderBase]: For 3041/3041 co-relation queries the response was YES. [2024-06-28 01:43:14,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 1115 events. 581/1115 cut-off events. For 3041/3041 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6016 event pairs, 169 based on Foata normal form. 3/1079 useless extension candidates. Maximal degree in co-relation 3619. Up to 899 conditions per place. [2024-06-28 01:43:14,185 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 68 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2024-06-28 01:43:14,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 672 flow [2024-06-28 01:43:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-28 01:43:14,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671814671814672 [2024-06-28 01:43:14,186 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 440 flow. Second operand 7 states and 121 transitions. [2024-06-28 01:43:14,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 672 flow [2024-06-28 01:43:14,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 630 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:14,192 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 447 flow [2024-06-28 01:43:14,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-06-28 01:43:14,192 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-28 01:43:14,192 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 447 flow [2024-06-28 01:43:14,193 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:43:14,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:14,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:14,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:43:14,193 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:43:14,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash -834559091, now seen corresponding path program 1 times [2024-06-28 01:43:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:14,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774778683] [2024-06-28 01:43:14,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:14,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:14,711 INFO 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:43:14,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774778683] [2024-06-28 01:43:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774778683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:14,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:14,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462371806] [2024-06-28 01:43:14,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:14,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:14,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:14,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:14,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:14,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 447 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:43:14,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:14,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:14,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:14,987 INFO L124 PetriNetUnfolderBase]: 609/1122 cut-off events. [2024-06-28 01:43:14,987 INFO L125 PetriNetUnfolderBase]: For 3201/3201 co-relation queries the response was YES. [2024-06-28 01:43:14,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 1122 events. 609/1122 cut-off events. For 3201/3201 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5922 event pairs, 138 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 3813. Up to 843 conditions per place. [2024-06-28 01:43:14,994 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 73 selfloop transitions, 20 changer transitions 0/100 dead transitions. [2024-06-28 01:43:14,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 768 flow [2024-06-28 01:43:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-28 01:43:14,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-06-28 01:43:14,995 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 447 flow. Second operand 7 states and 129 transitions. [2024-06-28 01:43:14,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 768 flow [2024-06-28 01:43:15,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 734 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:15,001 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 522 flow [2024-06-28 01:43:15,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=522, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2024-06-28 01:43:15,002 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2024-06-28 01:43:15,002 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 522 flow [2024-06-28 01:43:15,002 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:43:15,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:15,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:15,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:43:15,003 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:43:15,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1172965487, now seen corresponding path program 2 times [2024-06-28 01:43:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875536720] [2024-06-28 01:43:15,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:15,449 INFO 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:43:15,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875536720] [2024-06-28 01:43:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875536720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:15,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740460744] [2024-06-28 01:43:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:15,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:15,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:15,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 522 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:43:15,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:15,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:15,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:15,838 INFO L124 PetriNetUnfolderBase]: 620/1167 cut-off events. [2024-06-28 01:43:15,839 INFO L125 PetriNetUnfolderBase]: For 3799/3799 co-relation queries the response was YES. [2024-06-28 01:43:15,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 1167 events. 620/1167 cut-off events. For 3799/3799 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6342 event pairs, 179 based on Foata normal form. 1/1132 useless extension candidates. Maximal degree in co-relation 4158. Up to 973 conditions per place. [2024-06-28 01:43:15,846 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 75 selfloop transitions, 16 changer transitions 0/98 dead transitions. [2024-06-28 01:43:15,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 808 flow [2024-06-28 01:43:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 01:43:15,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46332046332046334 [2024-06-28 01:43:15,848 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 522 flow. Second operand 7 states and 120 transitions. [2024-06-28 01:43:15,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 808 flow [2024-06-28 01:43:15,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 98 transitions, 793 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 01:43:15,857 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 576 flow [2024-06-28 01:43:15,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2024-06-28 01:43:15,858 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2024-06-28 01:43:15,858 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 576 flow [2024-06-28 01:43:15,858 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:43:15,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:15,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:15,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:43:15,859 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:43:15,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 154518591, now seen corresponding path program 3 times [2024-06-28 01:43:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827995241] [2024-06-28 01:43:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827995241] [2024-06-28 01:43:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827995241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584052500] [2024-06-28 01:43:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:16,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:16,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:16,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:16,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:16,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:16,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 576 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:43:16,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:16,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:16,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:16,688 INFO L124 PetriNetUnfolderBase]: 618/1165 cut-off events. [2024-06-28 01:43:16,688 INFO L125 PetriNetUnfolderBase]: For 4414/4414 co-relation queries the response was YES. [2024-06-28 01:43:16,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 1165 events. 618/1165 cut-off events. For 4414/4414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6315 event pairs, 181 based on Foata normal form. 1/1130 useless extension candidates. Maximal degree in co-relation 4247. Up to 991 conditions per place. [2024-06-28 01:43:16,696 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 75 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2024-06-28 01:43:16,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 794 flow [2024-06-28 01:43:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 01:43:16,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44787644787644787 [2024-06-28 01:43:16,698 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 576 flow. Second operand 7 states and 116 transitions. [2024-06-28 01:43:16,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 794 flow [2024-06-28 01:43:16,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 764 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:43:16,705 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 577 flow [2024-06-28 01:43:16,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2024-06-28 01:43:16,706 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2024-06-28 01:43:16,707 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 577 flow [2024-06-28 01:43:16,707 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:43:16,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:16,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:16,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:43:16,708 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:43:16,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash 347202575, now seen corresponding path program 1 times [2024-06-28 01:43:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408009718] [2024-06-28 01:43:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:17,396 INFO 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:43:17,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408009718] [2024-06-28 01:43:17,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408009718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:17,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437729035] [2024-06-28 01:43:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:17,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:17,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:17,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:17,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:43:17,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 577 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:43:17,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:17,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:43:17,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:17,830 INFO L124 PetriNetUnfolderBase]: 584/1058 cut-off events. [2024-06-28 01:43:17,830 INFO L125 PetriNetUnfolderBase]: For 4773/4773 co-relation queries the response was YES. [2024-06-28 01:43:17,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 1058 events. 584/1058 cut-off events. For 4773/4773 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5478 event pairs, 90 based on Foata normal form. 1/1043 useless extension candidates. Maximal degree in co-relation 4085. Up to 762 conditions per place. [2024-06-28 01:43:17,836 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 71 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-28 01:43:17,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 899 flow [2024-06-28 01:43:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:43:17,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2024-06-28 01:43:17,838 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 577 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:43:17,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 899 flow [2024-06-28 01:43:17,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 862 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:17,845 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 621 flow [2024-06-28 01:43:17,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=621, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2024-06-28 01:43:17,846 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-06-28 01:43:17,846 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 621 flow [2024-06-28 01:43:17,846 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:43:17,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:17,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:17,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:43:17,846 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:43:17,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash 347292785, now seen corresponding path program 2 times [2024-06-28 01:43:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131911695] [2024-06-28 01:43:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:18,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:18,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131911695] [2024-06-28 01:43:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131911695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421092065] [2024-06-28 01:43:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:18,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:18,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:43:18,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 621 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:43:18,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:18,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:43:18,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:18,948 INFO L124 PetriNetUnfolderBase]: 585/1052 cut-off events. [2024-06-28 01:43:18,948 INFO L125 PetriNetUnfolderBase]: For 5243/5243 co-relation queries the response was YES. [2024-06-28 01:43:18,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4292 conditions, 1052 events. 585/1052 cut-off events. For 5243/5243 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5376 event pairs, 86 based on Foata normal form. 1/1038 useless extension candidates. Maximal degree in co-relation 4252. Up to 805 conditions per place. [2024-06-28 01:43:18,954 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 67 selfloop transitions, 28 changer transitions 0/109 dead transitions. [2024-06-28 01:43:18,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 902 flow [2024-06-28 01:43:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 01:43:18,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-06-28 01:43:18,956 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 621 flow. Second operand 8 states and 145 transitions. [2024-06-28 01:43:18,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 902 flow [2024-06-28 01:43:18,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 866 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 01:43:18,964 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 678 flow [2024-06-28 01:43:18,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=678, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2024-06-28 01:43:18,964 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2024-06-28 01:43:18,965 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 678 flow [2024-06-28 01:43:18,965 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:43:18,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:18,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:18,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:43:18,965 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:43:18,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 351012010, now seen corresponding path program 1 times [2024-06-28 01:43:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248624190] [2024-06-28 01:43:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:19,456 INFO 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:43:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:19,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248624190] [2024-06-28 01:43:19,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248624190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:19,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:19,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577222519] [2024-06-28 01:43:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:19,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:19,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:19,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 678 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:43:19,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:19,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:19,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:19,746 INFO L124 PetriNetUnfolderBase]: 641/1177 cut-off events. [2024-06-28 01:43:19,747 INFO L125 PetriNetUnfolderBase]: For 5825/5825 co-relation queries the response was YES. [2024-06-28 01:43:19,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 1177 events. 641/1177 cut-off events. For 5825/5825 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6285 event pairs, 140 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 4723. Up to 879 conditions per place. [2024-06-28 01:43:19,754 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 80 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-06-28 01:43:19,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 114 transitions, 1016 flow [2024-06-28 01:43:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-28 01:43:19,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096525096525096 [2024-06-28 01:43:19,755 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 678 flow. Second operand 7 states and 132 transitions. [2024-06-28 01:43:19,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 114 transitions, 1016 flow [2024-06-28 01:43:19,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 114 transitions, 969 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:19,766 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 704 flow [2024-06-28 01:43:19,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=704, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2024-06-28 01:43:19,766 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2024-06-28 01:43:19,767 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 704 flow [2024-06-28 01:43:19,767 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:43:19,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:19,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:19,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:43:19,767 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:43:19,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:19,768 INFO L85 PathProgramCache]: Analyzing trace with hash 351017807, now seen corresponding path program 1 times [2024-06-28 01:43:19,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:19,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315507928] [2024-06-28 01:43:19,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:19,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:20,285 INFO 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:43:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:20,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315507928] [2024-06-28 01:43:20,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315507928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:20,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:20,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081005433] [2024-06-28 01:43:20,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:20,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:20,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:20,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 704 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:43:20,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:20,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:20,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:20,677 INFO L124 PetriNetUnfolderBase]: 765/1381 cut-off events. [2024-06-28 01:43:20,677 INFO L125 PetriNetUnfolderBase]: For 8067/8067 co-relation queries the response was YES. [2024-06-28 01:43:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5564 conditions, 1381 events. 765/1381 cut-off events. For 8067/8067 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7494 event pairs, 172 based on Foata normal form. 6/1350 useless extension candidates. Maximal degree in co-relation 5520. Up to 866 conditions per place. [2024-06-28 01:43:20,685 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 95 selfloop transitions, 27 changer transitions 0/129 dead transitions. [2024-06-28 01:43:20,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 129 transitions, 1132 flow [2024-06-28 01:43:20,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:43:20,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:43:20,688 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 704 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:43:20,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 129 transitions, 1132 flow [2024-06-28 01:43:20,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 129 transitions, 1070 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:20,701 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 770 flow [2024-06-28 01:43:20,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=770, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2024-06-28 01:43:20,702 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2024-06-28 01:43:20,702 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 770 flow [2024-06-28 01:43:20,702 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:43:20,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:20,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:20,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:43:20,703 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:43:20,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash -101527140, now seen corresponding path program 2 times [2024-06-28 01:43:20,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:20,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009569436] [2024-06-28 01:43:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:20,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:21,146 INFO 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:43:21,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:21,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009569436] [2024-06-28 01:43:21,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009569436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:21,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:21,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212438548] [2024-06-28 01:43:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:21,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:21,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:21,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:21,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:21,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 770 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:43:21,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:21,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:21,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:21,489 INFO L124 PetriNetUnfolderBase]: 776/1420 cut-off events. [2024-06-28 01:43:21,489 INFO L125 PetriNetUnfolderBase]: For 8689/8689 co-relation queries the response was YES. [2024-06-28 01:43:21,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6060 conditions, 1420 events. 776/1420 cut-off events. For 8689/8689 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7911 event pairs, 166 based on Foata normal form. 1/1376 useless extension candidates. Maximal degree in co-relation 6014. Up to 1083 conditions per place. [2024-06-28 01:43:21,497 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 88 selfloop transitions, 26 changer transitions 0/121 dead transitions. [2024-06-28 01:43:21,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 121 transitions, 1124 flow [2024-06-28 01:43:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 01:43:21,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942084942084942 [2024-06-28 01:43:21,499 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 770 flow. Second operand 7 states and 128 transitions. [2024-06-28 01:43:21,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 121 transitions, 1124 flow [2024-06-28 01:43:21,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 121 transitions, 1099 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 01:43:21,511 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 817 flow [2024-06-28 01:43:21,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=817, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-06-28 01:43:21,512 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2024-06-28 01:43:21,512 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 817 flow [2024-06-28 01:43:21,512 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:43:21,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:21,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:21,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:43:21,512 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:43:21,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1171021707, now seen corresponding path program 2 times [2024-06-28 01:43:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864264476] [2024-06-28 01:43:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:22,003 INFO 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:43:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864264476] [2024-06-28 01:43:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864264476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:22,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:22,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608996867] [2024-06-28 01:43:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:22,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:22,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:22,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:22,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 817 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:43:22,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:22,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:22,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:22,393 INFO L124 PetriNetUnfolderBase]: 809/1493 cut-off events. [2024-06-28 01:43:22,393 INFO L125 PetriNetUnfolderBase]: For 9925/9925 co-relation queries the response was YES. [2024-06-28 01:43:22,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6359 conditions, 1493 events. 809/1493 cut-off events. For 9925/9925 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8459 event pairs, 227 based on Foata normal form. 3/1452 useless extension candidates. Maximal degree in co-relation 6310. Up to 1185 conditions per place. [2024-06-28 01:43:22,402 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 101 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2024-06-28 01:43:22,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 129 transitions, 1221 flow [2024-06-28 01:43:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 01:43:22,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-06-28 01:43:22,403 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 817 flow. Second operand 8 states and 142 transitions. [2024-06-28 01:43:22,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 129 transitions, 1221 flow [2024-06-28 01:43:22,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 1180 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:43:22,419 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 863 flow [2024-06-28 01:43:22,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=863, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2024-06-28 01:43:22,420 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-06-28 01:43:22,420 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 863 flow [2024-06-28 01:43:22,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:43:22,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:22,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:22,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:43:22,421 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:43:22,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash -271143259, now seen corresponding path program 3 times [2024-06-28 01:43:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359635869] [2024-06-28 01:43:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:22,876 INFO 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:43:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359635869] [2024-06-28 01:43:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359635869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:22,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:22,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354388325] [2024-06-28 01:43:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:22,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:22,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:22,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:22,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 863 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:43:22,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:22,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:22,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:23,365 INFO L124 PetriNetUnfolderBase]: 842/1572 cut-off events. [2024-06-28 01:43:23,365 INFO L125 PetriNetUnfolderBase]: For 11466/11466 co-relation queries the response was YES. [2024-06-28 01:43:23,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6715 conditions, 1572 events. 842/1572 cut-off events. For 11466/11466 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9100 event pairs, 243 based on Foata normal form. 3/1524 useless extension candidates. Maximal degree in co-relation 6665. Up to 1309 conditions per place. [2024-06-28 01:43:23,372 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 101 selfloop transitions, 16 changer transitions 0/124 dead transitions. [2024-06-28 01:43:23,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 124 transitions, 1175 flow [2024-06-28 01:43:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 01:43:23,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2024-06-28 01:43:23,374 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 863 flow. Second operand 8 states and 133 transitions. [2024-06-28 01:43:23,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 124 transitions, 1175 flow [2024-06-28 01:43:23,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 124 transitions, 1140 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 01:43:23,388 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 891 flow [2024-06-28 01:43:23,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=891, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2024-06-28 01:43:23,389 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2024-06-28 01:43:23,389 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 891 flow [2024-06-28 01:43:23,389 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:43:23,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:23,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:23,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:43:23,389 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:43:23,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash -271439216, now seen corresponding path program 3 times [2024-06-28 01:43:23,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:23,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104682472] [2024-06-28 01:43:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:23,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:23,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:43:23,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:23,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104682472] [2024-06-28 01:43:23,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104682472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:23,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:23,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:43:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383046426] [2024-06-28 01:43:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:23,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:43:23,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:23,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:43:23,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:43:23,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:23,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 891 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:43:23,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:23,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:23,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:24,154 INFO L124 PetriNetUnfolderBase]: 840/1566 cut-off events. [2024-06-28 01:43:24,154 INFO L125 PetriNetUnfolderBase]: For 11347/11347 co-relation queries the response was YES. [2024-06-28 01:43:24,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1566 events. 840/1566 cut-off events. For 11347/11347 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9061 event pairs, 242 based on Foata normal form. 1/1517 useless extension candidates. Maximal degree in co-relation 6648. Up to 1324 conditions per place. [2024-06-28 01:43:24,164 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 100 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2024-06-28 01:43:24,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 121 transitions, 1175 flow [2024-06-28 01:43:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-28 01:43:24,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2024-06-28 01:43:24,165 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 891 flow. Second operand 7 states and 118 transitions. [2024-06-28 01:43:24,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 121 transitions, 1175 flow [2024-06-28 01:43:24,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 1122 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:24,183 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 871 flow [2024-06-28 01:43:24,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=871, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-06-28 01:43:24,183 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2024-06-28 01:43:24,184 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 871 flow [2024-06-28 01:43:24,185 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:43:24,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:24,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:24,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:43:24,185 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:43:24,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1993945227, now seen corresponding path program 4 times [2024-06-28 01:43:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840371066] [2024-06-28 01:43:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:24,670 INFO 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:43:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:24,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840371066] [2024-06-28 01:43:24,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840371066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:24,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:24,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189468005] [2024-06-28 01:43:24,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:24,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:24,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:24,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:24,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:24,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 871 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:43:24,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:24,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:24,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:25,089 INFO L124 PetriNetUnfolderBase]: 834/1548 cut-off events. [2024-06-28 01:43:25,089 INFO L125 PetriNetUnfolderBase]: For 11334/11334 co-relation queries the response was YES. [2024-06-28 01:43:25,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6515 conditions, 1548 events. 834/1548 cut-off events. For 11334/11334 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8904 event pairs, 233 based on Foata normal form. 3/1503 useless extension candidates. Maximal degree in co-relation 6463. Up to 1255 conditions per place. [2024-06-28 01:43:25,099 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 101 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2024-06-28 01:43:25,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 129 transitions, 1211 flow [2024-06-28 01:43:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-28 01:43:25,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-28 01:43:25,101 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 871 flow. Second operand 9 states and 148 transitions. [2024-06-28 01:43:25,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 129 transitions, 1211 flow [2024-06-28 01:43:25,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 1149 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 01:43:25,123 INFO L231 Difference]: Finished difference. Result has 115 places, 104 transitions, 885 flow [2024-06-28 01:43:25,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=885, PETRI_PLACES=115, PETRI_TRANSITIONS=104} [2024-06-28 01:43:25,124 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2024-06-28 01:43:25,124 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 104 transitions, 885 flow [2024-06-28 01:43:25,124 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:43:25,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:25,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:25,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:43:25,125 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:43:25,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1467653110, now seen corresponding path program 1 times [2024-06-28 01:43:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:25,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240114676] [2024-06-28 01:43:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:25,738 INFO 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:43:25,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240114676] [2024-06-28 01:43:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240114676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:25,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960302188] [2024-06-28 01:43:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:25,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:25,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:25,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:43:25,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 104 transitions, 885 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:43:25,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:25,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:43:25,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:26,171 INFO L124 PetriNetUnfolderBase]: 795/1432 cut-off events. [2024-06-28 01:43:26,172 INFO L125 PetriNetUnfolderBase]: For 11506/11506 co-relation queries the response was YES. [2024-06-28 01:43:26,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6288 conditions, 1432 events. 795/1432 cut-off events. For 11506/11506 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7929 event pairs, 88 based on Foata normal form. 2/1408 useless extension candidates. Maximal degree in co-relation 6234. Up to 970 conditions per place. [2024-06-28 01:43:26,179 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 95 selfloop transitions, 29 changer transitions 0/140 dead transitions. [2024-06-28 01:43:26,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 140 transitions, 1297 flow [2024-06-28 01:43:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:43:26,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:43:26,181 INFO L175 Difference]: Start difference. First operand has 115 places, 104 transitions, 885 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:43:26,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 140 transitions, 1297 flow [2024-06-28 01:43:26,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 140 transitions, 1230 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:26,201 INFO L231 Difference]: Finished difference. Result has 115 places, 105 transitions, 888 flow [2024-06-28 01:43:26,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=888, PETRI_PLACES=115, PETRI_TRANSITIONS=105} [2024-06-28 01:43:26,202 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2024-06-28 01:43:26,202 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 105 transitions, 888 flow [2024-06-28 01:43:26,202 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:43:26,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:26,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:26,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:43:26,203 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:43:26,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:26,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2121621096, now seen corresponding path program 2 times [2024-06-28 01:43:26,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:26,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606281184] [2024-06-28 01:43:26,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:26,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:26,868 INFO 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:43:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606281184] [2024-06-28 01:43:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606281184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868819507] [2024-06-28 01:43:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:26,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:26,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-28 01:43:26,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 105 transitions, 888 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:43:26,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:26,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-28 01:43:26,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:27,311 INFO L124 PetriNetUnfolderBase]: 804/1506 cut-off events. [2024-06-28 01:43:27,311 INFO L125 PetriNetUnfolderBase]: For 11686/11687 co-relation queries the response was YES. [2024-06-28 01:43:27,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 1506 events. 804/1506 cut-off events. For 11686/11687 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8721 event pairs, 156 based on Foata normal form. 3/1463 useless extension candidates. Maximal degree in co-relation 6355. Up to 1111 conditions per place. [2024-06-28 01:43:27,320 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 110 selfloop transitions, 24 changer transitions 0/150 dead transitions. [2024-06-28 01:43:27,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 150 transitions, 1343 flow [2024-06-28 01:43:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 01:43:27,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-28 01:43:27,325 INFO L175 Difference]: Start difference. First operand has 115 places, 105 transitions, 888 flow. Second operand 9 states and 169 transitions. [2024-06-28 01:43:27,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 150 transitions, 1343 flow [2024-06-28 01:43:27,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 150 transitions, 1269 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:27,344 INFO L231 Difference]: Finished difference. Result has 121 places, 113 transitions, 956 flow [2024-06-28 01:43:27,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=956, PETRI_PLACES=121, PETRI_TRANSITIONS=113} [2024-06-28 01:43:27,345 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2024-06-28 01:43:27,345 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 113 transitions, 956 flow [2024-06-28 01:43:27,345 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:43:27,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:27,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:27,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:43:27,346 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:43:27,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2121620972, now seen corresponding path program 1 times [2024-06-28 01:43:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212693782] [2024-06-28 01:43:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:27,976 INFO 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:43:27,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212693782] [2024-06-28 01:43:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212693782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:27,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:27,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380061708] [2024-06-28 01:43:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:27,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:27,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:27,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:28,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:28,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 956 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:43:28,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:28,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:28,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:28,444 INFO L124 PetriNetUnfolderBase]: 877/1608 cut-off events. [2024-06-28 01:43:28,444 INFO L125 PetriNetUnfolderBase]: For 12057/12057 co-relation queries the response was YES. [2024-06-28 01:43:28,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 1608 events. 877/1608 cut-off events. For 12057/12057 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9269 event pairs, 184 based on Foata normal form. 1/1557 useless extension candidates. Maximal degree in co-relation 6753. Up to 1144 conditions per place. [2024-06-28 01:43:28,454 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 115 selfloop transitions, 37 changer transitions 0/159 dead transitions. [2024-06-28 01:43:28,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 159 transitions, 1474 flow [2024-06-28 01:43:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:43:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:43:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-28 01:43:28,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-28 01:43:28,465 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 956 flow. Second operand 10 states and 182 transitions. [2024-06-28 01:43:28,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 159 transitions, 1474 flow [2024-06-28 01:43:28,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 159 transitions, 1437 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:28,487 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 1028 flow [2024-06-28 01:43:28,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1028, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2024-06-28 01:43:28,488 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 85 predicate places. [2024-06-28 01:43:28,488 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 1028 flow [2024-06-28 01:43:28,489 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:43:28,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:28,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:28,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:43:28,489 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:43:28,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2003533292, now seen corresponding path program 2 times [2024-06-28 01:43:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685397351] [2024-06-28 01:43:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:29,097 INFO 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:43:29,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:29,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685397351] [2024-06-28 01:43:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685397351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:29,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850195171] [2024-06-28 01:43:29,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:29,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:29,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:29,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:29,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:29,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 1028 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:43:29,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:29,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:29,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:29,479 INFO L124 PetriNetUnfolderBase]: 897/1558 cut-off events. [2024-06-28 01:43:29,479 INFO L125 PetriNetUnfolderBase]: For 12952/12952 co-relation queries the response was YES. [2024-06-28 01:43:29,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7069 conditions, 1558 events. 897/1558 cut-off events. For 12952/12952 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8521 event pairs, 131 based on Foata normal form. 1/1534 useless extension candidates. Maximal degree in co-relation 7011. Up to 1159 conditions per place. [2024-06-28 01:43:29,487 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 103 selfloop transitions, 54 changer transitions 0/164 dead transitions. [2024-06-28 01:43:29,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 164 transitions, 1602 flow [2024-06-28 01:43:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 01:43:29,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-06-28 01:43:29,488 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 1028 flow. Second operand 8 states and 154 transitions. [2024-06-28 01:43:29,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 164 transitions, 1602 flow [2024-06-28 01:43:29,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 164 transitions, 1547 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:29,516 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 1215 flow [2024-06-28 01:43:29,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1215, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2024-06-28 01:43:29,516 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 88 predicate places. [2024-06-28 01:43:29,517 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 1215 flow [2024-06-28 01:43:29,517 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:43:29,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:29,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:29,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:43:29,517 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:43:29,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2003348966, now seen corresponding path program 1 times [2024-06-28 01:43:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:29,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121181101] [2024-06-28 01:43:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:30,087 INFO 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:43:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:30,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121181101] [2024-06-28 01:43:30,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121181101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:30,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:30,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998012712] [2024-06-28 01:43:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:30,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:30,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:30,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:30,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:30,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 1215 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:43:30,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:30,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:30,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:30,531 INFO L124 PetriNetUnfolderBase]: 1175/2097 cut-off events. [2024-06-28 01:43:30,531 INFO L125 PetriNetUnfolderBase]: For 19230/19230 co-relation queries the response was YES. [2024-06-28 01:43:30,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9800 conditions, 2097 events. 1175/2097 cut-off events. For 19230/19230 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12366 event pairs, 285 based on Foata normal form. 3/2045 useless extension candidates. Maximal degree in co-relation 9739. Up to 1366 conditions per place. [2024-06-28 01:43:30,543 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 140 selfloop transitions, 39 changer transitions 0/186 dead transitions. [2024-06-28 01:43:30,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 186 transitions, 2042 flow [2024-06-28 01:43:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 01:43:30,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-28 01:43:30,544 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 1215 flow. Second operand 9 states and 162 transitions. [2024-06-28 01:43:30,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 186 transitions, 2042 flow [2024-06-28 01:43:30,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 186 transitions, 2006 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-28 01:43:30,584 INFO L231 Difference]: Finished difference. Result has 139 places, 147 transitions, 1513 flow [2024-06-28 01:43:30,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=139, PETRI_TRANSITIONS=147} [2024-06-28 01:43:30,585 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-28 01:43:30,585 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 147 transitions, 1513 flow [2024-06-28 01:43:30,585 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:43:30,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:30,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:30,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:43:30,586 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:43:30,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2003355476, now seen corresponding path program 2 times [2024-06-28 01:43:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:30,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121684246] [2024-06-28 01:43:30,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:31,145 INFO 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:43:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121684246] [2024-06-28 01:43:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121684246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:31,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471409930] [2024-06-28 01:43:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:31,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:31,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:31,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 147 transitions, 1513 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:43:31,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:31,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:31,621 INFO L124 PetriNetUnfolderBase]: 1208/2148 cut-off events. [2024-06-28 01:43:31,621 INFO L125 PetriNetUnfolderBase]: For 21570/21570 co-relation queries the response was YES. [2024-06-28 01:43:31,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10723 conditions, 2148 events. 1208/2148 cut-off events. For 21570/21570 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12710 event pairs, 285 based on Foata normal form. 3/2096 useless extension candidates. Maximal degree in co-relation 10657. Up to 1390 conditions per place. [2024-06-28 01:43:31,634 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 143 selfloop transitions, 40 changer transitions 0/190 dead transitions. [2024-06-28 01:43:31,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 190 transitions, 2195 flow [2024-06-28 01:43:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:43:31,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:43:31,637 INFO L175 Difference]: Start difference. First operand has 139 places, 147 transitions, 1513 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:43:31,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 190 transitions, 2195 flow [2024-06-28 01:43:31,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 190 transitions, 2164 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:43:31,713 INFO L231 Difference]: Finished difference. Result has 146 places, 150 transitions, 1615 flow [2024-06-28 01:43:31,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1615, PETRI_PLACES=146, PETRI_TRANSITIONS=150} [2024-06-28 01:43:31,713 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 105 predicate places. [2024-06-28 01:43:31,714 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 150 transitions, 1615 flow [2024-06-28 01:43:31,714 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:43:31,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:31,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:31,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:43:31,714 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:43:31,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1147626892, now seen corresponding path program 3 times [2024-06-28 01:43:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:31,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387611935] [2024-06-28 01:43:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:32,315 INFO 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:43:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387611935] [2024-06-28 01:43:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387611935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:32,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548586077] [2024-06-28 01:43:32,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:32,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:32,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:32,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:32,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 150 transitions, 1615 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:43:32,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:32,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:32,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:32,770 INFO L124 PetriNetUnfolderBase]: 1231/2114 cut-off events. [2024-06-28 01:43:32,771 INFO L125 PetriNetUnfolderBase]: For 22349/22349 co-relation queries the response was YES. [2024-06-28 01:43:32,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11202 conditions, 2114 events. 1231/2114 cut-off events. For 22349/22349 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12146 event pairs, 175 based on Foata normal form. 1/2082 useless extension candidates. Maximal degree in co-relation 11133. Up to 1631 conditions per place. [2024-06-28 01:43:32,783 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 124 selfloop transitions, 58 changer transitions 0/189 dead transitions. [2024-06-28 01:43:32,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 189 transitions, 2169 flow [2024-06-28 01:43:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 01:43:32,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-28 01:43:32,784 INFO L175 Difference]: Start difference. First operand has 146 places, 150 transitions, 1615 flow. Second operand 8 states and 144 transitions. [2024-06-28 01:43:32,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 189 transitions, 2169 flow [2024-06-28 01:43:32,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 189 transitions, 2110 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:32,837 INFO L231 Difference]: Finished difference. Result has 150 places, 160 transitions, 1810 flow [2024-06-28 01:43:32,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1810, PETRI_PLACES=150, PETRI_TRANSITIONS=160} [2024-06-28 01:43:32,838 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 109 predicate places. [2024-06-28 01:43:32,838 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 160 transitions, 1810 flow [2024-06-28 01:43:32,838 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:43:32,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:32,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:32,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:43:32,838 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:43:32,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1147453912, now seen corresponding path program 4 times [2024-06-28 01:43:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073326916] [2024-06-28 01:43:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:33,469 INFO 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:43:33,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073326916] [2024-06-28 01:43:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073326916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651224665] [2024-06-28 01:43:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:33,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:33,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:33,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 160 transitions, 1810 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:43:33,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:33,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:33,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:33,979 INFO L124 PetriNetUnfolderBase]: 1245/2134 cut-off events. [2024-06-28 01:43:33,979 INFO L125 PetriNetUnfolderBase]: For 23404/23410 co-relation queries the response was YES. [2024-06-28 01:43:33,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11543 conditions, 2134 events. 1245/2134 cut-off events. For 23404/23410 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12262 event pairs, 173 based on Foata normal form. 7/2108 useless extension candidates. Maximal degree in co-relation 11472. Up to 1653 conditions per place. [2024-06-28 01:43:33,992 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 127 selfloop transitions, 62 changer transitions 0/196 dead transitions. [2024-06-28 01:43:33,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 196 transitions, 2338 flow [2024-06-28 01:43:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 01:43:33,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:43:33,993 INFO L175 Difference]: Start difference. First operand has 150 places, 160 transitions, 1810 flow. Second operand 8 states and 148 transitions. [2024-06-28 01:43:33,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 196 transitions, 2338 flow [2024-06-28 01:43:34,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 196 transitions, 2269 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-28 01:43:34,052 INFO L231 Difference]: Finished difference. Result has 155 places, 164 transitions, 1926 flow [2024-06-28 01:43:34,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1926, PETRI_PLACES=155, PETRI_TRANSITIONS=164} [2024-06-28 01:43:34,053 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 114 predicate places. [2024-06-28 01:43:34,053 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 164 transitions, 1926 flow [2024-06-28 01:43:34,053 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:43:34,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:34,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:34,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:43:34,053 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:43:34,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1147454098, now seen corresponding path program 3 times [2024-06-28 01:43:34,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:34,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833554272] [2024-06-28 01:43:34,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:34,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:34,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:43:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:34,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833554272] [2024-06-28 01:43:34,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833554272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:34,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:34,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700242606] [2024-06-28 01:43:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:34,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:34,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:34,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:34,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:34,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 164 transitions, 1926 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:43:34,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:34,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:34,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:34,995 INFO L124 PetriNetUnfolderBase]: 1272/2265 cut-off events. [2024-06-28 01:43:34,995 INFO L125 PetriNetUnfolderBase]: For 26267/26273 co-relation queries the response was YES. [2024-06-28 01:43:35,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 2265 events. 1272/2265 cut-off events. For 26267/26273 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13663 event pairs, 247 based on Foata normal form. 12/2217 useless extension candidates. Maximal degree in co-relation 11818. Up to 1237 conditions per place. [2024-06-28 01:43:35,010 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 138 selfloop transitions, 59 changer transitions 0/204 dead transitions. [2024-06-28 01:43:35,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 204 transitions, 2524 flow [2024-06-28 01:43:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-28 01:43:35,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304054054054054 [2024-06-28 01:43:35,011 INFO L175 Difference]: Start difference. First operand has 155 places, 164 transitions, 1926 flow. Second operand 8 states and 157 transitions. [2024-06-28 01:43:35,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 204 transitions, 2524 flow [2024-06-28 01:43:35,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 204 transitions, 2391 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:35,073 INFO L231 Difference]: Finished difference. Result has 158 places, 166 transitions, 1939 flow [2024-06-28 01:43:35,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1939, PETRI_PLACES=158, PETRI_TRANSITIONS=166} [2024-06-28 01:43:35,074 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 117 predicate places. [2024-06-28 01:43:35,074 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 166 transitions, 1939 flow [2024-06-28 01:43:35,074 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:43:35,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:35,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:35,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:43:35,075 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:43:35,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1178836988, now seen corresponding path program 1 times [2024-06-28 01:43:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:35,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659322476] [2024-06-28 01:43:35,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:35,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659322476] [2024-06-28 01:43:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659322476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274487033] [2024-06-28 01:43:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:35,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:35,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:35,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 166 transitions, 1939 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:43:35,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:35,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:35,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:36,212 INFO L124 PetriNetUnfolderBase]: 1274/2333 cut-off events. [2024-06-28 01:43:36,212 INFO L125 PetriNetUnfolderBase]: For 27052/27052 co-relation queries the response was YES. [2024-06-28 01:43:36,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12187 conditions, 2333 events. 1274/2333 cut-off events. For 27052/27052 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14476 event pairs, 372 based on Foata normal form. 2/2265 useless extension candidates. Maximal degree in co-relation 12114. Up to 1981 conditions per place. [2024-06-28 01:43:36,226 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 168 selfloop transitions, 20 changer transitions 0/195 dead transitions. [2024-06-28 01:43:36,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 195 transitions, 2413 flow [2024-06-28 01:43:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-28 01:43:36,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-28 01:43:36,227 INFO L175 Difference]: Start difference. First operand has 158 places, 166 transitions, 1939 flow. Second operand 9 states and 148 transitions. [2024-06-28 01:43:36,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 195 transitions, 2413 flow [2024-06-28 01:43:36,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 195 transitions, 2281 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:36,289 INFO L231 Difference]: Finished difference. Result has 162 places, 171 transitions, 1906 flow [2024-06-28 01:43:36,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1906, PETRI_PLACES=162, PETRI_TRANSITIONS=171} [2024-06-28 01:43:36,290 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places. [2024-06-28 01:43:36,290 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 171 transitions, 1906 flow [2024-06-28 01:43:36,290 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:43:36,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:36,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:36,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:43:36,290 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:43:36,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash 184494468, now seen corresponding path program 4 times [2024-06-28 01:43:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:36,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101117188] [2024-06-28 01:43:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:36,798 INFO 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:43:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101117188] [2024-06-28 01:43:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101117188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:36,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420010864] [2024-06-28 01:43:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:36,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:36,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:36,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 171 transitions, 1906 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:43:36,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:36,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:36,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:37,357 INFO L124 PetriNetUnfolderBase]: 1307/2417 cut-off events. [2024-06-28 01:43:37,357 INFO L125 PetriNetUnfolderBase]: For 27403/27403 co-relation queries the response was YES. [2024-06-28 01:43:37,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12247 conditions, 2417 events. 1307/2417 cut-off events. For 27403/27403 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15243 event pairs, 384 based on Foata normal form. 3/2342 useless extension candidates. Maximal degree in co-relation 12172. Up to 1994 conditions per place. [2024-06-28 01:43:37,372 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 172 selfloop transitions, 19 changer transitions 0/198 dead transitions. [2024-06-28 01:43:37,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 198 transitions, 2384 flow [2024-06-28 01:43:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 01:43:37,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44144144144144143 [2024-06-28 01:43:37,373 INFO L175 Difference]: Start difference. First operand has 162 places, 171 transitions, 1906 flow. Second operand 9 states and 147 transitions. [2024-06-28 01:43:37,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 198 transitions, 2384 flow [2024-06-28 01:43:37,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 198 transitions, 2325 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:37,444 INFO L231 Difference]: Finished difference. Result has 165 places, 173 transitions, 1914 flow [2024-06-28 01:43:37,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1914, PETRI_PLACES=165, PETRI_TRANSITIONS=173} [2024-06-28 01:43:37,445 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2024-06-28 01:43:37,445 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 173 transitions, 1914 flow [2024-06-28 01:43:37,445 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:43:37,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:37,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:37,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:43:37,445 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:43:37,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1682765498, now seen corresponding path program 5 times [2024-06-28 01:43:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:37,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310894179] [2024-06-28 01:43:37,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:37,934 INFO 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:43:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:37,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310894179] [2024-06-28 01:43:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310894179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006702076] [2024-06-28 01:43:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:37,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:37,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:37,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 173 transitions, 1914 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:43:37,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:37,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:37,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:38,484 INFO L124 PetriNetUnfolderBase]: 1340/2468 cut-off events. [2024-06-28 01:43:38,485 INFO L125 PetriNetUnfolderBase]: For 28819/28819 co-relation queries the response was YES. [2024-06-28 01:43:38,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12522 conditions, 2468 events. 1340/2468 cut-off events. For 28819/28819 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15608 event pairs, 372 based on Foata normal form. 3/2393 useless extension candidates. Maximal degree in co-relation 12446. Up to 1909 conditions per place. [2024-06-28 01:43:38,503 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 171 selfloop transitions, 27 changer transitions 0/205 dead transitions. [2024-06-28 01:43:38,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 205 transitions, 2498 flow [2024-06-28 01:43:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:43:38,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-28 01:43:38,504 INFO L175 Difference]: Start difference. First operand has 165 places, 173 transitions, 1914 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:43:38,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 205 transitions, 2498 flow [2024-06-28 01:43:38,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 205 transitions, 2455 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-28 01:43:38,591 INFO L231 Difference]: Finished difference. Result has 167 places, 175 transitions, 1954 flow [2024-06-28 01:43:38,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1954, PETRI_PLACES=167, PETRI_TRANSITIONS=175} [2024-06-28 01:43:38,592 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2024-06-28 01:43:38,592 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 175 transitions, 1954 flow [2024-06-28 01:43:38,592 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:43:38,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:38,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:38,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:43:38,593 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:43:38,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1682765684, now seen corresponding path program 5 times [2024-06-28 01:43:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252282570] [2024-06-28 01:43:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:39,149 INFO 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:43:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252282570] [2024-06-28 01:43:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252282570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:39,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:39,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836173328] [2024-06-28 01:43:39,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:39,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:39,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:39,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:39,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 175 transitions, 1954 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:43:39,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:39,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:39,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:39,669 INFO L124 PetriNetUnfolderBase]: 1338/2473 cut-off events. [2024-06-28 01:43:39,669 INFO L125 PetriNetUnfolderBase]: For 28322/28322 co-relation queries the response was YES. [2024-06-28 01:43:39,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12596 conditions, 2473 events. 1338/2473 cut-off events. For 28322/28322 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15643 event pairs, 389 based on Foata normal form. 1/2394 useless extension candidates. Maximal degree in co-relation 12519. Up to 2075 conditions per place. [2024-06-28 01:43:39,684 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 168 selfloop transitions, 25 changer transitions 0/200 dead transitions. [2024-06-28 01:43:39,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 200 transitions, 2422 flow [2024-06-28 01:43:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 01:43:39,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:43:39,685 INFO L175 Difference]: Start difference. First operand has 167 places, 175 transitions, 1954 flow. Second operand 8 states and 136 transitions. [2024-06-28 01:43:39,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 200 transitions, 2422 flow [2024-06-28 01:43:39,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 200 transitions, 2364 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:39,749 INFO L231 Difference]: Finished difference. Result has 169 places, 175 transitions, 1954 flow [2024-06-28 01:43:39,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1954, PETRI_PLACES=169, PETRI_TRANSITIONS=175} [2024-06-28 01:43:39,751 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places. [2024-06-28 01:43:39,751 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 175 transitions, 1954 flow [2024-06-28 01:43:39,751 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:43:39,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:39,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:39,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:43:39,751 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:43:39,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1682758988, now seen corresponding path program 6 times [2024-06-28 01:43:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526009309] [2024-06-28 01:43:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:39,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:40,244 INFO 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:43:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526009309] [2024-06-28 01:43:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526009309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477707463] [2024-06-28 01:43:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:40,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:40,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:40,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:40,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:40,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 175 transitions, 1954 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:43:40,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:40,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:40,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:40,762 INFO L124 PetriNetUnfolderBase]: 1332/2460 cut-off events. [2024-06-28 01:43:40,762 INFO L125 PetriNetUnfolderBase]: For 28652/28652 co-relation queries the response was YES. [2024-06-28 01:43:40,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12356 conditions, 2460 events. 1332/2460 cut-off events. For 28652/28652 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15571 event pairs, 386 based on Foata normal form. 3/2384 useless extension candidates. Maximal degree in co-relation 12278. Up to 1902 conditions per place. [2024-06-28 01:43:40,778 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 171 selfloop transitions, 26 changer transitions 0/204 dead transitions. [2024-06-28 01:43:40,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 204 transitions, 2444 flow [2024-06-28 01:43:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:43:40,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-28 01:43:40,779 INFO L175 Difference]: Start difference. First operand has 169 places, 175 transitions, 1954 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:43:40,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 204 transitions, 2444 flow [2024-06-28 01:43:40,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 204 transitions, 2246 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-28 01:43:40,861 INFO L231 Difference]: Finished difference. Result has 169 places, 175 transitions, 1813 flow [2024-06-28 01:43:40,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1813, PETRI_PLACES=169, PETRI_TRANSITIONS=175} [2024-06-28 01:43:40,862 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places. [2024-06-28 01:43:40,862 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 175 transitions, 1813 flow [2024-06-28 01:43:40,862 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:43:40,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:40,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:40,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:43:40,863 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:43:40,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 461505964, now seen corresponding path program 7 times [2024-06-28 01:43:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:40,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777600431] [2024-06-28 01:43:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777600431] [2024-06-28 01:43:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777600431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5871499] [2024-06-28 01:43:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:41,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:41,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:41,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 175 transitions, 1813 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:43:41,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:41,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:41,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:42,136 INFO L124 PetriNetUnfolderBase]: 1848/3438 cut-off events. [2024-06-28 01:43:42,136 INFO L125 PetriNetUnfolderBase]: For 33916/33916 co-relation queries the response was YES. [2024-06-28 01:43:42,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16937 conditions, 3438 events. 1848/3438 cut-off events. For 33916/33916 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23797 event pairs, 292 based on Foata normal form. 3/3325 useless extension candidates. Maximal degree in co-relation 16860. Up to 1930 conditions per place. [2024-06-28 01:43:42,163 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 221 selfloop transitions, 91 changer transitions 0/319 dead transitions. [2024-06-28 01:43:42,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 319 transitions, 4022 flow [2024-06-28 01:43:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-28 01:43:42,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285285285285285 [2024-06-28 01:43:42,165 INFO L175 Difference]: Start difference. First operand has 169 places, 175 transitions, 1813 flow. Second operand 9 states and 176 transitions. [2024-06-28 01:43:42,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 319 transitions, 4022 flow [2024-06-28 01:43:42,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 319 transitions, 3899 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:42,261 INFO L231 Difference]: Finished difference. Result has 174 places, 238 transitions, 2849 flow [2024-06-28 01:43:42,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2849, PETRI_PLACES=174, PETRI_TRANSITIONS=238} [2024-06-28 01:43:42,261 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places. [2024-06-28 01:43:42,261 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 238 transitions, 2849 flow [2024-06-28 01:43:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:42,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:42,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:42,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:43:42,262 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:43:42,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash 441099060, now seen corresponding path program 8 times [2024-06-28 01:43:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:42,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535285620] [2024-06-28 01:43:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:42,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:43:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:42,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535285620] [2024-06-28 01:43:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535285620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:42,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:43:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566737039] [2024-06-28 01:43:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:42,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:43:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:42,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:43:42,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:43:42,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:42,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 238 transitions, 2849 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:43:42,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:42,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:43,610 INFO L124 PetriNetUnfolderBase]: 1842/3429 cut-off events. [2024-06-28 01:43:43,610 INFO L125 PetriNetUnfolderBase]: For 36151/36151 co-relation queries the response was YES. [2024-06-28 01:43:43,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18471 conditions, 3429 events. 1842/3429 cut-off events. For 36151/36151 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23686 event pairs, 292 based on Foata normal form. 3/3316 useless extension candidates. Maximal degree in co-relation 18389. Up to 1926 conditions per place. [2024-06-28 01:43:43,636 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 216 selfloop transitions, 93 changer transitions 0/316 dead transitions. [2024-06-28 01:43:43,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 316 transitions, 4216 flow [2024-06-28 01:43:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 01:43:43,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165165165165165 [2024-06-28 01:43:43,637 INFO L175 Difference]: Start difference. First operand has 174 places, 238 transitions, 2849 flow. Second operand 9 states and 172 transitions. [2024-06-28 01:43:43,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 316 transitions, 4216 flow [2024-06-28 01:43:43,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 316 transitions, 4090 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-28 01:43:43,745 INFO L231 Difference]: Finished difference. Result has 181 places, 241 transitions, 3012 flow [2024-06-28 01:43:43,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2746, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3012, PETRI_PLACES=181, PETRI_TRANSITIONS=241} [2024-06-28 01:43:43,745 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places. [2024-06-28 01:43:43,745 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 241 transitions, 3012 flow [2024-06-28 01:43:43,745 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:43:43,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:43,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:43,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:43:43,746 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:43:43,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:43,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1673253427, now seen corresponding path program 1 times [2024-06-28 01:43:43,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:43,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777171194] [2024-06-28 01:43:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:44,757 INFO 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:43:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:44,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777171194] [2024-06-28 01:43:44,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777171194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:44,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:44,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:43:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218833752] [2024-06-28 01:43:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:44,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:43:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:44,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:43:44,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:43:44,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:44,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 241 transitions, 3012 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:43:44,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:44,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:44,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:45,571 INFO L124 PetriNetUnfolderBase]: 1839/3329 cut-off events. [2024-06-28 01:43:45,571 INFO L125 PetriNetUnfolderBase]: For 36319/36319 co-relation queries the response was YES. [2024-06-28 01:43:45,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18657 conditions, 3329 events. 1839/3329 cut-off events. For 36319/36319 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22467 event pairs, 606 based on Foata normal form. 2/3235 useless extension candidates. Maximal degree in co-relation 18572. Up to 2847 conditions per place. [2024-06-28 01:43:45,597 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 241 selfloop transitions, 24 changer transitions 0/272 dead transitions. [2024-06-28 01:43:45,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 272 transitions, 3640 flow [2024-06-28 01:43:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 01:43:45,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-06-28 01:43:45,598 INFO L175 Difference]: Start difference. First operand has 181 places, 241 transitions, 3012 flow. Second operand 9 states and 151 transitions. [2024-06-28 01:43:45,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 272 transitions, 3640 flow [2024-06-28 01:43:45,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 272 transitions, 3473 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:45,713 INFO L231 Difference]: Finished difference. Result has 185 places, 243 transitions, 2920 flow [2024-06-28 01:43:45,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2920, PETRI_PLACES=185, PETRI_TRANSITIONS=243} [2024-06-28 01:43:45,714 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-28 01:43:45,714 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 243 transitions, 2920 flow [2024-06-28 01:43:45,714 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:43:45,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:45,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:43:45,715 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:45,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -862908327, now seen corresponding path program 1 times [2024-06-28 01:43:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556625188] [2024-06-28 01:43:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:45,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:45,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556625188] [2024-06-28 01:43:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556625188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:45,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:45,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:43:45,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633237247] [2024-06-28 01:43:45,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:45,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:43:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:45,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:43:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:43:45,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-28 01:43:45,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 243 transitions, 2920 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:43:45,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:45,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-28 01:43:45,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:46,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][247], [Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 509#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 189#true, 251#true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 391#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 393#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 519#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 529#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 515#true, Black: 525#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 527#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 531#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 273#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 582#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 419#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 290#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 553#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 549#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 10#L775true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 431#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 227#true, Black: 299#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 12#L762true, Black: 304#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 357#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 574#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 2 ~y~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 566#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 321#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 370#true, Black: 444#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 454#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 341#true, Black: 332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 331#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 333#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 465#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 59#true, Black: 481#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 149#true, Black: 108#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 5#L832true, Black: 362#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 556#true, Black: 495#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 378#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 376#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:43:46,280 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-28 01:43:46,280 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-28 01:43:46,280 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-28 01:43:46,280 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-28 01:43:46,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][291], [Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 509#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 189#true, 251#true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 391#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 393#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 519#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 529#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 515#true, Black: 525#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 527#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 531#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 273#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 419#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 290#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 553#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 549#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 10#L775true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 431#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 227#true, Black: 299#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 12#L762true, Black: 304#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 357#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 574#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 2 ~y~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 566#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 321#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 370#true, Black: 444#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 454#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 341#true, Black: 332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 331#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 333#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 465#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 589#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 59#true, 29#L18-1true, Black: 481#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 149#true, Black: 108#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 362#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 556#true, Black: 495#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 378#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 376#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:43:46,353 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-06-28 01:43:46,353 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-28 01:43:46,353 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-28 01:43:46,353 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-28 01:43:46,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][291], [Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 509#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 189#true, 251#true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 391#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 393#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 519#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 529#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 515#true, Black: 525#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 527#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 531#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 273#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 419#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 290#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 6#L18-5true, Black: 553#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 549#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 10#L775true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 431#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 227#true, Black: 299#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 12#L762true, Black: 304#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 357#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 574#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 2 ~y~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 566#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 321#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 370#true, Black: 444#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 454#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 341#true, Black: 332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 331#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 333#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 465#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 589#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 59#true, Black: 481#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 149#true, Black: 108#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 362#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 556#true, Black: 495#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 378#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 376#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:43:46,396 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-28 01:43:46,396 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:43:46,396 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:43:46,396 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:43:46,431 INFO L124 PetriNetUnfolderBase]: 2190/3808 cut-off events. [2024-06-28 01:43:46,431 INFO L125 PetriNetUnfolderBase]: For 31857/33353 co-relation queries the response was YES. [2024-06-28 01:43:46,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19876 conditions, 3808 events. 2190/3808 cut-off events. For 31857/33353 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25033 event pairs, 271 based on Foata normal form. 256/3845 useless extension candidates. Maximal degree in co-relation 19791. Up to 1724 conditions per place. [2024-06-28 01:43:46,456 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 174 selfloop transitions, 34 changer transitions 141/460 dead transitions. [2024-06-28 01:43:46,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 460 transitions, 6216 flow [2024-06-28 01:43:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-28 01:43:46,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-28 01:43:46,457 INFO L175 Difference]: Start difference. First operand has 185 places, 243 transitions, 2920 flow. Second operand 8 states and 178 transitions. [2024-06-28 01:43:46,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 460 transitions, 6216 flow [2024-06-28 01:43:46,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 460 transitions, 6070 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-28 01:43:46,558 INFO L231 Difference]: Finished difference. Result has 191 places, 246 transitions, 3008 flow [2024-06-28 01:43:46,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3008, PETRI_PLACES=191, PETRI_TRANSITIONS=246} [2024-06-28 01:43:46,559 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 150 predicate places. [2024-06-28 01:43:46,559 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 246 transitions, 3008 flow [2024-06-28 01:43:46,559 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:43:46,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:46,559 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:43:46,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:43:46,559 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:43:46,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1153034663, now seen corresponding path program 1 times [2024-06-28 01:43:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814405469] [2024-06-28 01:43:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:47,221 INFO 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:43:47,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:47,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814405469] [2024-06-28 01:43:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814405469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:47,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557497992] [2024-06-28 01:43:47,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:47,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:47,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:47,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:47,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:47,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 246 transitions, 3008 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:43:47,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:47,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:47,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:48,014 INFO L124 PetriNetUnfolderBase]: 1821/3365 cut-off events. [2024-06-28 01:43:48,014 INFO L125 PetriNetUnfolderBase]: For 36666/36706 co-relation queries the response was YES. [2024-06-28 01:43:48,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19160 conditions, 3365 events. 1821/3365 cut-off events. For 36666/36706 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22856 event pairs, 416 based on Foata normal form. 42/3381 useless extension candidates. Maximal degree in co-relation 19070. Up to 2498 conditions per place. [2024-06-28 01:43:48,040 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 211 selfloop transitions, 62 changer transitions 7/288 dead transitions. [2024-06-28 01:43:48,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 288 transitions, 3787 flow [2024-06-28 01:43:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:43:48,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804804804804805 [2024-06-28 01:43:48,041 INFO L175 Difference]: Start difference. First operand has 191 places, 246 transitions, 3008 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:43:48,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 288 transitions, 3787 flow [2024-06-28 01:43:48,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 288 transitions, 3783 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:43:48,175 INFO L231 Difference]: Finished difference. Result has 197 places, 247 transitions, 3161 flow [2024-06-28 01:43:48,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3161, PETRI_PLACES=197, PETRI_TRANSITIONS=247} [2024-06-28 01:43:48,175 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2024-06-28 01:43:48,175 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 247 transitions, 3161 flow [2024-06-28 01:43:48,176 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:43:48,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:48,176 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:43:48,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:43:48,176 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:48,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1347617395, now seen corresponding path program 2 times [2024-06-28 01:43:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:48,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614501681] [2024-06-28 01:43:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:48,861 INFO 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:43:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614501681] [2024-06-28 01:43:48,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614501681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:48,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:48,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499072501] [2024-06-28 01:43:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:48,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:48,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:48,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:48,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:48,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 247 transitions, 3161 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:43:48,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:48,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:48,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:49,535 INFO L124 PetriNetUnfolderBase]: 1714/3104 cut-off events. [2024-06-28 01:43:49,535 INFO L125 PetriNetUnfolderBase]: For 37764/37811 co-relation queries the response was YES. [2024-06-28 01:43:49,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18008 conditions, 3104 events. 1714/3104 cut-off events. For 37764/37811 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20228 event pairs, 315 based on Foata normal form. 49/3126 useless extension candidates. Maximal degree in co-relation 17915. Up to 2084 conditions per place. [2024-06-28 01:43:49,558 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 210 selfloop transitions, 70 changer transitions 0/288 dead transitions. [2024-06-28 01:43:49,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 288 transitions, 4006 flow [2024-06-28 01:43:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-28 01:43:49,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-06-28 01:43:49,559 INFO L175 Difference]: Start difference. First operand has 197 places, 247 transitions, 3161 flow. Second operand 9 states and 161 transitions. [2024-06-28 01:43:49,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 288 transitions, 4006 flow [2024-06-28 01:43:49,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 288 transitions, 3811 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-28 01:43:49,691 INFO L231 Difference]: Finished difference. Result has 198 places, 251 transitions, 3169 flow [2024-06-28 01:43:49,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3169, PETRI_PLACES=198, PETRI_TRANSITIONS=251} [2024-06-28 01:43:49,692 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places. [2024-06-28 01:43:49,692 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 251 transitions, 3169 flow [2024-06-28 01:43:49,692 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:43:49,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:49,693 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:43:49,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:43:49,693 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:43:49,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1345743445, now seen corresponding path program 3 times [2024-06-28 01:43:49,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:49,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455749210] [2024-06-28 01:43:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:50,404 INFO 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:43:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455749210] [2024-06-28 01:43:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455749210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:50,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252673892] [2024-06-28 01:43:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:50,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:50,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:50,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:50,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 251 transitions, 3169 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:43:50,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:50,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:50,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:51,113 INFO L124 PetriNetUnfolderBase]: 1743/3142 cut-off events. [2024-06-28 01:43:51,113 INFO L125 PetriNetUnfolderBase]: For 39541/39605 co-relation queries the response was YES. [2024-06-28 01:43:51,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18133 conditions, 3142 events. 1743/3142 cut-off events. For 39541/39605 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20455 event pairs, 326 based on Foata normal form. 66/3112 useless extension candidates. Maximal degree in co-relation 18040. Up to 2246 conditions per place. [2024-06-28 01:43:51,138 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 210 selfloop transitions, 76 changer transitions 0/294 dead transitions. [2024-06-28 01:43:51,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 294 transitions, 4045 flow [2024-06-28 01:43:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:43:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:43:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:43:51,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-28 01:43:51,139 INFO L175 Difference]: Start difference. First operand has 198 places, 251 transitions, 3169 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:43:51,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 294 transitions, 4045 flow [2024-06-28 01:43:51,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 294 transitions, 3928 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:43:51,296 INFO L231 Difference]: Finished difference. Result has 204 places, 253 transitions, 3240 flow [2024-06-28 01:43:51,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3060, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3240, PETRI_PLACES=204, PETRI_TRANSITIONS=253} [2024-06-28 01:43:51,296 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 163 predicate places. [2024-06-28 01:43:51,297 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 253 transitions, 3240 flow [2024-06-28 01:43:51,298 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:43:51,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:51,299 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:43:51,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:43:51,299 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:43:51,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1345739570, now seen corresponding path program 1 times [2024-06-28 01:43:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426588581] [2024-06-28 01:43:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:51,906 INFO 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:43:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426588581] [2024-06-28 01:43:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426588581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:51,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:51,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794521891] [2024-06-28 01:43:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:51,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:51,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:51,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:51,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:51,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 253 transitions, 3240 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:43:51,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:51,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:51,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:52,775 INFO L124 PetriNetUnfolderBase]: 1805/3182 cut-off events. [2024-06-28 01:43:52,776 INFO L125 PetriNetUnfolderBase]: For 43597/43659 co-relation queries the response was YES. [2024-06-28 01:43:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18792 conditions, 3182 events. 1805/3182 cut-off events. For 43597/43659 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20295 event pairs, 394 based on Foata normal form. 65/3162 useless extension candidates. Maximal degree in co-relation 18697. Up to 1036 conditions per place. [2024-06-28 01:43:52,806 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 179 selfloop transitions, 132 changer transitions 0/319 dead transitions. [2024-06-28 01:43:52,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 319 transitions, 4286 flow [2024-06-28 01:43:52,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:43:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:43:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2024-06-28 01:43:52,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:43:52,807 INFO L175 Difference]: Start difference. First operand has 204 places, 253 transitions, 3240 flow. Second operand 12 states and 222 transitions. [2024-06-28 01:43:52,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 319 transitions, 4286 flow [2024-06-28 01:43:52,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 319 transitions, 4171 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:52,957 INFO L231 Difference]: Finished difference. Result has 211 places, 259 transitions, 3512 flow [2024-06-28 01:43:52,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3125, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3512, PETRI_PLACES=211, PETRI_TRANSITIONS=259} [2024-06-28 01:43:52,957 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2024-06-28 01:43:52,958 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 259 transitions, 3512 flow [2024-06-28 01:43:52,958 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:43:52,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:52,958 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:43:52,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:43:52,958 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:43:52,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1845438937, now seen corresponding path program 4 times [2024-06-28 01:43:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883620303] [2024-06-28 01:43:52,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:52,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:53,622 INFO 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:43:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883620303] [2024-06-28 01:43:53,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883620303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:53,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863365872] [2024-06-28 01:43:53,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:53,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:53,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:53,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:53,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:53,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 259 transitions, 3512 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:43:53,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:53,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:53,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:54,486 INFO L124 PetriNetUnfolderBase]: 1802/3281 cut-off events. [2024-06-28 01:43:54,486 INFO L125 PetriNetUnfolderBase]: For 46406/46470 co-relation queries the response was YES. [2024-06-28 01:43:54,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20053 conditions, 3281 events. 1802/3281 cut-off events. For 46406/46470 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21620 event pairs, 365 based on Foata normal form. 66/3242 useless extension candidates. Maximal degree in co-relation 19955. Up to 2386 conditions per place. [2024-06-28 01:43:54,512 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 217 selfloop transitions, 79 changer transitions 0/304 dead transitions. [2024-06-28 01:43:54,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 304 transitions, 4325 flow [2024-06-28 01:43:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:43:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:43:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-28 01:43:54,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668304668304668 [2024-06-28 01:43:54,513 INFO L175 Difference]: Start difference. First operand has 211 places, 259 transitions, 3512 flow. Second operand 11 states and 190 transitions. [2024-06-28 01:43:54,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 304 transitions, 4325 flow [2024-06-28 01:43:54,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 304 transitions, 4150 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:54,654 INFO L231 Difference]: Finished difference. Result has 214 places, 259 transitions, 3501 flow [2024-06-28 01:43:54,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3337, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3501, PETRI_PLACES=214, PETRI_TRANSITIONS=259} [2024-06-28 01:43:54,654 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2024-06-28 01:43:54,654 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 259 transitions, 3501 flow [2024-06-28 01:43:54,655 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:43:54,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:54,655 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:43:54,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:43:54,655 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:43:54,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1080476497, now seen corresponding path program 5 times [2024-06-28 01:43:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346567296] [2024-06-28 01:43:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:55,328 INFO 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:43:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:55,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346567296] [2024-06-28 01:43:55,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346567296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:55,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159459260] [2024-06-28 01:43:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:55,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:55,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:55,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:55,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:55,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 259 transitions, 3501 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:43:55,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:55,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:55,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:56,058 INFO L124 PetriNetUnfolderBase]: 1815/3273 cut-off events. [2024-06-28 01:43:56,058 INFO L125 PetriNetUnfolderBase]: For 45383/45444 co-relation queries the response was YES. [2024-06-28 01:43:56,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20230 conditions, 3273 events. 1815/3273 cut-off events. For 45383/45444 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21543 event pairs, 297 based on Foata normal form. 63/3235 useless extension candidates. Maximal degree in co-relation 20130. Up to 2398 conditions per place. [2024-06-28 01:43:56,082 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 219 selfloop transitions, 74 changer transitions 0/301 dead transitions. [2024-06-28 01:43:56,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 301 transitions, 4375 flow [2024-06-28 01:43:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-28 01:43:56,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2024-06-28 01:43:56,083 INFO L175 Difference]: Start difference. First operand has 214 places, 259 transitions, 3501 flow. Second operand 9 states and 166 transitions. [2024-06-28 01:43:56,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 301 transitions, 4375 flow [2024-06-28 01:43:56,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 301 transitions, 4214 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-28 01:43:56,235 INFO L231 Difference]: Finished difference. Result has 214 places, 261 transitions, 3520 flow [2024-06-28 01:43:56,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3520, PETRI_PLACES=214, PETRI_TRANSITIONS=261} [2024-06-28 01:43:56,235 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2024-06-28 01:43:56,235 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 261 transitions, 3520 flow [2024-06-28 01:43:56,235 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:43:56,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:56,235 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:43:56,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:43:56,236 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:43:56,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1979988786, now seen corresponding path program 2 times [2024-06-28 01:43:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:56,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824908030] [2024-06-28 01:43:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:56,866 INFO 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:43:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824908030] [2024-06-28 01:43:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824908030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:56,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:56,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108434974] [2024-06-28 01:43:56,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:56,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:56,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:56,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:56,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 261 transitions, 3520 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:43:56,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:56,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:56,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:57,779 INFO L124 PetriNetUnfolderBase]: 1848/3216 cut-off events. [2024-06-28 01:43:57,780 INFO L125 PetriNetUnfolderBase]: For 47424/47486 co-relation queries the response was YES. [2024-06-28 01:43:57,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20394 conditions, 3216 events. 1848/3216 cut-off events. For 47424/47486 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20485 event pairs, 285 based on Foata normal form. 65/3202 useless extension candidates. Maximal degree in co-relation 20292. Up to 1235 conditions per place. [2024-06-28 01:43:57,801 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 184 selfloop transitions, 135 changer transitions 0/327 dead transitions. [2024-06-28 01:43:57,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 327 transitions, 4588 flow [2024-06-28 01:43:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:43:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:43:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-28 01:43:57,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-28 01:43:57,803 INFO L175 Difference]: Start difference. First operand has 214 places, 261 transitions, 3520 flow. Second operand 11 states and 213 transitions. [2024-06-28 01:43:57,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 327 transitions, 4588 flow [2024-06-28 01:43:57,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 327 transitions, 4395 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:57,980 INFO L231 Difference]: Finished difference. Result has 217 places, 264 transitions, 3640 flow [2024-06-28 01:43:57,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3327, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3640, PETRI_PLACES=217, PETRI_TRANSITIONS=264} [2024-06-28 01:43:57,981 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 176 predicate places. [2024-06-28 01:43:57,981 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 264 transitions, 3640 flow [2024-06-28 01:43:57,981 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:43:57,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:57,981 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:43:57,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:43:57,981 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:43:57,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1979988941, now seen corresponding path program 6 times [2024-06-28 01:43:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189422877] [2024-06-28 01:43:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:58,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:43:58,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189422877] [2024-06-28 01:43:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189422877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:58,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:58,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341380588] [2024-06-28 01:43:58,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:58,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:58,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:58,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:58,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:43:58,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 264 transitions, 3640 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:43:58,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:58,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:43:58,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:59,648 INFO L124 PetriNetUnfolderBase]: 1861/3362 cut-off events. [2024-06-28 01:43:59,649 INFO L125 PetriNetUnfolderBase]: For 50706/50770 co-relation queries the response was YES. [2024-06-28 01:43:59,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21130 conditions, 3362 events. 1861/3362 cut-off events. For 50706/50770 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22226 event pairs, 361 based on Foata normal form. 66/3323 useless extension candidates. Maximal degree in co-relation 21028. Up to 2556 conditions per place. [2024-06-28 01:43:59,671 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 226 selfloop transitions, 75 changer transitions 0/309 dead transitions. [2024-06-28 01:43:59,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 309 transitions, 4465 flow [2024-06-28 01:43:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:43:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:43:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:43:59,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-28 01:43:59,673 INFO L175 Difference]: Start difference. First operand has 217 places, 264 transitions, 3640 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:43:59,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 309 transitions, 4465 flow [2024-06-28 01:43:59,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 309 transitions, 4189 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:59,850 INFO L231 Difference]: Finished difference. Result has 219 places, 265 transitions, 3533 flow [2024-06-28 01:43:59,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3364, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3533, PETRI_PLACES=219, PETRI_TRANSITIONS=265} [2024-06-28 01:43:59,851 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2024-06-28 01:43:59,851 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 265 transitions, 3533 flow [2024-06-28 01:43:59,851 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:43:59,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:59,851 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:43:59,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:43:59,851 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:43:59,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1974476676, now seen corresponding path program 3 times [2024-06-28 01:43:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259865958] [2024-06-28 01:43:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:00,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:00,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259865958] [2024-06-28 01:44:00,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259865958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:00,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:00,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643840287] [2024-06-28 01:44:00,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:00,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:00,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:00,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:00,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:00,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:00,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 265 transitions, 3533 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:44:00,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:00,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:00,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:01,131 INFO L124 PetriNetUnfolderBase]: 1887/3484 cut-off events. [2024-06-28 01:44:01,131 INFO L125 PetriNetUnfolderBase]: For 49369/49408 co-relation queries the response was YES. [2024-06-28 01:44:01,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20856 conditions, 3484 events. 1887/3484 cut-off events. For 49369/49408 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23697 event pairs, 316 based on Foata normal form. 40/3412 useless extension candidates. Maximal degree in co-relation 20753. Up to 2368 conditions per place. [2024-06-28 01:44:01,158 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 224 selfloop transitions, 118 changer transitions 0/350 dead transitions. [2024-06-28 01:44:01,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 350 transitions, 4950 flow [2024-06-28 01:44:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-28 01:44:01,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-06-28 01:44:01,159 INFO L175 Difference]: Start difference. First operand has 219 places, 265 transitions, 3533 flow. Second operand 9 states and 164 transitions. [2024-06-28 01:44:01,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 350 transitions, 4950 flow [2024-06-28 01:44:01,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 350 transitions, 4791 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:44:01,347 INFO L231 Difference]: Finished difference. Result has 224 places, 308 transitions, 4343 flow [2024-06-28 01:44:01,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3374, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4343, PETRI_PLACES=224, PETRI_TRANSITIONS=308} [2024-06-28 01:44:01,347 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 183 predicate places. [2024-06-28 01:44:01,347 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 308 transitions, 4343 flow [2024-06-28 01:44:01,347 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:44:01,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:01,348 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:44:01,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:44:01,348 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:44:01,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1974482256, now seen corresponding path program 4 times [2024-06-28 01:44:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:01,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107687247] [2024-06-28 01:44:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:01,981 INFO 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:44:01,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:01,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107687247] [2024-06-28 01:44:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107687247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:01,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:01,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201763093] [2024-06-28 01:44:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:01,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:02,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:02,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 308 transitions, 4343 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:44:02,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:02,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:02,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:02,782 INFO L124 PetriNetUnfolderBase]: 1937/3525 cut-off events. [2024-06-28 01:44:02,782 INFO L125 PetriNetUnfolderBase]: For 55898/55948 co-relation queries the response was YES. [2024-06-28 01:44:02,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22533 conditions, 3525 events. 1937/3525 cut-off events. For 55898/55948 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23742 event pairs, 399 based on Foata normal form. 51/3465 useless extension candidates. Maximal degree in co-relation 22425. Up to 2539 conditions per place. [2024-06-28 01:44:02,814 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 243 selfloop transitions, 113 changer transitions 0/364 dead transitions. [2024-06-28 01:44:02,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 364 transitions, 5600 flow [2024-06-28 01:44:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 01:44:02,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2024-06-28 01:44:02,815 INFO L175 Difference]: Start difference. First operand has 224 places, 308 transitions, 4343 flow. Second operand 10 states and 174 transitions. [2024-06-28 01:44:02,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 364 transitions, 5600 flow [2024-06-28 01:44:03,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 364 transitions, 5498 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-06-28 01:44:03,059 INFO L231 Difference]: Finished difference. Result has 234 places, 323 transitions, 4797 flow [2024-06-28 01:44:03,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4271, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4797, PETRI_PLACES=234, PETRI_TRANSITIONS=323} [2024-06-28 01:44:03,059 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places. [2024-06-28 01:44:03,059 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 323 transitions, 4797 flow [2024-06-28 01:44:03,060 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:44:03,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:03,060 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:44:03,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:44:03,060 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:44:03,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1974482411, now seen corresponding path program 7 times [2024-06-28 01:44:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192159535] [2024-06-28 01:44:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:03,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:03,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192159535] [2024-06-28 01:44:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192159535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333358208] [2024-06-28 01:44:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:03,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:03,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:03,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:03,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:03,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 323 transitions, 4797 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:44:03,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:03,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:03,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:04,534 INFO L124 PetriNetUnfolderBase]: 1950/3478 cut-off events. [2024-06-28 01:44:04,534 INFO L125 PetriNetUnfolderBase]: For 59509/59553 co-relation queries the response was YES. [2024-06-28 01:44:04,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23040 conditions, 3478 events. 1950/3478 cut-off events. For 59509/59553 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23025 event pairs, 402 based on Foata normal form. 46/3422 useless extension candidates. Maximal degree in co-relation 22928. Up to 2777 conditions per place. [2024-06-28 01:44:04,567 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 282 selfloop transitions, 68 changer transitions 0/358 dead transitions. [2024-06-28 01:44:04,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 358 transitions, 5676 flow [2024-06-28 01:44:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:44:04,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-28 01:44:04,568 INFO L175 Difference]: Start difference. First operand has 234 places, 323 transitions, 4797 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:44:04,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 358 transitions, 5676 flow [2024-06-28 01:44:04,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 358 transitions, 5583 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-28 01:44:04,823 INFO L231 Difference]: Finished difference. Result has 239 places, 324 transitions, 4861 flow [2024-06-28 01:44:04,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4704, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4861, PETRI_PLACES=239, PETRI_TRANSITIONS=324} [2024-06-28 01:44:04,824 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2024-06-28 01:44:04,824 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 324 transitions, 4861 flow [2024-06-28 01:44:04,832 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:44:04,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:04,832 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:44:04,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:44:04,833 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:44:04,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1216903796, now seen corresponding path program 5 times [2024-06-28 01:44:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314097762] [2024-06-28 01:44:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:05,542 INFO 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:44:05,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:05,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314097762] [2024-06-28 01:44:05,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314097762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:05,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44799525] [2024-06-28 01:44:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:05,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:05,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:05,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:05,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 324 transitions, 4861 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:44:05,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:05,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:05,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:06,366 INFO L124 PetriNetUnfolderBase]: 1981/3528 cut-off events. [2024-06-28 01:44:06,366 INFO L125 PetriNetUnfolderBase]: For 62473/62515 co-relation queries the response was YES. [2024-06-28 01:44:06,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23586 conditions, 3528 events. 1981/3528 cut-off events. For 62473/62515 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23276 event pairs, 353 based on Foata normal form. 46/3478 useless extension candidates. Maximal degree in co-relation 23472. Up to 1801 conditions per place. [2024-06-28 01:44:06,399 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 211 selfloop transitions, 153 changer transitions 0/372 dead transitions. [2024-06-28 01:44:06,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 372 transitions, 5861 flow [2024-06-28 01:44:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 01:44:06,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-28 01:44:06,400 INFO L175 Difference]: Start difference. First operand has 239 places, 324 transitions, 4861 flow. Second operand 9 states and 169 transitions. [2024-06-28 01:44:06,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 372 transitions, 5861 flow [2024-06-28 01:44:06,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 372 transitions, 5725 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:44:06,687 INFO L231 Difference]: Finished difference. Result has 242 places, 327 transitions, 5092 flow [2024-06-28 01:44:06,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4725, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5092, PETRI_PLACES=242, PETRI_TRANSITIONS=327} [2024-06-28 01:44:06,688 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 201 predicate places. [2024-06-28 01:44:06,688 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 327 transitions, 5092 flow [2024-06-28 01:44:06,688 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:44:06,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:06,688 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:44:06,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:44:06,688 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:44:06,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash 234143682, now seen corresponding path program 6 times [2024-06-28 01:44:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285173571] [2024-06-28 01:44:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:07,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:07,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285173571] [2024-06-28 01:44:07,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285173571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:07,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:07,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:07,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632399765] [2024-06-28 01:44:07,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:07,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:07,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:07,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 327 transitions, 5092 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:44:07,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:07,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:07,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:08,095 INFO L124 PetriNetUnfolderBase]: 2004/3600 cut-off events. [2024-06-28 01:44:08,095 INFO L125 PetriNetUnfolderBase]: For 64443/64494 co-relation queries the response was YES. [2024-06-28 01:44:08,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24569 conditions, 3600 events. 2004/3600 cut-off events. For 64443/64494 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 24112 event pairs, 537 based on Foata normal form. 52/3542 useless extension candidates. Maximal degree in co-relation 24454. Up to 3050 conditions per place. [2024-06-28 01:44:08,131 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 318 selfloop transitions, 47 changer transitions 0/373 dead transitions. [2024-06-28 01:44:08,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 373 transitions, 6141 flow [2024-06-28 01:44:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 01:44:08,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2024-06-28 01:44:08,132 INFO L175 Difference]: Start difference. First operand has 242 places, 327 transitions, 5092 flow. Second operand 9 states and 155 transitions. [2024-06-28 01:44:08,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 373 transitions, 6141 flow [2024-06-28 01:44:08,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 373 transitions, 5825 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:08,450 INFO L231 Difference]: Finished difference. Result has 245 places, 339 transitions, 5049 flow [2024-06-28 01:44:08,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4776, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5049, PETRI_PLACES=245, PETRI_TRANSITIONS=339} [2024-06-28 01:44:08,451 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2024-06-28 01:44:08,451 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 339 transitions, 5049 flow [2024-06-28 01:44:08,451 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:44:08,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:08,452 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:44:08,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:44:08,452 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:44:08,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash 233941872, now seen corresponding path program 7 times [2024-06-28 01:44:08,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:08,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679497496] [2024-06-28 01:44:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:08,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679497496] [2024-06-28 01:44:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679497496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:09,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:09,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:09,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143525360] [2024-06-28 01:44:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:09,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:09,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:09,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:09,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:09,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 339 transitions, 5049 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:44:09,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:09,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:09,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:09,887 INFO L124 PetriNetUnfolderBase]: 2018/3608 cut-off events. [2024-06-28 01:44:09,888 INFO L125 PetriNetUnfolderBase]: For 62384/62435 co-relation queries the response was YES. [2024-06-28 01:44:09,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24170 conditions, 3608 events. 2018/3608 cut-off events. For 62384/62435 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24059 event pairs, 546 based on Foata normal form. 52/3551 useless extension candidates. Maximal degree in co-relation 24053. Up to 3072 conditions per place. [2024-06-28 01:44:09,921 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 320 selfloop transitions, 53 changer transitions 0/381 dead transitions. [2024-06-28 01:44:09,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 381 transitions, 6091 flow [2024-06-28 01:44:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:44:09,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-28 01:44:09,922 INFO L175 Difference]: Start difference. First operand has 245 places, 339 transitions, 5049 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:44:09,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 381 transitions, 6091 flow [2024-06-28 01:44:10,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 381 transitions, 5985 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-28 01:44:10,215 INFO L231 Difference]: Finished difference. Result has 251 places, 349 transitions, 5230 flow [2024-06-28 01:44:10,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4947, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5230, PETRI_PLACES=251, PETRI_TRANSITIONS=349} [2024-06-28 01:44:10,216 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2024-06-28 01:44:10,216 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 349 transitions, 5230 flow [2024-06-28 01:44:10,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:10,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:10,216 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:44:10,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:44:10,216 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:44:10,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2118382643, now seen corresponding path program 8 times [2024-06-28 01:44:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:10,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594211398] [2024-06-28 01:44:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:10,883 INFO 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:44:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594211398] [2024-06-28 01:44:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594211398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478890736] [2024-06-28 01:44:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:10,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:10,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:10,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:10,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 349 transitions, 5230 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:44:10,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:10,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:10,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:11,724 INFO L124 PetriNetUnfolderBase]: 2015/3528 cut-off events. [2024-06-28 01:44:11,724 INFO L125 PetriNetUnfolderBase]: For 62792/62843 co-relation queries the response was YES. [2024-06-28 01:44:11,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24109 conditions, 3528 events. 2015/3528 cut-off events. For 62792/62843 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23065 event pairs, 562 based on Foata normal form. 53/3485 useless extension candidates. Maximal degree in co-relation 23990. Up to 3165 conditions per place. [2024-06-28 01:44:11,757 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 348 selfloop transitions, 20 changer transitions 0/376 dead transitions. [2024-06-28 01:44:11,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 376 transitions, 6092 flow [2024-06-28 01:44:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-28 01:44:11,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843843843843844 [2024-06-28 01:44:11,758 INFO L175 Difference]: Start difference. First operand has 251 places, 349 transitions, 5230 flow. Second operand 9 states and 146 transitions. [2024-06-28 01:44:11,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 376 transitions, 6092 flow [2024-06-28 01:44:12,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 376 transitions, 5980 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-28 01:44:12,043 INFO L231 Difference]: Finished difference. Result has 256 places, 349 transitions, 5162 flow [2024-06-28 01:44:12,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5118, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5162, PETRI_PLACES=256, PETRI_TRANSITIONS=349} [2024-06-28 01:44:12,043 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 215 predicate places. [2024-06-28 01:44:12,043 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 349 transitions, 5162 flow [2024-06-28 01:44:12,044 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:44:12,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:12,044 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:44:12,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:44:12,044 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:44:12,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -341714000, now seen corresponding path program 8 times [2024-06-28 01:44:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490438948] [2024-06-28 01:44:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:12,592 INFO 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:44:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490438948] [2024-06-28 01:44:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490438948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611161158] [2024-06-28 01:44:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:12,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:12,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:12,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 349 transitions, 5162 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:44:12,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:12,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:12,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:13,498 INFO L124 PetriNetUnfolderBase]: 2029/3593 cut-off events. [2024-06-28 01:44:13,498 INFO L125 PetriNetUnfolderBase]: For 62978/63030 co-relation queries the response was YES. [2024-06-28 01:44:13,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24238 conditions, 3593 events. 2029/3593 cut-off events. For 62978/63030 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23756 event pairs, 558 based on Foata normal form. 53/3543 useless extension candidates. Maximal degree in co-relation 24118. Up to 3172 conditions per place. [2024-06-28 01:44:13,531 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 343 selfloop transitions, 31 changer transitions 0/382 dead transitions. [2024-06-28 01:44:13,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 382 transitions, 6116 flow [2024-06-28 01:44:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:44:13,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2024-06-28 01:44:13,532 INFO L175 Difference]: Start difference. First operand has 256 places, 349 transitions, 5162 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:44:13,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 382 transitions, 6116 flow [2024-06-28 01:44:13,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 382 transitions, 6057 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:13,846 INFO L231 Difference]: Finished difference. Result has 258 places, 353 transitions, 5263 flow [2024-06-28 01:44:13,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5103, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5263, PETRI_PLACES=258, PETRI_TRANSITIONS=353} [2024-06-28 01:44:13,847 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places. [2024-06-28 01:44:13,847 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 353 transitions, 5263 flow [2024-06-28 01:44:13,847 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:44:13,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:13,847 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:44:13,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:44:13,847 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:44:13,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash -331615843, now seen corresponding path program 1 times [2024-06-28 01:44:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706055294] [2024-06-28 01:44:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:14,397 INFO 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:44:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:14,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706055294] [2024-06-28 01:44:14,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706055294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:14,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:14,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:14,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274944657] [2024-06-28 01:44:14,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:14,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:14,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:14,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:14,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:14,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:14,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 353 transitions, 5263 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:44:14,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:14,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:14,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:15,347 INFO L124 PetriNetUnfolderBase]: 2031/3545 cut-off events. [2024-06-28 01:44:15,347 INFO L125 PetriNetUnfolderBase]: For 63174/63226 co-relation queries the response was YES. [2024-06-28 01:44:15,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24150 conditions, 3545 events. 2031/3545 cut-off events. For 63174/63226 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23102 event pairs, 555 based on Foata normal form. 54/3508 useless extension candidates. Maximal degree in co-relation 24029. Up to 3172 conditions per place. [2024-06-28 01:44:15,383 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 353 selfloop transitions, 21 changer transitions 0/382 dead transitions. [2024-06-28 01:44:15,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 382 transitions, 6125 flow [2024-06-28 01:44:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 01:44:15,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-06-28 01:44:15,385 INFO L175 Difference]: Start difference. First operand has 258 places, 353 transitions, 5263 flow. Second operand 9 states and 151 transitions. [2024-06-28 01:44:15,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 382 transitions, 6125 flow [2024-06-28 01:44:15,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 382 transitions, 5981 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:15,751 INFO L231 Difference]: Finished difference. Result has 260 places, 355 transitions, 5188 flow [2024-06-28 01:44:15,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5119, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5188, PETRI_PLACES=260, PETRI_TRANSITIONS=355} [2024-06-28 01:44:15,751 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 219 predicate places. [2024-06-28 01:44:15,751 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 355 transitions, 5188 flow [2024-06-28 01:44:15,752 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:44:15,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:15,752 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:44:15,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:44:15,752 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:44:15,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash -626127530, now seen corresponding path program 9 times [2024-06-28 01:44:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181689387] [2024-06-28 01:44:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:16,347 INFO 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:44:16,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181689387] [2024-06-28 01:44:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181689387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748745785] [2024-06-28 01:44:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:16,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:16,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:16,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 355 transitions, 5188 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:44:16,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:16,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:16,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:17,413 INFO L124 PetriNetUnfolderBase]: 2090/3748 cut-off events. [2024-06-28 01:44:17,413 INFO L125 PetriNetUnfolderBase]: For 70430/70479 co-relation queries the response was YES. [2024-06-28 01:44:17,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25091 conditions, 3748 events. 2090/3748 cut-off events. For 70430/70479 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25246 event pairs, 541 based on Foata normal form. 52/3685 useless extension candidates. Maximal degree in co-relation 24969. Up to 2843 conditions per place. [2024-06-28 01:44:17,444 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 342 selfloop transitions, 60 changer transitions 0/410 dead transitions. [2024-06-28 01:44:17,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 410 transitions, 6456 flow [2024-06-28 01:44:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 01:44:17,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-06-28 01:44:17,445 INFO L175 Difference]: Start difference. First operand has 260 places, 355 transitions, 5188 flow. Second operand 10 states and 181 transitions. [2024-06-28 01:44:17,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 410 transitions, 6456 flow [2024-06-28 01:44:17,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 410 transitions, 6403 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:17,797 INFO L231 Difference]: Finished difference. Result has 263 places, 360 transitions, 5367 flow [2024-06-28 01:44:17,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5135, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5367, PETRI_PLACES=263, PETRI_TRANSITIONS=360} [2024-06-28 01:44:17,797 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places. [2024-06-28 01:44:17,797 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 360 transitions, 5367 flow [2024-06-28 01:44:17,797 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:44:17,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:17,798 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:44:17,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:44:17,798 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:44:17,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:17,798 INFO L85 PathProgramCache]: Analyzing trace with hash 788962518, now seen corresponding path program 10 times [2024-06-28 01:44:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:17,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078257596] [2024-06-28 01:44:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:18,476 INFO 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:44:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078257596] [2024-06-28 01:44:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078257596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:18,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:18,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355627736] [2024-06-28 01:44:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:18,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:18,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:18,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:18,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:18,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 360 transitions, 5367 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:44:18,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:18,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:18,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:19,641 INFO L124 PetriNetUnfolderBase]: 2158/3857 cut-off events. [2024-06-28 01:44:19,641 INFO L125 PetriNetUnfolderBase]: For 72977/73019 co-relation queries the response was YES. [2024-06-28 01:44:19,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26062 conditions, 3857 events. 2158/3857 cut-off events. For 72977/73019 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26047 event pairs, 369 based on Foata normal form. 45/3797 useless extension candidates. Maximal degree in co-relation 25939. Up to 2378 conditions per place. [2024-06-28 01:44:19,678 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 330 selfloop transitions, 134 changer transitions 0/472 dead transitions. [2024-06-28 01:44:19,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 472 transitions, 7550 flow [2024-06-28 01:44:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:44:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:44:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-28 01:44:19,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-28 01:44:19,679 INFO L175 Difference]: Start difference. First operand has 263 places, 360 transitions, 5367 flow. Second operand 11 states and 212 transitions. [2024-06-28 01:44:19,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 472 transitions, 7550 flow [2024-06-28 01:44:20,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 472 transitions, 7435 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 01:44:20,128 INFO L231 Difference]: Finished difference. Result has 269 places, 372 transitions, 5754 flow [2024-06-28 01:44:20,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5272, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5754, PETRI_PLACES=269, PETRI_TRANSITIONS=372} [2024-06-28 01:44:20,129 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places. [2024-06-28 01:44:20,129 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 372 transitions, 5754 flow [2024-06-28 01:44:20,129 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:44:20,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:20,129 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:44:20,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:44:20,129 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:44:20,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -346734703, now seen corresponding path program 1 times [2024-06-28 01:44:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708416642] [2024-06-28 01:44:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:20,798 INFO 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:44:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708416642] [2024-06-28 01:44:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708416642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004833733] [2024-06-28 01:44:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:20,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:20,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:20,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:20,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:20,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 372 transitions, 5754 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:44:20,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:20,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:20,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:21,828 INFO L124 PetriNetUnfolderBase]: 2297/4067 cut-off events. [2024-06-28 01:44:21,828 INFO L125 PetriNetUnfolderBase]: For 99628/99687 co-relation queries the response was YES. [2024-06-28 01:44:21,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28600 conditions, 4067 events. 2297/4067 cut-off events. For 99628/99687 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27223 event pairs, 453 based on Foata normal form. 61/4020 useless extension candidates. Maximal degree in co-relation 28474. Up to 1271 conditions per place. [2024-06-28 01:44:21,869 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 250 selfloop transitions, 176 changer transitions 0/434 dead transitions. [2024-06-28 01:44:21,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 434 transitions, 7240 flow [2024-06-28 01:44:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-28 01:44:21,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-28 01:44:21,870 INFO L175 Difference]: Start difference. First operand has 269 places, 372 transitions, 5754 flow. Second operand 10 states and 195 transitions. [2024-06-28 01:44:21,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 434 transitions, 7240 flow [2024-06-28 01:44:22,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 434 transitions, 6997 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:22,411 INFO L231 Difference]: Finished difference. Result has 272 places, 374 transitions, 5909 flow [2024-06-28 01:44:22,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5511, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5909, PETRI_PLACES=272, PETRI_TRANSITIONS=374} [2024-06-28 01:44:22,412 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places. [2024-06-28 01:44:22,412 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 374 transitions, 5909 flow [2024-06-28 01:44:22,412 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:44:22,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:22,412 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:44:22,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:44:22,413 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:44:22,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1373918001, now seen corresponding path program 2 times [2024-06-28 01:44:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495577632] [2024-06-28 01:44:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495577632] [2024-06-28 01:44:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495577632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:23,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750049110] [2024-06-28 01:44:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:23,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:23,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:23,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 374 transitions, 5909 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:44:23,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:23,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:23,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:24,241 INFO L124 PetriNetUnfolderBase]: 2451/4361 cut-off events. [2024-06-28 01:44:24,241 INFO L125 PetriNetUnfolderBase]: For 132591/132663 co-relation queries the response was YES. [2024-06-28 01:44:24,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31153 conditions, 4361 events. 2451/4361 cut-off events. For 132591/132663 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29690 event pairs, 449 based on Foata normal form. 74/4321 useless extension candidates. Maximal degree in co-relation 31026. Up to 1542 conditions per place. [2024-06-28 01:44:24,286 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 251 selfloop transitions, 189 changer transitions 0/448 dead transitions. [2024-06-28 01:44:24,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 448 transitions, 7508 flow [2024-06-28 01:44:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:44:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:44:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-28 01:44:24,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-06-28 01:44:24,288 INFO L175 Difference]: Start difference. First operand has 272 places, 374 transitions, 5909 flow. Second operand 11 states and 220 transitions. [2024-06-28 01:44:24,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 448 transitions, 7508 flow [2024-06-28 01:44:24,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 448 transitions, 7229 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:44:24,882 INFO L231 Difference]: Finished difference. Result has 278 places, 377 transitions, 6093 flow [2024-06-28 01:44:24,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5634, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6093, PETRI_PLACES=278, PETRI_TRANSITIONS=377} [2024-06-28 01:44:24,883 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 237 predicate places. [2024-06-28 01:44:24,883 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 377 transitions, 6093 flow [2024-06-28 01:44:24,883 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:44:24,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:24,883 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:44:24,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:44:24,883 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:44:24,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1374038157, now seen corresponding path program 1 times [2024-06-28 01:44:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:24,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448371247] [2024-06-28 01:44:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:25,532 INFO 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:44:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448371247] [2024-06-28 01:44:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448371247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964682529] [2024-06-28 01:44:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:25,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:25,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:25,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:25,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 377 transitions, 6093 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:44:25,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:25,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:25,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:26,602 INFO L124 PetriNetUnfolderBase]: 2497/4386 cut-off events. [2024-06-28 01:44:26,602 INFO L125 PetriNetUnfolderBase]: For 138017/138079 co-relation queries the response was YES. [2024-06-28 01:44:26,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32350 conditions, 4386 events. 2497/4386 cut-off events. For 138017/138079 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29812 event pairs, 513 based on Foata normal form. 64/4347 useless extension candidates. Maximal degree in co-relation 32220. Up to 1667 conditions per place. [2024-06-28 01:44:26,649 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 225 selfloop transitions, 205 changer transitions 0/438 dead transitions. [2024-06-28 01:44:26,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 438 transitions, 7543 flow [2024-06-28 01:44:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:44:26,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:44:26,650 INFO L175 Difference]: Start difference. First operand has 278 places, 377 transitions, 6093 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:44:26,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 438 transitions, 7543 flow [2024-06-28 01:44:27,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 438 transitions, 7235 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:27,238 INFO L231 Difference]: Finished difference. Result has 284 places, 391 transitions, 6580 flow [2024-06-28 01:44:27,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5788, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6580, PETRI_PLACES=284, PETRI_TRANSITIONS=391} [2024-06-28 01:44:27,239 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 243 predicate places. [2024-06-28 01:44:27,239 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 391 transitions, 6580 flow [2024-06-28 01:44:27,239 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:44:27,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:27,239 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:44:27,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:44:27,239 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:44:27,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:27,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1374037971, now seen corresponding path program 3 times [2024-06-28 01:44:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824239245] [2024-06-28 01:44:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824239245] [2024-06-28 01:44:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824239245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:27,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021556346] [2024-06-28 01:44:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:27,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:27,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:27,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:27,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:27,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 391 transitions, 6580 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:44:27,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:27,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:27,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:28,964 INFO L124 PetriNetUnfolderBase]: 2517/4528 cut-off events. [2024-06-28 01:44:28,964 INFO L125 PetriNetUnfolderBase]: For 142162/142224 co-relation queries the response was YES. [2024-06-28 01:44:28,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34032 conditions, 4528 events. 2517/4528 cut-off events. For 142162/142224 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 31566 event pairs, 517 based on Foata normal form. 64/4488 useless extension candidates. Maximal degree in co-relation 33897. Up to 2992 conditions per place. [2024-06-28 01:44:29,013 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 257 selfloop transitions, 176 changer transitions 0/441 dead transitions. [2024-06-28 01:44:29,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 441 transitions, 7807 flow [2024-06-28 01:44:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 01:44:29,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-06-28 01:44:29,015 INFO L175 Difference]: Start difference. First operand has 284 places, 391 transitions, 6580 flow. Second operand 10 states and 181 transitions. [2024-06-28 01:44:29,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 441 transitions, 7807 flow [2024-06-28 01:44:29,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 441 transitions, 7689 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-06-28 01:44:29,822 INFO L231 Difference]: Finished difference. Result has 292 places, 400 transitions, 7125 flow [2024-06-28 01:44:29,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6462, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7125, PETRI_PLACES=292, PETRI_TRANSITIONS=400} [2024-06-28 01:44:29,824 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places. [2024-06-28 01:44:29,824 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 400 transitions, 7125 flow [2024-06-28 01:44:29,828 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:44:29,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:29,828 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:44:29,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 01:44:29,828 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:44:29,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1374033321, now seen corresponding path program 4 times [2024-06-28 01:44:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:29,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509974544] [2024-06-28 01:44:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:30,479 INFO 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:44:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:30,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509974544] [2024-06-28 01:44:30,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509974544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:30,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093008616] [2024-06-28 01:44:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:30,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:30,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:30,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 400 transitions, 7125 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:44:30,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:30,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:30,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:31,621 INFO L124 PetriNetUnfolderBase]: 2551/4594 cut-off events. [2024-06-28 01:44:31,621 INFO L125 PetriNetUnfolderBase]: For 149803/149869 co-relation queries the response was YES. [2024-06-28 01:44:31,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35295 conditions, 4594 events. 2551/4594 cut-off events. For 149803/149869 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 32204 event pairs, 505 based on Foata normal form. 68/4556 useless extension candidates. Maximal degree in co-relation 35157. Up to 3002 conditions per place. [2024-06-28 01:44:31,673 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 261 selfloop transitions, 178 changer transitions 0/447 dead transitions. [2024-06-28 01:44:31,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 447 transitions, 8288 flow [2024-06-28 01:44:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-28 01:44:31,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-28 01:44:31,675 INFO L175 Difference]: Start difference. First operand has 292 places, 400 transitions, 7125 flow. Second operand 10 states and 184 transitions. [2024-06-28 01:44:31,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 447 transitions, 8288 flow [2024-06-28 01:44:32,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 447 transitions, 8118 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:32,618 INFO L231 Difference]: Finished difference. Result has 296 places, 404 transitions, 7410 flow [2024-06-28 01:44:32,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6957, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7410, PETRI_PLACES=296, PETRI_TRANSITIONS=404} [2024-06-28 01:44:32,618 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 255 predicate places. [2024-06-28 01:44:32,618 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 404 transitions, 7410 flow [2024-06-28 01:44:32,618 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:44:32,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:32,619 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:44:32,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 01:44:32,619 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:44:32,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash -228841399, now seen corresponding path program 2 times [2024-06-28 01:44:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:32,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477153833] [2024-06-28 01:44:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:33,365 INFO 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:44:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:33,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477153833] [2024-06-28 01:44:33,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477153833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:33,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:33,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:33,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874177954] [2024-06-28 01:44:33,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:33,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:33,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:33,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:33,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:33,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:33,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 404 transitions, 7410 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:44:33,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:33,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:33,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:34,563 INFO L124 PetriNetUnfolderBase]: 2612/4681 cut-off events. [2024-06-28 01:44:34,563 INFO L125 PetriNetUnfolderBase]: For 155537/155591 co-relation queries the response was YES. [2024-06-28 01:44:34,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36825 conditions, 4681 events. 2612/4681 cut-off events. For 155537/155591 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 32765 event pairs, 486 based on Foata normal form. 56/4614 useless extension candidates. Maximal degree in co-relation 36685. Up to 2672 conditions per place. [2024-06-28 01:44:34,619 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 284 selfloop transitions, 178 changer transitions 0/470 dead transitions. [2024-06-28 01:44:34,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 470 transitions, 8892 flow [2024-06-28 01:44:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:44:34,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-06-28 01:44:34,620 INFO L175 Difference]: Start difference. First operand has 296 places, 404 transitions, 7410 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:44:34,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 470 transitions, 8892 flow [2024-06-28 01:44:35,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 470 transitions, 8490 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:35,709 INFO L231 Difference]: Finished difference. Result has 302 places, 419 transitions, 7739 flow [2024-06-28 01:44:35,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7024, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7739, PETRI_PLACES=302, PETRI_TRANSITIONS=419} [2024-06-28 01:44:35,709 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 261 predicate places. [2024-06-28 01:44:35,709 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 419 transitions, 7739 flow [2024-06-28 01:44:35,710 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:44:35,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:35,710 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:44:35,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 01:44:35,710 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:44:35,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -371132299, now seen corresponding path program 5 times [2024-06-28 01:44:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79974038] [2024-06-28 01:44:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:36,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:44:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79974038] [2024-06-28 01:44:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79974038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963044306] [2024-06-28 01:44:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:36,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:36,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:36,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 419 transitions, 7739 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:44:36,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:36,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:36,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:37,874 INFO L124 PetriNetUnfolderBase]: 2609/4758 cut-off events. [2024-06-28 01:44:37,874 INFO L125 PetriNetUnfolderBase]: For 163207/163261 co-relation queries the response was YES. [2024-06-28 01:44:37,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36606 conditions, 4758 events. 2609/4758 cut-off events. For 163207/163261 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 33869 event pairs, 537 based on Foata normal form. 70/4682 useless extension candidates. Maximal degree in co-relation 36462. Up to 2625 conditions per place. [2024-06-28 01:44:37,935 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 330 selfloop transitions, 143 changer transitions 0/481 dead transitions. [2024-06-28 01:44:37,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 481 transitions, 9112 flow [2024-06-28 01:44:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:44:37,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:44:37,937 INFO L175 Difference]: Start difference. First operand has 302 places, 419 transitions, 7739 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:44:37,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 481 transitions, 9112 flow [2024-06-28 01:44:38,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 481 transitions, 8825 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-28 01:44:38,760 INFO L231 Difference]: Finished difference. Result has 308 places, 420 transitions, 7778 flow [2024-06-28 01:44:38,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7452, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7778, PETRI_PLACES=308, PETRI_TRANSITIONS=420} [2024-06-28 01:44:38,761 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2024-06-28 01:44:38,761 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 420 transitions, 7778 flow [2024-06-28 01:44:38,761 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:44:38,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:38,761 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:44:38,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 01:44:38,761 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:44:38,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -371309929, now seen corresponding path program 6 times [2024-06-28 01:44:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128329836] [2024-06-28 01:44:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:39,481 INFO 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:44:39,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:39,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128329836] [2024-06-28 01:44:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128329836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:39,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410782894] [2024-06-28 01:44:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:39,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:39,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:39,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 420 transitions, 7778 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:44:39,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:39,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:39,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:40,934 INFO L124 PetriNetUnfolderBase]: 2655/4864 cut-off events. [2024-06-28 01:44:40,935 INFO L125 PetriNetUnfolderBase]: For 142628/142684 co-relation queries the response was YES. [2024-06-28 01:44:40,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38012 conditions, 4864 events. 2655/4864 cut-off events. For 142628/142684 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34938 event pairs, 549 based on Foata normal form. 58/4771 useless extension candidates. Maximal degree in co-relation 37866. Up to 2604 conditions per place. [2024-06-28 01:44:40,983 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 332 selfloop transitions, 146 changer transitions 0/486 dead transitions. [2024-06-28 01:44:40,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 486 transitions, 9350 flow [2024-06-28 01:44:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 01:44:40,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-28 01:44:40,984 INFO L175 Difference]: Start difference. First operand has 308 places, 420 transitions, 7778 flow. Second operand 10 states and 193 transitions. [2024-06-28 01:44:40,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 486 transitions, 9350 flow [2024-06-28 01:44:41,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 486 transitions, 9084 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:44:41,866 INFO L231 Difference]: Finished difference. Result has 313 places, 424 transitions, 7924 flow [2024-06-28 01:44:41,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7512, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7924, PETRI_PLACES=313, PETRI_TRANSITIONS=424} [2024-06-28 01:44:41,866 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2024-06-28 01:44:41,866 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 424 transitions, 7924 flow [2024-06-28 01:44:41,867 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:44:41,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:41,867 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:44:41,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 01:44:41,867 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:44:41,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -229014565, now seen corresponding path program 7 times [2024-06-28 01:44:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:41,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880886940] [2024-06-28 01:44:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:42,681 INFO 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:44:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880886940] [2024-06-28 01:44:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880886940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733750476] [2024-06-28 01:44:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:42,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:42,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:42,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:42,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 424 transitions, 7924 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:44:42,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:42,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:42,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:44,171 INFO L124 PetriNetUnfolderBase]: 2652/4843 cut-off events. [2024-06-28 01:44:44,171 INFO L125 PetriNetUnfolderBase]: For 141932/141986 co-relation queries the response was YES. [2024-06-28 01:44:44,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38046 conditions, 4843 events. 2652/4843 cut-off events. For 141932/141986 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34716 event pairs, 542 based on Foata normal form. 56/4750 useless extension candidates. Maximal degree in co-relation 37898. Up to 2646 conditions per place. [2024-06-28 01:44:44,218 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 333 selfloop transitions, 148 changer transitions 0/489 dead transitions. [2024-06-28 01:44:44,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 489 transitions, 9308 flow [2024-06-28 01:44:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:44:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:44:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-28 01:44:44,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012285012285013 [2024-06-28 01:44:44,220 INFO L175 Difference]: Start difference. First operand has 313 places, 424 transitions, 7924 flow. Second operand 11 states and 204 transitions. [2024-06-28 01:44:44,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 489 transitions, 9308 flow [2024-06-28 01:44:45,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 489 transitions, 9129 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 01:44:45,260 INFO L231 Difference]: Finished difference. Result has 319 places, 424 transitions, 8054 flow [2024-06-28 01:44:45,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7745, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8054, PETRI_PLACES=319, PETRI_TRANSITIONS=424} [2024-06-28 01:44:45,261 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2024-06-28 01:44:45,261 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 424 transitions, 8054 flow [2024-06-28 01:44:45,261 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:44:45,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:45,261 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:44:45,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 01:44:45,261 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:44:45,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash -371305093, now seen corresponding path program 3 times [2024-06-28 01:44:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:45,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126935498] [2024-06-28 01:44:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:46,146 INFO 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:44:46,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:46,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126935498] [2024-06-28 01:44:46,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126935498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:46,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:46,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:46,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047945428] [2024-06-28 01:44:46,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:46,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:46,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:46,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:46,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 424 transitions, 8054 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:44:46,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:46,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:46,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:47,575 INFO L124 PetriNetUnfolderBase]: 2680/4934 cut-off events. [2024-06-28 01:44:47,575 INFO L125 PetriNetUnfolderBase]: For 145085/145139 co-relation queries the response was YES. [2024-06-28 01:44:47,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39085 conditions, 4934 events. 2680/4934 cut-off events. For 145085/145139 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 35649 event pairs, 562 based on Foata normal form. 56/4834 useless extension candidates. Maximal degree in co-relation 38935. Up to 2920 conditions per place. [2024-06-28 01:44:47,626 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 333 selfloop transitions, 152 changer transitions 0/493 dead transitions. [2024-06-28 01:44:47,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 493 transitions, 9480 flow [2024-06-28 01:44:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:44:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:44:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-06-28 01:44:47,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48423423423423423 [2024-06-28 01:44:47,627 INFO L175 Difference]: Start difference. First operand has 319 places, 424 transitions, 8054 flow. Second operand 12 states and 215 transitions. [2024-06-28 01:44:47,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 493 transitions, 9480 flow [2024-06-28 01:44:48,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 493 transitions, 9177 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-28 01:44:48,538 INFO L231 Difference]: Finished difference. Result has 322 places, 431 transitions, 8184 flow [2024-06-28 01:44:48,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7751, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8184, PETRI_PLACES=322, PETRI_TRANSITIONS=431} [2024-06-28 01:44:48,539 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 281 predicate places. [2024-06-28 01:44:48,539 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 431 transitions, 8184 flow [2024-06-28 01:44:48,539 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:44:48,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:48,539 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:44:48,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 01:44:48,539 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:44:48,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -375778579, now seen corresponding path program 8 times [2024-06-28 01:44:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457839618] [2024-06-28 01:44:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:49,200 INFO 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:44:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457839618] [2024-06-28 01:44:49,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457839618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:49,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:49,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551960197] [2024-06-28 01:44:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:49,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:49,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:49,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:49,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 431 transitions, 8184 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:44:49,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:49,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:49,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:50,740 INFO L124 PetriNetUnfolderBase]: 2696/4928 cut-off events. [2024-06-28 01:44:50,740 INFO L125 PetriNetUnfolderBase]: For 149497/149556 co-relation queries the response was YES. [2024-06-28 01:44:50,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39527 conditions, 4928 events. 2696/4928 cut-off events. For 149497/149556 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 35430 event pairs, 540 based on Foata normal form. 61/4837 useless extension candidates. Maximal degree in co-relation 39375. Up to 2569 conditions per place. [2024-06-28 01:44:50,800 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 333 selfloop transitions, 154 changer transitions 0/495 dead transitions. [2024-06-28 01:44:50,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 495 transitions, 9709 flow [2024-06-28 01:44:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:44:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:44:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-28 01:44:50,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110565110565111 [2024-06-28 01:44:50,801 INFO L175 Difference]: Start difference. First operand has 322 places, 431 transitions, 8184 flow. Second operand 11 states and 208 transitions. [2024-06-28 01:44:50,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 495 transitions, 9709 flow [2024-06-28 01:44:51,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 495 transitions, 9373 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-28 01:44:51,635 INFO L231 Difference]: Finished difference. Result has 324 places, 432 transitions, 8193 flow [2024-06-28 01:44:51,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7848, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8193, PETRI_PLACES=324, PETRI_TRANSITIONS=432} [2024-06-28 01:44:51,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 283 predicate places. [2024-06-28 01:44:51,636 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 432 transitions, 8193 flow [2024-06-28 01:44:51,636 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:44:51,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:51,636 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:44:51,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 01:44:51,636 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:44:51,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash -375773929, now seen corresponding path program 9 times [2024-06-28 01:44:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670278532] [2024-06-28 01:44:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:52,331 INFO 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:44:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670278532] [2024-06-28 01:44:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670278532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776366593] [2024-06-28 01:44:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:52,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:52,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:52,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 432 transitions, 8193 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:44:52,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:52,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:52,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:53,706 INFO L124 PetriNetUnfolderBase]: 2693/4909 cut-off events. [2024-06-28 01:44:53,706 INFO L125 PetriNetUnfolderBase]: For 146469/146524 co-relation queries the response was YES. [2024-06-28 01:44:53,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39220 conditions, 4909 events. 2693/4909 cut-off events. For 146469/146524 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 35209 event pairs, 542 based on Foata normal form. 57/4816 useless extension candidates. Maximal degree in co-relation 39067. Up to 2655 conditions per place. [2024-06-28 01:44:53,764 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 335 selfloop transitions, 155 changer transitions 0/498 dead transitions. [2024-06-28 01:44:53,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 498 transitions, 9582 flow [2024-06-28 01:44:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:44:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:44:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2024-06-28 01:44:53,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2024-06-28 01:44:53,765 INFO L175 Difference]: Start difference. First operand has 324 places, 432 transitions, 8193 flow. Second operand 12 states and 219 transitions. [2024-06-28 01:44:53,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 498 transitions, 9582 flow [2024-06-28 01:44:54,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 498 transitions, 9296 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 01:44:54,897 INFO L231 Difference]: Finished difference. Result has 329 places, 432 transitions, 8232 flow [2024-06-28 01:44:54,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7907, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8232, PETRI_PLACES=329, PETRI_TRANSITIONS=432} [2024-06-28 01:44:54,898 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 288 predicate places. [2024-06-28 01:44:54,898 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 432 transitions, 8232 flow [2024-06-28 01:44:54,898 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:44:54,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:54,898 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:44:54,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 01:44:54,898 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:44:54,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1779024431, now seen corresponding path program 4 times [2024-06-28 01:44:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:54,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972359214] [2024-06-28 01:44:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:55,681 INFO 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:44:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972359214] [2024-06-28 01:44:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972359214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:55,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:55,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47722003] [2024-06-28 01:44:55,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:55,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:55,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:55,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 432 transitions, 8232 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:44:55,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:55,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:55,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:57,220 INFO L124 PetriNetUnfolderBase]: 2715/4991 cut-off events. [2024-06-28 01:44:57,220 INFO L125 PetriNetUnfolderBase]: For 146893/146948 co-relation queries the response was YES. [2024-06-28 01:44:57,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39666 conditions, 4991 events. 2715/4991 cut-off events. For 146893/146948 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36077 event pairs, 560 based on Foata normal form. 57/4892 useless extension candidates. Maximal degree in co-relation 39513. Up to 2919 conditions per place. [2024-06-28 01:44:57,280 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 332 selfloop transitions, 160 changer transitions 0/500 dead transitions. [2024-06-28 01:44:57,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 500 transitions, 9649 flow [2024-06-28 01:44:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:44:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:44:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2024-06-28 01:44:57,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781704781704782 [2024-06-28 01:44:57,281 INFO L175 Difference]: Start difference. First operand has 329 places, 432 transitions, 8232 flow. Second operand 13 states and 230 transitions. [2024-06-28 01:44:57,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 500 transitions, 9649 flow [2024-06-28 01:44:58,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 500 transitions, 9339 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-28 01:44:58,063 INFO L231 Difference]: Finished difference. Result has 332 places, 434 transitions, 8303 flow [2024-06-28 01:44:58,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7922, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8303, PETRI_PLACES=332, PETRI_TRANSITIONS=434} [2024-06-28 01:44:58,063 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-28 01:44:58,063 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 434 transitions, 8303 flow [2024-06-28 01:44:58,064 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:44:58,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:58,064 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:44:58,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 01:44:58,064 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:44:58,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1250229225, now seen corresponding path program 10 times [2024-06-28 01:44:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520728139] [2024-06-28 01:44:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:58,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:58,756 INFO 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:44:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520728139] [2024-06-28 01:44:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520728139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852139726] [2024-06-28 01:44:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:58,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:58,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:58,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:44:58,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 434 transitions, 8303 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:44:58,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:58,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:44:58,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:00,147 INFO L124 PetriNetUnfolderBase]: 2793/5038 cut-off events. [2024-06-28 01:45:00,147 INFO L125 PetriNetUnfolderBase]: For 161891/161962 co-relation queries the response was YES. [2024-06-28 01:45:00,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40850 conditions, 5038 events. 2793/5038 cut-off events. For 161891/161962 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 35902 event pairs, 438 based on Foata normal form. 73/4973 useless extension candidates. Maximal degree in co-relation 40697. Up to 1993 conditions per place. [2024-06-28 01:45:00,211 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 296 selfloop transitions, 198 changer transitions 0/502 dead transitions. [2024-06-28 01:45:00,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 502 transitions, 9993 flow [2024-06-28 01:45:00,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-28 01:45:00,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5486486486486486 [2024-06-28 01:45:00,213 INFO L175 Difference]: Start difference. First operand has 332 places, 434 transitions, 8303 flow. Second operand 10 states and 203 transitions. [2024-06-28 01:45:00,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 502 transitions, 9993 flow [2024-06-28 01:45:01,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 502 transitions, 9664 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-28 01:45:01,293 INFO L231 Difference]: Finished difference. Result has 332 places, 435 transitions, 8396 flow [2024-06-28 01:45:01,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7974, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8396, PETRI_PLACES=332, PETRI_TRANSITIONS=435} [2024-06-28 01:45:01,294 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-28 01:45:01,294 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 435 transitions, 8396 flow [2024-06-28 01:45:01,294 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:45:01,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:01,294 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:45:01,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 01:45:01,294 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:45:01,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1250113905, now seen corresponding path program 11 times [2024-06-28 01:45:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:01,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148304138] [2024-06-28 01:45:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:45:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:01,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148304138] [2024-06-28 01:45:01,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148304138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:01,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:01,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470387629] [2024-06-28 01:45:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:01,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:02,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:02,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 435 transitions, 8396 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:45:02,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:02,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:02,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:03,306 INFO L124 PetriNetUnfolderBase]: 2867/5296 cut-off events. [2024-06-28 01:45:03,306 INFO L125 PetriNetUnfolderBase]: For 172242/172318 co-relation queries the response was YES. [2024-06-28 01:45:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42383 conditions, 5296 events. 2867/5296 cut-off events. For 172242/172318 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 39002 event pairs, 496 based on Foata normal form. 78/5220 useless extension candidates. Maximal degree in co-relation 42229. Up to 3647 conditions per place. [2024-06-28 01:45:03,371 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 289 selfloop transitions, 201 changer transitions 0/498 dead transitions. [2024-06-28 01:45:03,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 498 transitions, 10036 flow [2024-06-28 01:45:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-28 01:45:03,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-06-28 01:45:03,372 INFO L175 Difference]: Start difference. First operand has 332 places, 435 transitions, 8396 flow. Second operand 10 states and 192 transitions. [2024-06-28 01:45:03,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 498 transitions, 10036 flow [2024-06-28 01:45:04,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 498 transitions, 9489 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-28 01:45:04,606 INFO L231 Difference]: Finished difference. Result has 334 places, 449 transitions, 8578 flow [2024-06-28 01:45:04,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7863, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8578, PETRI_PLACES=334, PETRI_TRANSITIONS=449} [2024-06-28 01:45:04,607 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 293 predicate places. [2024-06-28 01:45:04,607 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 449 transitions, 8578 flow [2024-06-28 01:45:04,607 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:45:04,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:04,607 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:45:04,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 01:45:04,607 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:45:04,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1250109255, now seen corresponding path program 12 times [2024-06-28 01:45:04,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:04,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996227189] [2024-06-28 01:45:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:04,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:05,344 INFO 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:45:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996227189] [2024-06-28 01:45:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996227189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:05,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:05,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:05,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519943464] [2024-06-28 01:45:05,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:05,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:05,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:05,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:05,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:05,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 449 transitions, 8578 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:45:05,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:05,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:05,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:06,928 INFO L124 PetriNetUnfolderBase]: 2964/5404 cut-off events. [2024-06-28 01:45:06,928 INFO L125 PetriNetUnfolderBase]: For 201977/202051 co-relation queries the response was YES. [2024-06-28 01:45:06,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41820 conditions, 5404 events. 2964/5404 cut-off events. For 201977/202051 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39467 event pairs, 528 based on Foata normal form. 90/5338 useless extension candidates. Maximal degree in co-relation 41665. Up to 2756 conditions per place. [2024-06-28 01:45:06,991 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 314 selfloop transitions, 206 changer transitions 0/528 dead transitions. [2024-06-28 01:45:06,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 528 transitions, 10260 flow [2024-06-28 01:45:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:45:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:45:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions. [2024-06-28 01:45:06,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-28 01:45:06,992 INFO L175 Difference]: Start difference. First operand has 334 places, 449 transitions, 8578 flow. Second operand 12 states and 234 transitions. [2024-06-28 01:45:06,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 528 transitions, 10260 flow [2024-06-28 01:45:08,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 528 transitions, 10130 flow, removed 58 selfloop flow, removed 2 redundant places. [2024-06-28 01:45:08,064 INFO L231 Difference]: Finished difference. Result has 344 places, 450 transitions, 8898 flow [2024-06-28 01:45:08,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8450, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8898, PETRI_PLACES=344, PETRI_TRANSITIONS=450} [2024-06-28 01:45:08,065 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places. [2024-06-28 01:45:08,065 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 450 transitions, 8898 flow [2024-06-28 01:45:08,065 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:45:08,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:08,065 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:45:08,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 01:45:08,066 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:45:08,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1250109069, now seen corresponding path program 5 times [2024-06-28 01:45:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80220155] [2024-06-28 01:45:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:08,748 INFO 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:45:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80220155] [2024-06-28 01:45:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80220155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:08,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:08,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396461250] [2024-06-28 01:45:08,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:08,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:08,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:08,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:08,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:08,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 450 transitions, 8898 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:45:08,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:08,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:08,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:10,266 INFO L124 PetriNetUnfolderBase]: 2992/5343 cut-off events. [2024-06-28 01:45:10,266 INFO L125 PetriNetUnfolderBase]: For 175761/175837 co-relation queries the response was YES. [2024-06-28 01:45:10,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43164 conditions, 5343 events. 2992/5343 cut-off events. For 175761/175837 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 38520 event pairs, 439 based on Foata normal form. 78/5296 useless extension candidates. Maximal degree in co-relation 43007. Up to 2682 conditions per place. [2024-06-28 01:45:10,325 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 258 selfloop transitions, 241 changer transitions 0/507 dead transitions. [2024-06-28 01:45:10,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 507 transitions, 10399 flow [2024-06-28 01:45:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-28 01:45:10,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351351351351351 [2024-06-28 01:45:10,326 INFO L175 Difference]: Start difference. First operand has 344 places, 450 transitions, 8898 flow. Second operand 10 states and 198 transitions. [2024-06-28 01:45:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 507 transitions, 10399 flow [2024-06-28 01:45:11,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 507 transitions, 10086 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:45:11,711 INFO L231 Difference]: Finished difference. Result has 346 places, 456 transitions, 9301 flow [2024-06-28 01:45:11,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8585, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9301, PETRI_PLACES=346, PETRI_TRANSITIONS=456} [2024-06-28 01:45:11,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 305 predicate places. [2024-06-28 01:45:11,712 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 456 transitions, 9301 flow [2024-06-28 01:45:11,712 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:45:11,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:11,712 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:45:11,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 01:45:11,713 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:45:11,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1245645255, now seen corresponding path program 13 times [2024-06-28 01:45:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058277138] [2024-06-28 01:45:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:45:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058277138] [2024-06-28 01:45:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058277138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661912303] [2024-06-28 01:45:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:12,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:12,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:12,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:12,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 456 transitions, 9301 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:45:12,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:12,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:12,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:14,049 INFO L124 PetriNetUnfolderBase]: 3008/5565 cut-off events. [2024-06-28 01:45:14,049 INFO L125 PetriNetUnfolderBase]: For 185353/185408 co-relation queries the response was YES. [2024-06-28 01:45:14,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44563 conditions, 5565 events. 3008/5565 cut-off events. For 185353/185408 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 41560 event pairs, 611 based on Foata normal form. 57/5443 useless extension candidates. Maximal degree in co-relation 44404. Up to 3293 conditions per place. [2024-06-28 01:45:14,113 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 359 selfloop transitions, 154 changer transitions 0/521 dead transitions. [2024-06-28 01:45:14,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 521 transitions, 10760 flow [2024-06-28 01:45:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-28 01:45:14,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351351351351351 [2024-06-28 01:45:14,114 INFO L175 Difference]: Start difference. First operand has 346 places, 456 transitions, 9301 flow. Second operand 10 states and 198 transitions. [2024-06-28 01:45:14,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 521 transitions, 10760 flow [2024-06-28 01:45:15,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 521 transitions, 10668 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-28 01:45:15,444 INFO L231 Difference]: Finished difference. Result has 352 places, 457 transitions, 9547 flow [2024-06-28 01:45:15,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9209, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9547, PETRI_PLACES=352, PETRI_TRANSITIONS=457} [2024-06-28 01:45:15,445 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 311 predicate places. [2024-06-28 01:45:15,445 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 457 transitions, 9547 flow [2024-06-28 01:45:15,445 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:45:15,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:15,445 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:45:15,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 01:45:15,446 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:45:15,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash -937115925, now seen corresponding path program 6 times [2024-06-28 01:45:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044560766] [2024-06-28 01:45:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:45:16,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:16,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044560766] [2024-06-28 01:45:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044560766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:16,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:16,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624138438] [2024-06-28 01:45:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:16,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:16,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:16,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:16,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 457 transitions, 9547 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:45:16,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:16,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:16,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:17,918 INFO L124 PetriNetUnfolderBase]: 3056/5661 cut-off events. [2024-06-28 01:45:17,918 INFO L125 PetriNetUnfolderBase]: For 199045/199094 co-relation queries the response was YES. [2024-06-28 01:45:17,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46108 conditions, 5661 events. 3056/5661 cut-off events. For 199045/199094 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 42489 event pairs, 646 based on Foata normal form. 51/5533 useless extension candidates. Maximal degree in co-relation 45947. Up to 3385 conditions per place. [2024-06-28 01:45:17,982 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 343 selfloop transitions, 181 changer transitions 0/532 dead transitions. [2024-06-28 01:45:17,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 532 transitions, 11405 flow [2024-06-28 01:45:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:45:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:45:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 226 transitions. [2024-06-28 01:45:17,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509009009009009 [2024-06-28 01:45:17,984 INFO L175 Difference]: Start difference. First operand has 352 places, 457 transitions, 9547 flow. Second operand 12 states and 226 transitions. [2024-06-28 01:45:17,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 532 transitions, 11405 flow [2024-06-28 01:45:19,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 532 transitions, 11108 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:45:19,208 INFO L231 Difference]: Finished difference. Result has 359 places, 462 transitions, 9754 flow [2024-06-28 01:45:19,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9250, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9754, PETRI_PLACES=359, PETRI_TRANSITIONS=462} [2024-06-28 01:45:19,209 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 318 predicate places. [2024-06-28 01:45:19,209 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 462 transitions, 9754 flow [2024-06-28 01:45:19,209 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:45:19,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:19,209 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:45:19,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 01:45:19,209 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:45:19,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1103349705, now seen corresponding path program 7 times [2024-06-28 01:45:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326896077] [2024-06-28 01:45:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:45:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326896077] [2024-06-28 01:45:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326896077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:19,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266401347] [2024-06-28 01:45:19,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:19,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:20,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:20,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 462 transitions, 9754 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:45:20,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:20,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:20,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:21,645 INFO L124 PetriNetUnfolderBase]: 3078/5770 cut-off events. [2024-06-28 01:45:21,645 INFO L125 PetriNetUnfolderBase]: For 207027/207080 co-relation queries the response was YES. [2024-06-28 01:45:21,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46777 conditions, 5770 events. 3078/5770 cut-off events. For 207027/207080 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 43884 event pairs, 647 based on Foata normal form. 55/5615 useless extension candidates. Maximal degree in co-relation 46614. Up to 3639 conditions per place. [2024-06-28 01:45:21,714 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 363 selfloop transitions, 160 changer transitions 0/531 dead transitions. [2024-06-28 01:45:21,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 531 transitions, 11253 flow [2024-06-28 01:45:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:45:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:45:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions. [2024-06-28 01:45:21,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:45:21,715 INFO L175 Difference]: Start difference. First operand has 359 places, 462 transitions, 9754 flow. Second operand 12 states and 220 transitions. [2024-06-28 01:45:21,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 531 transitions, 11253 flow [2024-06-28 01:45:22,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 531 transitions, 10806 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-06-28 01:45:22,816 INFO L231 Difference]: Finished difference. Result has 363 places, 465 transitions, 9718 flow [2024-06-28 01:45:22,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9307, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9718, PETRI_PLACES=363, PETRI_TRANSITIONS=465} [2024-06-28 01:45:22,816 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 322 predicate places. [2024-06-28 01:45:22,816 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 465 transitions, 9718 flow [2024-06-28 01:45:22,817 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:45:22,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:22,817 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:45:22,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 01:45:22,817 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:45:22,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1079406825, now seen corresponding path program 14 times [2024-06-28 01:45:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973243427] [2024-06-28 01:45:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:23,518 INFO 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:45:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973243427] [2024-06-28 01:45:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973243427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542425616] [2024-06-28 01:45:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:23,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:23,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:23,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 465 transitions, 9718 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:45:23,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:23,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:23,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:25,296 INFO L124 PetriNetUnfolderBase]: 3174/5877 cut-off events. [2024-06-28 01:45:25,297 INFO L125 PetriNetUnfolderBase]: For 240483/240532 co-relation queries the response was YES. [2024-06-28 01:45:25,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47216 conditions, 5877 events. 3174/5877 cut-off events. For 240483/240532 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 44399 event pairs, 682 based on Foata normal form. 65/5761 useless extension candidates. Maximal degree in co-relation 47052. Up to 3423 conditions per place. [2024-06-28 01:45:25,362 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 347 selfloop transitions, 178 changer transitions 0/533 dead transitions. [2024-06-28 01:45:25,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 533 transitions, 11200 flow [2024-06-28 01:45:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:45:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:45:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2024-06-28 01:45:25,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257985257985258 [2024-06-28 01:45:25,363 INFO L175 Difference]: Start difference. First operand has 363 places, 465 transitions, 9718 flow. Second operand 11 states and 214 transitions. [2024-06-28 01:45:25,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 533 transitions, 11200 flow [2024-06-28 01:45:26,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 533 transitions, 10766 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-06-28 01:45:26,714 INFO L231 Difference]: Finished difference. Result has 366 places, 466 transitions, 9716 flow [2024-06-28 01:45:26,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9285, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9716, PETRI_PLACES=366, PETRI_TRANSITIONS=466} [2024-06-28 01:45:26,714 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 325 predicate places. [2024-06-28 01:45:26,714 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 466 transitions, 9716 flow [2024-06-28 01:45:26,714 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:45:26,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:26,715 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:45:26,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 01:45:26,715 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:45:26,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -937120761, now seen corresponding path program 15 times [2024-06-28 01:45:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203865080] [2024-06-28 01:45:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:27,380 INFO 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:45:27,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:27,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203865080] [2024-06-28 01:45:27,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203865080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:27,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:27,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:27,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952181787] [2024-06-28 01:45:27,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:27,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:27,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:27,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 466 transitions, 9716 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:45:27,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:27,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:27,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:29,039 INFO L124 PetriNetUnfolderBase]: 3218/6145 cut-off events. [2024-06-28 01:45:29,039 INFO L125 PetriNetUnfolderBase]: For 215822/215875 co-relation queries the response was YES. [2024-06-28 01:45:29,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48181 conditions, 6145 events. 3218/6145 cut-off events. For 215822/215875 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 47937 event pairs, 688 based on Foata normal form. 55/5976 useless extension candidates. Maximal degree in co-relation 48015. Up to 4392 conditions per place. [2024-06-28 01:45:29,109 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 340 selfloop transitions, 168 changer transitions 0/516 dead transitions. [2024-06-28 01:45:29,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 516 transitions, 11226 flow [2024-06-28 01:45:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 01:45:29,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-28 01:45:29,110 INFO L175 Difference]: Start difference. First operand has 366 places, 466 transitions, 9716 flow. Second operand 10 states and 183 transitions. [2024-06-28 01:45:29,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 516 transitions, 11226 flow [2024-06-28 01:45:30,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 516 transitions, 10873 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-28 01:45:30,405 INFO L231 Difference]: Finished difference. Result has 368 places, 471 transitions, 9866 flow [2024-06-28 01:45:30,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9365, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9866, PETRI_PLACES=368, PETRI_TRANSITIONS=471} [2024-06-28 01:45:30,406 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 327 predicate places. [2024-06-28 01:45:30,406 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 471 transitions, 9866 flow [2024-06-28 01:45:30,406 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:45:30,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:30,406 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:45:30,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 01:45:30,406 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:45:30,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1072977735, now seen corresponding path program 16 times [2024-06-28 01:45:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:30,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891044118] [2024-06-28 01:45:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:45:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891044118] [2024-06-28 01:45:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891044118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484775743] [2024-06-28 01:45:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:31,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:31,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:31,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 471 transitions, 9866 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:45:31,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:31,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:32,838 INFO L124 PetriNetUnfolderBase]: 3219/6138 cut-off events. [2024-06-28 01:45:32,838 INFO L125 PetriNetUnfolderBase]: For 207685/207736 co-relation queries the response was YES. [2024-06-28 01:45:32,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47903 conditions, 6138 events. 3219/6138 cut-off events. For 207685/207736 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 47919 event pairs, 709 based on Foata normal form. 53/5966 useless extension candidates. Maximal degree in co-relation 47735. Up to 4601 conditions per place. [2024-06-28 01:45:32,918 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 357 selfloop transitions, 151 changer transitions 0/516 dead transitions. [2024-06-28 01:45:32,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 516 transitions, 11124 flow [2024-06-28 01:45:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:45:32,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-28 01:45:32,919 INFO L175 Difference]: Start difference. First operand has 368 places, 471 transitions, 9866 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:45:32,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 516 transitions, 11124 flow [2024-06-28 01:45:34,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 516 transitions, 10834 flow, removed 61 selfloop flow, removed 5 redundant places. [2024-06-28 01:45:34,196 INFO L231 Difference]: Finished difference. Result has 373 places, 472 transitions, 9919 flow [2024-06-28 01:45:34,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9596, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9919, PETRI_PLACES=373, PETRI_TRANSITIONS=472} [2024-06-28 01:45:34,197 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 332 predicate places. [2024-06-28 01:45:34,197 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 472 transitions, 9919 flow [2024-06-28 01:45:34,198 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:45:34,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:34,198 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:45:34,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 01:45:34,198 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:45:34,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -930686835, now seen corresponding path program 8 times [2024-06-28 01:45:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278378122] [2024-06-28 01:45:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:34,982 INFO 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:45:34,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278378122] [2024-06-28 01:45:34,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278378122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:34,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:34,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:34,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062532444] [2024-06-28 01:45:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:34,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:34,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:35,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:35,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 472 transitions, 9919 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:45:35,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:35,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:35,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:36,753 INFO L124 PetriNetUnfolderBase]: 3287/6132 cut-off events. [2024-06-28 01:45:36,753 INFO L125 PetriNetUnfolderBase]: For 204103/204154 co-relation queries the response was YES. [2024-06-28 01:45:36,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48789 conditions, 6132 events. 3287/6132 cut-off events. For 204103/204154 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 47120 event pairs, 684 based on Foata normal form. 53/5974 useless extension candidates. Maximal degree in co-relation 48619. Up to 3905 conditions per place. [2024-06-28 01:45:36,817 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 361 selfloop transitions, 171 changer transitions 0/540 dead transitions. [2024-06-28 01:45:36,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 540 transitions, 11533 flow [2024-06-28 01:45:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:45:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:45:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2024-06-28 01:45:36,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987714987714988 [2024-06-28 01:45:36,818 INFO L175 Difference]: Start difference. First operand has 373 places, 472 transitions, 9919 flow. Second operand 11 states and 203 transitions. [2024-06-28 01:45:36,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 540 transitions, 11533 flow [2024-06-28 01:45:38,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 540 transitions, 11232 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-28 01:45:38,227 INFO L231 Difference]: Finished difference. Result has 379 places, 481 transitions, 10202 flow [2024-06-28 01:45:38,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9631, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10202, PETRI_PLACES=379, PETRI_TRANSITIONS=481} [2024-06-28 01:45:38,228 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 338 predicate places. [2024-06-28 01:45:38,228 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 481 transitions, 10202 flow [2024-06-28 01:45:38,228 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:45:38,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:38,228 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:45:38,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 01:45:38,229 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:45:38,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2065056997, now seen corresponding path program 17 times [2024-06-28 01:45:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:38,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769092925] [2024-06-28 01:45:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:38,883 INFO 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:45:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769092925] [2024-06-28 01:45:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769092925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:38,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:38,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487825781] [2024-06-28 01:45:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:38,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:38,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:38,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 481 transitions, 10202 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:45:38,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:38,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:38,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:40,478 INFO L124 PetriNetUnfolderBase]: 3307/5957 cut-off events. [2024-06-28 01:45:40,479 INFO L125 PetriNetUnfolderBase]: For 210969/211033 co-relation queries the response was YES. [2024-06-28 01:45:40,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49265 conditions, 5957 events. 3307/5957 cut-off events. For 210969/211033 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 44421 event pairs, 1004 based on Foata normal form. 66/5865 useless extension candidates. Maximal degree in co-relation 49093. Up to 5268 conditions per place. [2024-06-28 01:45:40,558 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 458 selfloop transitions, 55 changer transitions 0/521 dead transitions. [2024-06-28 01:45:40,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 521 transitions, 11467 flow [2024-06-28 01:45:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-28 01:45:40,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:45:40,559 INFO L175 Difference]: Start difference. First operand has 379 places, 481 transitions, 10202 flow. Second operand 10 states and 170 transitions. [2024-06-28 01:45:40,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 521 transitions, 11467 flow [2024-06-28 01:45:42,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 521 transitions, 11114 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-28 01:45:42,541 INFO L231 Difference]: Finished difference. Result has 381 places, 483 transitions, 10029 flow [2024-06-28 01:45:42,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9849, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10029, PETRI_PLACES=381, PETRI_TRANSITIONS=483} [2024-06-28 01:45:42,542 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 340 predicate places. [2024-06-28 01:45:42,542 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 483 transitions, 10029 flow [2024-06-28 01:45:42,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:45:42,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:42,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:45:42,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 01:45:42,542 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:45:42,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1246579663, now seen corresponding path program 1 times [2024-06-28 01:45:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:42,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714350716] [2024-06-28 01:45:42,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:42,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:43,417 INFO 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:45:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714350716] [2024-06-28 01:45:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714350716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:43,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:45:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611377326] [2024-06-28 01:45:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:43,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:45:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:45:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:45:43,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:43,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 483 transitions, 10029 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:45:43,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:43,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:43,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:45,046 INFO L124 PetriNetUnfolderBase]: 3334/5995 cut-off events. [2024-06-28 01:45:45,046 INFO L125 PetriNetUnfolderBase]: For 210240/210305 co-relation queries the response was YES. [2024-06-28 01:45:45,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48733 conditions, 5995 events. 3334/5995 cut-off events. For 210240/210305 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 44584 event pairs, 979 based on Foata normal form. 67/5915 useless extension candidates. Maximal degree in co-relation 48560. Up to 5221 conditions per place. [2024-06-28 01:45:45,135 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 480 selfloop transitions, 43 changer transitions 0/531 dead transitions. [2024-06-28 01:45:45,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 531 transitions, 11369 flow [2024-06-28 01:45:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-28 01:45:45,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-28 01:45:45,136 INFO L175 Difference]: Start difference. First operand has 381 places, 483 transitions, 10029 flow. Second operand 10 states and 172 transitions. [2024-06-28 01:45:45,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 531 transitions, 11369 flow [2024-06-28 01:45:46,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 531 transitions, 11215 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-28 01:45:46,769 INFO L231 Difference]: Finished difference. Result has 386 places, 490 transitions, 10095 flow [2024-06-28 01:45:46,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9879, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10095, PETRI_PLACES=386, PETRI_TRANSITIONS=490} [2024-06-28 01:45:46,770 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 345 predicate places. [2024-06-28 01:45:46,770 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 490 transitions, 10095 flow [2024-06-28 01:45:46,770 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:45:46,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:46,770 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:45:46,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 01:45:46,771 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:45:46,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 978665107, now seen corresponding path program 18 times [2024-06-28 01:45:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090801643] [2024-06-28 01:45:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:47,396 INFO 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:45:47,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090801643] [2024-06-28 01:45:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090801643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:47,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:47,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648808881] [2024-06-28 01:45:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:47,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:47,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:47,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 490 transitions, 10095 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:45:47,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:47,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:49,098 INFO L124 PetriNetUnfolderBase]: 3362/6042 cut-off events. [2024-06-28 01:45:49,098 INFO L125 PetriNetUnfolderBase]: For 216099/216165 co-relation queries the response was YES. [2024-06-28 01:45:49,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49768 conditions, 6042 events. 3362/6042 cut-off events. For 216099/216165 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 44982 event pairs, 994 based on Foata normal form. 68/5955 useless extension candidates. Maximal degree in co-relation 49591. Up to 5205 conditions per place. [2024-06-28 01:45:49,179 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 454 selfloop transitions, 73 changer transitions 0/535 dead transitions. [2024-06-28 01:45:49,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 535 transitions, 11661 flow [2024-06-28 01:45:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-28 01:45:49,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2024-06-28 01:45:49,180 INFO L175 Difference]: Start difference. First operand has 386 places, 490 transitions, 10095 flow. Second operand 10 states and 173 transitions. [2024-06-28 01:45:49,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 535 transitions, 11661 flow [2024-06-28 01:45:50,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 535 transitions, 11585 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 01:45:50,780 INFO L231 Difference]: Finished difference. Result has 393 places, 496 transitions, 10403 flow [2024-06-28 01:45:50,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10019, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10403, PETRI_PLACES=393, PETRI_TRANSITIONS=496} [2024-06-28 01:45:50,780 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 352 predicate places. [2024-06-28 01:45:50,781 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 496 transitions, 10403 flow [2024-06-28 01:45:50,781 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:45:50,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:50,781 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:45:50,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 01:45:50,781 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:45:50,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2065057183, now seen corresponding path program 9 times [2024-06-28 01:45:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416361004] [2024-06-28 01:45:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:45:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416361004] [2024-06-28 01:45:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416361004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:51,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:51,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295414248] [2024-06-28 01:45:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:51,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:51,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:51,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:51,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:51,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 496 transitions, 10403 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:45:51,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:51,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:51,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:53,362 INFO L124 PetriNetUnfolderBase]: 3384/6108 cut-off events. [2024-06-28 01:45:53,362 INFO L125 PetriNetUnfolderBase]: For 222618/222684 co-relation queries the response was YES. [2024-06-28 01:45:53,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50299 conditions, 6108 events. 3384/6108 cut-off events. For 222618/222684 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 45769 event pairs, 993 based on Foata normal form. 68/6022 useless extension candidates. Maximal degree in co-relation 50119. Up to 5175 conditions per place. [2024-06-28 01:45:53,445 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 488 selfloop transitions, 55 changer transitions 0/551 dead transitions. [2024-06-28 01:45:53,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 551 transitions, 11866 flow [2024-06-28 01:45:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:45:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:45:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-28 01:45:53,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742014742014742 [2024-06-28 01:45:53,447 INFO L175 Difference]: Start difference. First operand has 393 places, 496 transitions, 10403 flow. Second operand 11 states and 193 transitions. [2024-06-28 01:45:53,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 551 transitions, 11866 flow [2024-06-28 01:45:55,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 551 transitions, 11709 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-28 01:45:55,138 INFO L231 Difference]: Finished difference. Result has 400 places, 499 transitions, 10454 flow [2024-06-28 01:45:55,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10251, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10454, PETRI_PLACES=400, PETRI_TRANSITIONS=499} [2024-06-28 01:45:55,139 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 359 predicate places. [2024-06-28 01:45:55,139 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 499 transitions, 10454 flow [2024-06-28 01:45:55,139 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:45:55,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:55,139 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:45:55,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 01:45:55,139 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:45:55,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2064884203, now seen corresponding path program 10 times [2024-06-28 01:45:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797779782] [2024-06-28 01:45:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:45:55,853 INFO 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:45:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:45:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797779782] [2024-06-28 01:45:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797779782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:45:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:45:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:45:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169839461] [2024-06-28 01:45:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:45:55,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:45:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:45:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:45:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:45:55,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:45:55,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 499 transitions, 10454 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:45:55,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:45:55,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:45:55,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:45:57,607 INFO L124 PetriNetUnfolderBase]: 3424/6204 cut-off events. [2024-06-28 01:45:57,607 INFO L125 PetriNetUnfolderBase]: For 227319/227383 co-relation queries the response was YES. [2024-06-28 01:45:57,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51071 conditions, 6204 events. 3424/6204 cut-off events. For 227319/227383 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 46717 event pairs, 971 based on Foata normal form. 66/6110 useless extension candidates. Maximal degree in co-relation 50888. Up to 4905 conditions per place. [2024-06-28 01:45:57,692 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 451 selfloop transitions, 92 changer transitions 0/551 dead transitions. [2024-06-28 01:45:57,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 551 transitions, 12100 flow [2024-06-28 01:45:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:45:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:45:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 01:45:57,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-06-28 01:45:57,693 INFO L175 Difference]: Start difference. First operand has 400 places, 499 transitions, 10454 flow. Second operand 10 states and 181 transitions. [2024-06-28 01:45:57,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 551 transitions, 12100 flow [2024-06-28 01:45:59,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 551 transitions, 11956 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-28 01:45:59,500 INFO L231 Difference]: Finished difference. Result has 405 places, 507 transitions, 10774 flow [2024-06-28 01:45:59,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10310, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10774, PETRI_PLACES=405, PETRI_TRANSITIONS=507} [2024-06-28 01:45:59,500 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 364 predicate places. [2024-06-28 01:45:59,500 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 507 transitions, 10774 flow [2024-06-28 01:45:59,500 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:45:59,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:45:59,501 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:45:59,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 01:45:59,501 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:45:59,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:45:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2003191745, now seen corresponding path program 11 times [2024-06-28 01:45:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:45:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951255507] [2024-06-28 01:45:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:45:59,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:45:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:00,246 INFO 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:46:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951255507] [2024-06-28 01:46:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951255507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:00,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:00,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:00,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184063599] [2024-06-28 01:46:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:00,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:00,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:00,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:00,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:00,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 507 transitions, 10774 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:46:00,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:00,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:00,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:02,039 INFO L124 PetriNetUnfolderBase]: 3482/6224 cut-off events. [2024-06-28 01:46:02,039 INFO L125 PetriNetUnfolderBase]: For 231176/231243 co-relation queries the response was YES. [2024-06-28 01:46:02,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52226 conditions, 6224 events. 3482/6224 cut-off events. For 231176/231243 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 46286 event pairs, 1042 based on Foata normal form. 69/6143 useless extension candidates. Maximal degree in co-relation 52040. Up to 5542 conditions per place. [2024-06-28 01:46:02,121 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 513 selfloop transitions, 33 changer transitions 0/554 dead transitions. [2024-06-28 01:46:02,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 554 transitions, 12216 flow [2024-06-28 01:46:02,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 01:46:02,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-28 01:46:02,122 INFO L175 Difference]: Start difference. First operand has 405 places, 507 transitions, 10774 flow. Second operand 10 states and 171 transitions. [2024-06-28 01:46:02,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 554 transitions, 12216 flow [2024-06-28 01:46:03,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 554 transitions, 12071 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:03,872 INFO L231 Difference]: Finished difference. Result has 412 places, 514 transitions, 10878 flow [2024-06-28 01:46:03,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10629, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10878, PETRI_PLACES=412, PETRI_TRANSITIONS=514} [2024-06-28 01:46:03,872 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 371 predicate places. [2024-06-28 01:46:03,872 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 514 transitions, 10878 flow [2024-06-28 01:46:03,873 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:46:03,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:03,873 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:46:03,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 01:46:03,873 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:46:03,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2064884017, now seen corresponding path program 19 times [2024-06-28 01:46:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314779136] [2024-06-28 01:46:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:04,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:46:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314779136] [2024-06-28 01:46:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314779136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:04,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306739742] [2024-06-28 01:46:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:04,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:04,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:04,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:04,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 514 transitions, 10878 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:46:04,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:04,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:04,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:06,387 INFO L124 PetriNetUnfolderBase]: 3502/6306 cut-off events. [2024-06-28 01:46:06,387 INFO L125 PetriNetUnfolderBase]: For 232930/232994 co-relation queries the response was YES. [2024-06-28 01:46:06,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52498 conditions, 6306 events. 3502/6306 cut-off events. For 232930/232994 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 47380 event pairs, 1061 based on Foata normal form. 66/6203 useless extension candidates. Maximal degree in co-relation 52309. Up to 5528 conditions per place. [2024-06-28 01:46:06,471 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 474 selfloop transitions, 71 changer transitions 0/553 dead transitions. [2024-06-28 01:46:06,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 553 transitions, 12190 flow [2024-06-28 01:46:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 01:46:06,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-28 01:46:06,472 INFO L175 Difference]: Start difference. First operand has 412 places, 514 transitions, 10878 flow. Second operand 10 states and 171 transitions. [2024-06-28 01:46:06,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 553 transitions, 12190 flow [2024-06-28 01:46:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 553 transitions, 12106 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-28 01:46:08,731 INFO L231 Difference]: Finished difference. Result has 415 places, 516 transitions, 10996 flow [2024-06-28 01:46:08,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10794, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10996, PETRI_PLACES=415, PETRI_TRANSITIONS=516} [2024-06-28 01:46:08,732 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 374 predicate places. [2024-06-28 01:46:08,732 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 516 transitions, 10996 flow [2024-06-28 01:46:08,732 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:46:08,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:08,732 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:46:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-28 01:46:08,732 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:46:08,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1690146677, now seen corresponding path program 2 times [2024-06-28 01:46:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148822560] [2024-06-28 01:46:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:09,527 INFO 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:46:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148822560] [2024-06-28 01:46:09,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148822560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:09,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:46:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663853104] [2024-06-28 01:46:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:09,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:46:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:46:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:46:09,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:09,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 516 transitions, 10996 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:46:09,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:09,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:09,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:11,439 INFO L124 PetriNetUnfolderBase]: 3518/6249 cut-off events. [2024-06-28 01:46:11,440 INFO L125 PetriNetUnfolderBase]: For 237192/237259 co-relation queries the response was YES. [2024-06-28 01:46:11,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52630 conditions, 6249 events. 3518/6249 cut-off events. For 237192/237259 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 46319 event pairs, 1080 based on Foata normal form. 69/6176 useless extension candidates. Maximal degree in co-relation 52440. Up to 5719 conditions per place. [2024-06-28 01:46:11,522 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 513 selfloop transitions, 25 changer transitions 0/546 dead transitions. [2024-06-28 01:46:11,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 546 transitions, 12198 flow [2024-06-28 01:46:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-28 01:46:11,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2024-06-28 01:46:11,523 INFO L175 Difference]: Start difference. First operand has 415 places, 516 transitions, 10996 flow. Second operand 10 states and 164 transitions. [2024-06-28 01:46:11,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 546 transitions, 12198 flow [2024-06-28 01:46:13,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 546 transitions, 12032 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-28 01:46:13,501 INFO L231 Difference]: Finished difference. Result has 417 places, 517 transitions, 10909 flow [2024-06-28 01:46:13,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10830, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10909, PETRI_PLACES=417, PETRI_TRANSITIONS=517} [2024-06-28 01:46:13,502 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 376 predicate places. [2024-06-28 01:46:13,502 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 517 transitions, 10909 flow [2024-06-28 01:46:13,502 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:46:13,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:13,502 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:46:13,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-28 01:46:13,502 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:46:13,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash 985345111, now seen corresponding path program 3 times [2024-06-28 01:46:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474870419] [2024-06-28 01:46:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:14,309 INFO 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:46:14,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:14,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474870419] [2024-06-28 01:46:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474870419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:46:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099969859] [2024-06-28 01:46:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:14,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:46:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:14,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:46:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:46:14,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:14,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 517 transitions, 10909 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:46:14,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:14,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:14,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:16,163 INFO L124 PetriNetUnfolderBase]: 3534/6324 cut-off events. [2024-06-28 01:46:16,163 INFO L125 PetriNetUnfolderBase]: For 242065/242132 co-relation queries the response was YES. [2024-06-28 01:46:16,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52704 conditions, 6324 events. 3534/6324 cut-off events. For 242065/242132 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 47271 event pairs, 1049 based on Foata normal form. 69/6240 useless extension candidates. Maximal degree in co-relation 52513. Up to 5682 conditions per place. [2024-06-28 01:46:16,245 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 522 selfloop transitions, 27 changer transitions 0/557 dead transitions. [2024-06-28 01:46:16,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 557 transitions, 12230 flow [2024-06-28 01:46:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-28 01:46:16,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-06-28 01:46:16,246 INFO L175 Difference]: Start difference. First operand has 417 places, 517 transitions, 10909 flow. Second operand 10 states and 169 transitions. [2024-06-28 01:46:16,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 557 transitions, 12230 flow [2024-06-28 01:46:18,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 557 transitions, 12171 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:46:18,322 INFO L231 Difference]: Finished difference. Result has 422 places, 519 transitions, 10960 flow [2024-06-28 01:46:18,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10850, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10960, PETRI_PLACES=422, PETRI_TRANSITIONS=519} [2024-06-28 01:46:18,323 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 381 predicate places. [2024-06-28 01:46:18,323 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 519 transitions, 10960 flow [2024-06-28 01:46:18,324 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:46:18,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:18,324 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:46:18,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-28 01:46:18,324 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:46:18,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash 985336183, now seen corresponding path program 12 times [2024-06-28 01:46:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294535494] [2024-06-28 01:46:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:19,044 INFO 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:46:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294535494] [2024-06-28 01:46:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294535494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:19,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105190820] [2024-06-28 01:46:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:19,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:19,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:19,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 519 transitions, 10960 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:46:19,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:19,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:19,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:21,014 INFO L124 PetriNetUnfolderBase]: 3592/6466 cut-off events. [2024-06-28 01:46:21,014 INFO L125 PetriNetUnfolderBase]: For 247830/247896 co-relation queries the response was YES. [2024-06-28 01:46:21,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53792 conditions, 6466 events. 3592/6466 cut-off events. For 247830/247896 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 48811 event pairs, 1067 based on Foata normal form. 68/6366 useless extension candidates. Maximal degree in co-relation 53599. Up to 5496 conditions per place. [2024-06-28 01:46:21,107 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 499 selfloop transitions, 60 changer transitions 0/567 dead transitions. [2024-06-28 01:46:21,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 567 transitions, 12446 flow [2024-06-28 01:46:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-28 01:46:21,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-06-28 01:46:21,108 INFO L175 Difference]: Start difference. First operand has 422 places, 519 transitions, 10960 flow. Second operand 10 states and 176 transitions. [2024-06-28 01:46:21,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 567 transitions, 12446 flow [2024-06-28 01:46:23,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 567 transitions, 12375 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 01:46:23,413 INFO L231 Difference]: Finished difference. Result has 426 places, 526 transitions, 11199 flow [2024-06-28 01:46:23,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10889, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11199, PETRI_PLACES=426, PETRI_TRANSITIONS=526} [2024-06-28 01:46:23,414 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 385 predicate places. [2024-06-28 01:46:23,414 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 526 transitions, 11199 flow [2024-06-28 01:46:23,414 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:46:23,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:23,414 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:46:23,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-28 01:46:23,414 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:46:23,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1690155605, now seen corresponding path program 13 times [2024-06-28 01:46:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121382648] [2024-06-28 01:46:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:24,181 INFO 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:46:24,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121382648] [2024-06-28 01:46:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121382648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:24,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:24,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:24,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135435187] [2024-06-28 01:46:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:24,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:24,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:24,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 526 transitions, 11199 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:46:24,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:24,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:26,058 INFO L124 PetriNetUnfolderBase]: 3614/6406 cut-off events. [2024-06-28 01:46:26,058 INFO L125 PetriNetUnfolderBase]: For 251085/251152 co-relation queries the response was YES. [2024-06-28 01:46:26,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54171 conditions, 6406 events. 3614/6406 cut-off events. For 251085/251152 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 47549 event pairs, 1105 based on Foata normal form. 69/6331 useless extension candidates. Maximal degree in co-relation 53976. Up to 5837 conditions per place. [2024-06-28 01:46:26,141 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 525 selfloop transitions, 27 changer transitions 0/560 dead transitions. [2024-06-28 01:46:26,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 560 transitions, 12489 flow [2024-06-28 01:46:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-28 01:46:26,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2024-06-28 01:46:26,142 INFO L175 Difference]: Start difference. First operand has 426 places, 526 transitions, 11199 flow. Second operand 10 states and 168 transitions. [2024-06-28 01:46:26,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 560 transitions, 12489 flow [2024-06-28 01:46:28,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 560 transitions, 12375 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 01:46:28,331 INFO L231 Difference]: Finished difference. Result has 431 places, 528 transitions, 11206 flow [2024-06-28 01:46:28,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11085, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11206, PETRI_PLACES=431, PETRI_TRANSITIONS=528} [2024-06-28 01:46:28,331 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 390 predicate places. [2024-06-28 01:46:28,331 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 528 transitions, 11206 flow [2024-06-28 01:46:28,331 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:46:28,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:28,331 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:46:28,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-28 01:46:28,332 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:46:28,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2071319803, now seen corresponding path program 14 times [2024-06-28 01:46:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:28,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567746607] [2024-06-28 01:46:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:46:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567746607] [2024-06-28 01:46:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567746607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:29,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:29,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12965215] [2024-06-28 01:46:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:29,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:29,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:29,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:29,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 528 transitions, 11206 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:46:29,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:29,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:29,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:31,100 INFO L124 PetriNetUnfolderBase]: 3636/6556 cut-off events. [2024-06-28 01:46:31,100 INFO L125 PetriNetUnfolderBase]: For 257879/257945 co-relation queries the response was YES. [2024-06-28 01:46:31,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54479 conditions, 6556 events. 3636/6556 cut-off events. For 257879/257945 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 49729 event pairs, 1075 based on Foata normal form. 68/6447 useless extension candidates. Maximal degree in co-relation 54283. Up to 5564 conditions per place. [2024-06-28 01:46:31,186 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 510 selfloop transitions, 57 changer transitions 0/575 dead transitions. [2024-06-28 01:46:31,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 575 transitions, 12617 flow [2024-06-28 01:46:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:46:31,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-28 01:46:31,187 INFO L175 Difference]: Start difference. First operand has 431 places, 528 transitions, 11206 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:46:31,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 575 transitions, 12617 flow [2024-06-28 01:46:33,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 575 transitions, 12524 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-28 01:46:33,414 INFO L231 Difference]: Finished difference. Result has 433 places, 530 transitions, 11291 flow [2024-06-28 01:46:33,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11113, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11291, PETRI_PLACES=433, PETRI_TRANSITIONS=530} [2024-06-28 01:46:33,414 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 392 predicate places. [2024-06-28 01:46:33,415 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 530 transitions, 11291 flow [2024-06-28 01:46:33,415 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:46:33,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:33,415 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:46:33,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-28 01:46:33,415 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:46:33,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:33,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2071313107, now seen corresponding path program 20 times [2024-06-28 01:46:33,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:33,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297938041] [2024-06-28 01:46:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:34,065 INFO 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:46:34,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:34,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297938041] [2024-06-28 01:46:34,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297938041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:34,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:34,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828419894] [2024-06-28 01:46:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:34,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:34,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:34,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 530 transitions, 11291 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:46:34,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:34,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:34,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:36,030 INFO L124 PetriNetUnfolderBase]: 3656/6529 cut-off events. [2024-06-28 01:46:36,030 INFO L125 PetriNetUnfolderBase]: For 261369/261435 co-relation queries the response was YES. [2024-06-28 01:46:36,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54781 conditions, 6529 events. 3656/6529 cut-off events. For 261369/261435 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 48969 event pairs, 1130 based on Foata normal form. 68/6430 useless extension candidates. Maximal degree in co-relation 54584. Up to 5839 conditions per place. [2024-06-28 01:46:36,114 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 505 selfloop transitions, 57 changer transitions 0/570 dead transitions. [2024-06-28 01:46:36,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 570 transitions, 12648 flow [2024-06-28 01:46:36,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 01:46:36,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-28 01:46:36,115 INFO L175 Difference]: Start difference. First operand has 433 places, 530 transitions, 11291 flow. Second operand 10 states and 171 transitions. [2024-06-28 01:46:36,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 570 transitions, 12648 flow [2024-06-28 01:46:38,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 570 transitions, 12495 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-28 01:46:38,242 INFO L231 Difference]: Finished difference. Result has 435 places, 532 transitions, 11316 flow [2024-06-28 01:46:38,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11138, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11316, PETRI_PLACES=435, PETRI_TRANSITIONS=532} [2024-06-28 01:46:38,242 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 394 predicate places. [2024-06-28 01:46:38,242 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 532 transitions, 11316 flow [2024-06-28 01:46:38,243 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:46:38,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:38,243 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:46:38,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-28 01:46:38,243 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:46:38,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1678748597, now seen corresponding path program 4 times [2024-06-28 01:46:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109552142] [2024-06-28 01:46:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:46:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109552142] [2024-06-28 01:46:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109552142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:39,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:46:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638631282] [2024-06-28 01:46:39,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:39,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:46:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:46:39,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:46:39,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:39,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 532 transitions, 11316 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:46:39,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:39,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:39,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:41,024 INFO L124 PetriNetUnfolderBase]: 3661/6492 cut-off events. [2024-06-28 01:46:41,024 INFO L125 PetriNetUnfolderBase]: For 254383/254450 co-relation queries the response was YES. [2024-06-28 01:46:41,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54398 conditions, 6492 events. 3661/6492 cut-off events. For 254383/254450 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 48269 event pairs, 1120 based on Foata normal form. 69/6416 useless extension candidates. Maximal degree in co-relation 54200. Up to 5945 conditions per place. [2024-06-28 01:46:41,109 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 531 selfloop transitions, 27 changer transitions 0/566 dead transitions. [2024-06-28 01:46:41,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 566 transitions, 12578 flow [2024-06-28 01:46:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-28 01:46:41,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2024-06-28 01:46:41,110 INFO L175 Difference]: Start difference. First operand has 435 places, 532 transitions, 11316 flow. Second operand 10 states and 165 transitions. [2024-06-28 01:46:41,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 566 transitions, 12578 flow [2024-06-28 01:46:43,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 566 transitions, 12436 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-28 01:46:43,560 INFO L231 Difference]: Finished difference. Result has 438 places, 535 transitions, 11288 flow [2024-06-28 01:46:43,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11174, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11288, PETRI_PLACES=438, PETRI_TRANSITIONS=535} [2024-06-28 01:46:43,561 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 397 predicate places. [2024-06-28 01:46:43,561 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 535 transitions, 11288 flow [2024-06-28 01:46:43,561 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:46:43,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:43,561 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:46:43,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-28 01:46:43,561 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:46:43,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash 985099033, now seen corresponding path program 15 times [2024-06-28 01:46:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:43,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156384570] [2024-06-28 01:46:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:46:44,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:44,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156384570] [2024-06-28 01:46:44,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156384570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:44,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:44,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:44,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384631670] [2024-06-28 01:46:44,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:44,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:44,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:44,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:44,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 535 transitions, 11288 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:46:44,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:44,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:44,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:46,305 INFO L124 PetriNetUnfolderBase]: 3683/6667 cut-off events. [2024-06-28 01:46:46,306 INFO L125 PetriNetUnfolderBase]: For 264941/265007 co-relation queries the response was YES. [2024-06-28 01:46:46,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55190 conditions, 6667 events. 3683/6667 cut-off events. For 264941/265007 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 50902 event pairs, 1079 based on Foata normal form. 68/6552 useless extension candidates. Maximal degree in co-relation 54990. Up to 5572 conditions per place. [2024-06-28 01:46:46,393 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 517 selfloop transitions, 63 changer transitions 0/588 dead transitions. [2024-06-28 01:46:46,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 588 transitions, 12775 flow [2024-06-28 01:46:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:46:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:46:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-28 01:46:46,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157248157248156 [2024-06-28 01:46:46,394 INFO L175 Difference]: Start difference. First operand has 438 places, 535 transitions, 11288 flow. Second operand 11 states and 196 transitions. [2024-06-28 01:46:46,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 588 transitions, 12775 flow [2024-06-28 01:46:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 588 transitions, 12691 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 01:46:48,814 INFO L231 Difference]: Finished difference. Result has 442 places, 537 transitions, 11401 flow [2024-06-28 01:46:48,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11204, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11401, PETRI_PLACES=442, PETRI_TRANSITIONS=537} [2024-06-28 01:46:48,815 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 401 predicate places. [2024-06-28 01:46:48,815 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 537 transitions, 11401 flow [2024-06-28 01:46:48,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:46:48,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:48,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:46:48,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-28 01:46:48,815 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:46:48,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2003198441, now seen corresponding path program 21 times [2024-06-28 01:46:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153450205] [2024-06-28 01:46:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:48,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:49,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:46:49,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:49,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153450205] [2024-06-28 01:46:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153450205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:49,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:49,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878245461] [2024-06-28 01:46:49,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:49,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:49,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:49,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 537 transitions, 11401 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:46:49,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:49,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:51,368 INFO L124 PetriNetUnfolderBase]: 3680/6540 cut-off events. [2024-06-28 01:46:51,368 INFO L125 PetriNetUnfolderBase]: For 257826/257893 co-relation queries the response was YES. [2024-06-28 01:46:51,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54986 conditions, 6540 events. 3680/6540 cut-off events. For 257826/257893 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 48909 event pairs, 1131 based on Foata normal form. 69/6456 useless extension candidates. Maximal degree in co-relation 54785. Up to 5962 conditions per place. [2024-06-28 01:46:51,450 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 530 selfloop transitions, 34 changer transitions 0/572 dead transitions. [2024-06-28 01:46:51,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 572 transitions, 12691 flow [2024-06-28 01:46:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:46:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:46:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 01:46:51,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2024-06-28 01:46:51,452 INFO L175 Difference]: Start difference. First operand has 442 places, 537 transitions, 11401 flow. Second operand 10 states and 166 transitions. [2024-06-28 01:46:51,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 572 transitions, 12691 flow [2024-06-28 01:46:53,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 572 transitions, 12505 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-28 01:46:53,901 INFO L231 Difference]: Finished difference. Result has 444 places, 537 transitions, 11289 flow [2024-06-28 01:46:53,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11215, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11289, PETRI_PLACES=444, PETRI_TRANSITIONS=537} [2024-06-28 01:46:53,902 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 403 predicate places. [2024-06-28 01:46:53,902 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 537 transitions, 11289 flow [2024-06-28 01:46:53,902 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:46:53,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:53,902 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:46:53,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-28 01:46:53,902 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:46:53,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2003198255, now seen corresponding path program 16 times [2024-06-28 01:46:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751461032] [2024-06-28 01:46:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:46:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751461032] [2024-06-28 01:46:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751461032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:54,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:54,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:46:54,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895338184] [2024-06-28 01:46:54,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:54,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:46:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:54,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:46:54,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:46:54,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:54,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 537 transitions, 11289 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:46:54,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:54,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:54,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:56,703 INFO L124 PetriNetUnfolderBase]: 3682/6592 cut-off events. [2024-06-28 01:46:56,703 INFO L125 PetriNetUnfolderBase]: For 249307/249374 co-relation queries the response was YES. [2024-06-28 01:46:56,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54460 conditions, 6592 events. 3682/6592 cut-off events. For 249307/249374 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 49634 event pairs, 1095 based on Foata normal form. 69/6501 useless extension candidates. Maximal degree in co-relation 54258. Up to 5796 conditions per place. [2024-06-28 01:46:56,791 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 539 selfloop transitions, 39 changer transitions 0/586 dead transitions. [2024-06-28 01:46:56,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 586 transitions, 12935 flow [2024-06-28 01:46:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:46:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:46:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-28 01:46:56,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668304668304668 [2024-06-28 01:46:56,794 INFO L175 Difference]: Start difference. First operand has 444 places, 537 transitions, 11289 flow. Second operand 11 states and 190 transitions. [2024-06-28 01:46:56,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 586 transitions, 12935 flow [2024-06-28 01:46:59,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 586 transitions, 12857 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-28 01:46:59,715 INFO L231 Difference]: Finished difference. Result has 447 places, 539 transitions, 11366 flow [2024-06-28 01:46:59,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11213, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11366, PETRI_PLACES=447, PETRI_TRANSITIONS=539} [2024-06-28 01:46:59,716 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 406 predicate places. [2024-06-28 01:46:59,716 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 539 transitions, 11366 flow [2024-06-28 01:46:59,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:46:59,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:59,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:46:59,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-28 01:46:59,716 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:46:59,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2002961105, now seen corresponding path program 17 times [2024-06-28 01:46:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047537045] [2024-06-28 01:46:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:00,502 INFO 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:47:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047537045] [2024-06-28 01:47:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047537045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:00,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:47:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45467311] [2024-06-28 01:47:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:00,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:47:00,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:00,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:47:00,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:47:00,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:00,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 539 transitions, 11366 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:47:00,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:00,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:00,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:02,520 INFO L124 PetriNetUnfolderBase]: 3678/6551 cut-off events. [2024-06-28 01:47:02,520 INFO L125 PetriNetUnfolderBase]: For 244256/244323 co-relation queries the response was YES. [2024-06-28 01:47:02,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54282 conditions, 6551 events. 3678/6551 cut-off events. For 244256/244323 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 49126 event pairs, 1102 based on Foata normal form. 69/6468 useless extension candidates. Maximal degree in co-relation 54079. Up to 5866 conditions per place. [2024-06-28 01:47:02,608 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 533 selfloop transitions, 34 changer transitions 0/575 dead transitions. [2024-06-28 01:47:02,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 575 transitions, 12679 flow [2024-06-28 01:47:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-28 01:47:02,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:47:02,609 INFO L175 Difference]: Start difference. First operand has 447 places, 539 transitions, 11366 flow. Second operand 10 states and 170 transitions. [2024-06-28 01:47:02,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 575 transitions, 12679 flow [2024-06-28 01:47:05,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 575 transitions, 12466 flow, removed 60 selfloop flow, removed 9 redundant places. [2024-06-28 01:47:05,282 INFO L231 Difference]: Finished difference. Result has 449 places, 540 transitions, 11255 flow [2024-06-28 01:47:05,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11153, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11255, PETRI_PLACES=449, PETRI_TRANSITIONS=540} [2024-06-28 01:47:05,283 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 408 predicate places. [2024-06-28 01:47:05,283 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 540 transitions, 11255 flow [2024-06-28 01:47:05,283 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:47:05,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:05,283 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:47:05,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-28 01:47:05,284 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:47:05,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2002952177, now seen corresponding path program 5 times [2024-06-28 01:47:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634290077] [2024-06-28 01:47:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:06,045 INFO 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:47:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634290077] [2024-06-28 01:47:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634290077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284350145] [2024-06-28 01:47:06,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:06,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:06,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:06,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:06,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:06,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:06,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 540 transitions, 11255 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:47:06,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:06,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:06,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:08,050 INFO L124 PetriNetUnfolderBase]: 3675/6533 cut-off events. [2024-06-28 01:47:08,051 INFO L125 PetriNetUnfolderBase]: For 234937/235004 co-relation queries the response was YES. [2024-06-28 01:47:08,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53585 conditions, 6533 events. 3675/6533 cut-off events. For 234937/235004 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 48842 event pairs, 1114 based on Foata normal form. 69/6452 useless extension candidates. Maximal degree in co-relation 53380. Up to 5971 conditions per place. [2024-06-28 01:47:08,142 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 543 selfloop transitions, 22 changer transitions 0/573 dead transitions. [2024-06-28 01:47:08,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 573 transitions, 12548 flow [2024-06-28 01:47:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-28 01:47:08,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2024-06-28 01:47:08,143 INFO L175 Difference]: Start difference. First operand has 449 places, 540 transitions, 11255 flow. Second operand 10 states and 164 transitions. [2024-06-28 01:47:08,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 573 transitions, 12548 flow [2024-06-28 01:47:10,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 573 transitions, 12434 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:47:10,912 INFO L231 Difference]: Finished difference. Result has 453 places, 541 transitions, 11220 flow [2024-06-28 01:47:10,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11141, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11220, PETRI_PLACES=453, PETRI_TRANSITIONS=541} [2024-06-28 01:47:10,913 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 412 predicate places. [2024-06-28 01:47:10,913 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 541 transitions, 11220 flow [2024-06-28 01:47:10,913 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:47:10,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:10,913 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:47:10,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-28 01:47:10,913 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:47:10,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2019842732, now seen corresponding path program 1 times [2024-06-28 01:47:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877804460] [2024-06-28 01:47:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:11,585 INFO 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:47:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877804460] [2024-06-28 01:47:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877804460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774855116] [2024-06-28 01:47:11,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:11,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:11,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 541 transitions, 11220 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:47:11,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:11,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:11,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:13,599 INFO L124 PetriNetUnfolderBase]: 3926/7018 cut-off events. [2024-06-28 01:47:13,599 INFO L125 PetriNetUnfolderBase]: For 325292/325367 co-relation queries the response was YES. [2024-06-28 01:47:13,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56571 conditions, 7018 events. 3926/7018 cut-off events. For 325292/325367 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 53314 event pairs, 802 based on Foata normal form. 83/6963 useless extension candidates. Maximal degree in co-relation 56366. Up to 2345 conditions per place. [2024-06-28 01:47:13,694 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 313 selfloop transitions, 281 changer transitions 0/602 dead transitions. [2024-06-28 01:47:13,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 602 transitions, 12974 flow [2024-06-28 01:47:13,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:47:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:47:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-28 01:47:13,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085995085995086 [2024-06-28 01:47:13,695 INFO L175 Difference]: Start difference. First operand has 453 places, 541 transitions, 11220 flow. Second operand 11 states and 207 transitions. [2024-06-28 01:47:13,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 602 transitions, 12974 flow [2024-06-28 01:47:16,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 602 transitions, 12900 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-28 01:47:16,717 INFO L231 Difference]: Finished difference. Result has 458 places, 543 transitions, 11782 flow [2024-06-28 01:47:16,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11146, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11782, PETRI_PLACES=458, PETRI_TRANSITIONS=543} [2024-06-28 01:47:16,717 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 417 predicate places. [2024-06-28 01:47:16,717 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 543 transitions, 11782 flow [2024-06-28 01:47:16,718 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:47:16,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:16,718 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:47:16,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-28 01:47:16,718 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:47:16,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash -354494706, now seen corresponding path program 2 times [2024-06-28 01:47:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:16,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283835593] [2024-06-28 01:47:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:16,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:47:17,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283835593] [2024-06-28 01:47:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283835593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510597715] [2024-06-28 01:47:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:17,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:17,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:17,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:17,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 543 transitions, 11782 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:47:17,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:17,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:17,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:19,825 INFO L124 PetriNetUnfolderBase]: 4059/7343 cut-off events. [2024-06-28 01:47:19,825 INFO L125 PetriNetUnfolderBase]: For 386655/386732 co-relation queries the response was YES. [2024-06-28 01:47:19,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59978 conditions, 7343 events. 4059/7343 cut-off events. For 386655/386732 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 56852 event pairs, 887 based on Foata normal form. 85/7260 useless extension candidates. Maximal degree in co-relation 59770. Up to 3590 conditions per place. [2024-06-28 01:47:19,936 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 311 selfloop transitions, 286 changer transitions 0/605 dead transitions. [2024-06-28 01:47:19,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 605 transitions, 13510 flow [2024-06-28 01:47:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:47:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:47:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-06-28 01:47:19,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-06-28 01:47:19,937 INFO L175 Difference]: Start difference. First operand has 458 places, 543 transitions, 11782 flow. Second operand 12 states and 230 transitions. [2024-06-28 01:47:19,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 605 transitions, 13510 flow [2024-06-28 01:47:23,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 605 transitions, 12914 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:23,291 INFO L231 Difference]: Finished difference. Result has 463 places, 543 transitions, 11762 flow [2024-06-28 01:47:23,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11186, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11762, PETRI_PLACES=463, PETRI_TRANSITIONS=543} [2024-06-28 01:47:23,291 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 422 predicate places. [2024-06-28 01:47:23,291 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 543 transitions, 11762 flow [2024-06-28 01:47:23,292 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:47:23,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:23,292 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:47:23,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-28 01:47:23,292 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:47:23,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -358213776, now seen corresponding path program 3 times [2024-06-28 01:47:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137677627] [2024-06-28 01:47:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:24,066 INFO 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:47:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137677627] [2024-06-28 01:47:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137677627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:24,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:24,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:24,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475077168] [2024-06-28 01:47:24,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:24,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:24,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:24,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:24,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 543 transitions, 11762 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:47:24,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:24,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:24,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:26,344 INFO L124 PetriNetUnfolderBase]: 4027/7261 cut-off events. [2024-06-28 01:47:26,344 INFO L125 PetriNetUnfolderBase]: For 372120/372205 co-relation queries the response was YES. [2024-06-28 01:47:26,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59163 conditions, 7261 events. 4027/7261 cut-off events. For 372120/372205 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 55999 event pairs, 820 based on Foata normal form. 93/7188 useless extension candidates. Maximal degree in co-relation 58954. Up to 3130 conditions per place. [2024-06-28 01:47:26,452 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 320 selfloop transitions, 286 changer transitions 0/614 dead transitions. [2024-06-28 01:47:26,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 614 transitions, 13615 flow [2024-06-28 01:47:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:47:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:47:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2024-06-28 01:47:26,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292792792792793 [2024-06-28 01:47:26,453 INFO L175 Difference]: Start difference. First operand has 463 places, 543 transitions, 11762 flow. Second operand 12 states and 235 transitions. [2024-06-28 01:47:26,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 614 transitions, 13615 flow [2024-06-28 01:47:29,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 614 transitions, 13059 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:47:29,596 INFO L231 Difference]: Finished difference. Result has 469 places, 549 transitions, 11909 flow [2024-06-28 01:47:29,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11206, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11909, PETRI_PLACES=469, PETRI_TRANSITIONS=549} [2024-06-28 01:47:29,597 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 428 predicate places. [2024-06-28 01:47:29,597 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 549 transitions, 11909 flow [2024-06-28 01:47:29,597 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:47:29,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:29,597 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:47:29,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-28 01:47:29,597 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:47:29,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash -470533964, now seen corresponding path program 4 times [2024-06-28 01:47:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413098072] [2024-06-28 01:47:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:30,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:47:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:30,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413098072] [2024-06-28 01:47:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413098072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391342976] [2024-06-28 01:47:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:30,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:30,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:30,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 549 transitions, 11909 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:47:30,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:30,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:32,905 INFO L124 PetriNetUnfolderBase]: 4104/7613 cut-off events. [2024-06-28 01:47:32,905 INFO L125 PetriNetUnfolderBase]: For 389826/389915 co-relation queries the response was YES. [2024-06-28 01:47:32,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59262 conditions, 7613 events. 4104/7613 cut-off events. For 389826/389915 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 60517 event pairs, 867 based on Foata normal form. 109/7508 useless extension candidates. Maximal degree in co-relation 59049. Up to 3891 conditions per place. [2024-06-28 01:47:33,020 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 380 selfloop transitions, 245 changer transitions 0/633 dead transitions. [2024-06-28 01:47:33,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 633 transitions, 13644 flow [2024-06-28 01:47:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 01:47:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 01:47:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 275 transitions. [2024-06-28 01:47:33,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:47:33,022 INFO L175 Difference]: Start difference. First operand has 469 places, 549 transitions, 11909 flow. Second operand 15 states and 275 transitions. [2024-06-28 01:47:33,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 633 transitions, 13644 flow [2024-06-28 01:47:36,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 633 transitions, 13244 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-28 01:47:36,404 INFO L231 Difference]: Finished difference. Result has 480 places, 556 transitions, 12236 flow [2024-06-28 01:47:36,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11515, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12236, PETRI_PLACES=480, PETRI_TRANSITIONS=556} [2024-06-28 01:47:36,405 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 439 predicate places. [2024-06-28 01:47:36,405 INFO L495 AbstractCegarLoop]: Abstraction has has 480 places, 556 transitions, 12236 flow [2024-06-28 01:47:36,405 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:47:36,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:36,405 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:47:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-28 01:47:36,405 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:47:36,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -470683694, now seen corresponding path program 5 times [2024-06-28 01:47:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:36,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126137338] [2024-06-28 01:47:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:37,140 INFO 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:47:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126137338] [2024-06-28 01:47:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126137338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:37,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905380578] [2024-06-28 01:47:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:37,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:37,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:37,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:37,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 556 transitions, 12236 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:47:37,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:37,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:37,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:39,761 INFO L124 PetriNetUnfolderBase]: 4106/7510 cut-off events. [2024-06-28 01:47:39,761 INFO L125 PetriNetUnfolderBase]: For 298041/298126 co-relation queries the response was YES. [2024-06-28 01:47:39,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59610 conditions, 7510 events. 4106/7510 cut-off events. For 298041/298126 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 58630 event pairs, 863 based on Foata normal form. 93/7406 useless extension candidates. Maximal degree in co-relation 59394. Up to 3464 conditions per place. [2024-06-28 01:47:39,861 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 319 selfloop transitions, 292 changer transitions 0/619 dead transitions. [2024-06-28 01:47:39,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 619 transitions, 13800 flow [2024-06-28 01:47:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:47:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:47:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 232 transitions. [2024-06-28 01:47:39,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2024-06-28 01:47:39,861 INFO L175 Difference]: Start difference. First operand has 480 places, 556 transitions, 12236 flow. Second operand 12 states and 232 transitions. [2024-06-28 01:47:39,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 619 transitions, 13800 flow [2024-06-28 01:47:42,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 619 transitions, 13457 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-28 01:47:42,307 INFO L231 Difference]: Finished difference. Result has 481 places, 556 transitions, 12481 flow [2024-06-28 01:47:42,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11893, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12481, PETRI_PLACES=481, PETRI_TRANSITIONS=556} [2024-06-28 01:47:42,307 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 440 predicate places. [2024-06-28 01:47:42,307 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 556 transitions, 12481 flow [2024-06-28 01:47:42,307 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:47:42,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:42,307 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:47:42,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-28 01:47:42,308 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:47:42,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1379801772, now seen corresponding path program 6 times [2024-06-28 01:47:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860093429] [2024-06-28 01:47:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:43,065 INFO 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:47:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:43,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860093429] [2024-06-28 01:47:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860093429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167807367] [2024-06-28 01:47:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:43,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:43,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:43,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 556 transitions, 12481 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:47:43,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:43,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:43,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:45,474 INFO L124 PetriNetUnfolderBase]: 4226/7928 cut-off events. [2024-06-28 01:47:45,475 INFO L125 PetriNetUnfolderBase]: For 308400/308466 co-relation queries the response was YES. [2024-06-28 01:47:45,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61295 conditions, 7928 events. 4226/7928 cut-off events. For 308400/308466 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 64276 event pairs, 1090 based on Foata normal form. 74/7749 useless extension candidates. Maximal degree in co-relation 61078. Up to 5106 conditions per place. [2024-06-28 01:47:45,590 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 446 selfloop transitions, 160 changer transitions 0/614 dead transitions. [2024-06-28 01:47:45,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 614 transitions, 14006 flow [2024-06-28 01:47:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:47:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:47:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-28 01:47:45,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085995085995086 [2024-06-28 01:47:45,591 INFO L175 Difference]: Start difference. First operand has 481 places, 556 transitions, 12481 flow. Second operand 11 states and 207 transitions. [2024-06-28 01:47:45,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 614 transitions, 14006 flow [2024-06-28 01:47:48,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 614 transitions, 13208 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-28 01:47:48,030 INFO L231 Difference]: Finished difference. Result has 481 places, 556 transitions, 12006 flow [2024-06-28 01:47:48,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11683, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12006, PETRI_PLACES=481, PETRI_TRANSITIONS=556} [2024-06-28 01:47:48,030 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 440 predicate places. [2024-06-28 01:47:48,030 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 556 transitions, 12006 flow [2024-06-28 01:47:48,030 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:47:48,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:48,031 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:47:48,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-28 01:47:48,031 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:47:48,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1374439392, now seen corresponding path program 7 times [2024-06-28 01:47:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:48,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957949173] [2024-06-28 01:47:48,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:48,816 INFO 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:47:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957949173] [2024-06-28 01:47:48,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957949173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:48,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:48,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:48,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026107356] [2024-06-28 01:47:48,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:48,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:48,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:48,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:48,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:48,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:48,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 556 transitions, 12006 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:47:48,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:48,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:48,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:51,363 INFO L124 PetriNetUnfolderBase]: 4376/8020 cut-off events. [2024-06-28 01:47:51,363 INFO L125 PetriNetUnfolderBase]: For 310596/310663 co-relation queries the response was YES. [2024-06-28 01:47:51,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61210 conditions, 8020 events. 4376/8020 cut-off events. For 310596/310663 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 64186 event pairs, 1080 based on Foata normal form. 75/7909 useless extension candidates. Maximal degree in co-relation 60992. Up to 5297 conditions per place. [2024-06-28 01:47:51,483 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 408 selfloop transitions, 208 changer transitions 0/624 dead transitions. [2024-06-28 01:47:51,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 624 transitions, 13781 flow [2024-06-28 01:47:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:47:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:47:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-28 01:47:51,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-28 01:47:51,486 INFO L175 Difference]: Start difference. First operand has 481 places, 556 transitions, 12006 flow. Second operand 11 states and 212 transitions. [2024-06-28 01:47:51,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 624 transitions, 13781 flow [2024-06-28 01:47:54,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 624 transitions, 13476 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:47:54,776 INFO L231 Difference]: Finished difference. Result has 487 places, 562 transitions, 12354 flow [2024-06-28 01:47:54,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11701, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12354, PETRI_PLACES=487, PETRI_TRANSITIONS=562} [2024-06-28 01:47:54,776 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 446 predicate places. [2024-06-28 01:47:54,776 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 562 transitions, 12354 flow [2024-06-28 01:47:54,776 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:47:54,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:54,777 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:47:54,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-28 01:47:54,777 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:54,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash 58137938, now seen corresponding path program 8 times [2024-06-28 01:47:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195739616] [2024-06-28 01:47:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:47:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195739616] [2024-06-28 01:47:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195739616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:47:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097834509] [2024-06-28 01:47:55,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:55,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:47:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:55,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:47:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:47:55,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:55,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 562 transitions, 12354 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:47:55,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:55,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:55,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:58,290 INFO L124 PetriNetUnfolderBase]: 4489/8257 cut-off events. [2024-06-28 01:47:58,290 INFO L125 PetriNetUnfolderBase]: For 320572/320643 co-relation queries the response was YES. [2024-06-28 01:47:58,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62592 conditions, 8257 events. 4489/8257 cut-off events. For 320572/320643 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 66525 event pairs, 1103 based on Foata normal form. 79/8148 useless extension candidates. Maximal degree in co-relation 62370. Up to 4872 conditions per place. [2024-06-28 01:47:58,413 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 409 selfloop transitions, 213 changer transitions 0/630 dead transitions. [2024-06-28 01:47:58,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 630 transitions, 14081 flow [2024-06-28 01:47:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:47:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:47:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 229 transitions. [2024-06-28 01:47:58,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157657657657657 [2024-06-28 01:47:58,414 INFO L175 Difference]: Start difference. First operand has 487 places, 562 transitions, 12354 flow. Second operand 12 states and 229 transitions. [2024-06-28 01:47:58,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 630 transitions, 14081 flow [2024-06-28 01:48:01,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 630 transitions, 13757 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-28 01:48:01,901 INFO L231 Difference]: Finished difference. Result has 495 places, 564 transitions, 12558 flow [2024-06-28 01:48:01,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12030, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12558, PETRI_PLACES=495, PETRI_TRANSITIONS=564} [2024-06-28 01:48:01,902 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 454 predicate places. [2024-06-28 01:48:01,902 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 564 transitions, 12558 flow [2024-06-28 01:48:01,902 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:48:01,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:01,902 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:48:01,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-28 01:48:01,902 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:01,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1351811930, now seen corresponding path program 9 times [2024-06-28 01:48:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709136260] [2024-06-28 01:48:01,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:02,685 INFO 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:48:02,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709136260] [2024-06-28 01:48:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709136260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:02,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:02,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:02,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824470923] [2024-06-28 01:48:02,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:02,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:02,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:02,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 564 transitions, 12558 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:48:02,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:02,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:02,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:05,428 INFO L124 PetriNetUnfolderBase]: 4616/8540 cut-off events. [2024-06-28 01:48:05,428 INFO L125 PetriNetUnfolderBase]: For 370475/370549 co-relation queries the response was YES. [2024-06-28 01:48:05,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65356 conditions, 8540 events. 4616/8540 cut-off events. For 370475/370549 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 69597 event pairs, 1208 based on Foata normal form. 82/8416 useless extension candidates. Maximal degree in co-relation 65131. Up to 5543 conditions per place. [2024-06-28 01:48:05,565 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 408 selfloop transitions, 215 changer transitions 0/631 dead transitions. [2024-06-28 01:48:05,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 631 transitions, 14528 flow [2024-06-28 01:48:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:48:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:48:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-28 01:48:05,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5331695331695332 [2024-06-28 01:48:05,565 INFO L175 Difference]: Start difference. First operand has 495 places, 564 transitions, 12558 flow. Second operand 11 states and 217 transitions. [2024-06-28 01:48:05,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 631 transitions, 14528 flow [2024-06-28 01:48:09,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 631 transitions, 14078 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-28 01:48:09,478 INFO L231 Difference]: Finished difference. Result has 500 places, 566 transitions, 12633 flow [2024-06-28 01:48:09,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12108, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12633, PETRI_PLACES=500, PETRI_TRANSITIONS=566} [2024-06-28 01:48:09,478 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 459 predicate places. [2024-06-28 01:48:09,478 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 566 transitions, 12633 flow [2024-06-28 01:48:09,478 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:48:09,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:09,478 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:48:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-28 01:48:09,478 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:09,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1351956080, now seen corresponding path program 10 times [2024-06-28 01:48:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250724395] [2024-06-28 01:48:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:48:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:10,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250724395] [2024-06-28 01:48:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250724395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:10,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:10,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967102620] [2024-06-28 01:48:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:10,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:10,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:10,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:10,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 566 transitions, 12633 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:48:10,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:10,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:10,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:13,199 INFO L124 PetriNetUnfolderBase]: 4618/8555 cut-off events. [2024-06-28 01:48:13,199 INFO L125 PetriNetUnfolderBase]: For 330923/330995 co-relation queries the response was YES. [2024-06-28 01:48:13,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64690 conditions, 8555 events. 4618/8555 cut-off events. For 330923/330995 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 69839 event pairs, 1238 based on Foata normal form. 80/8424 useless extension candidates. Maximal degree in co-relation 64462. Up to 5711 conditions per place. [2024-06-28 01:48:13,320 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 405 selfloop transitions, 216 changer transitions 0/629 dead transitions. [2024-06-28 01:48:13,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 629 transitions, 14345 flow [2024-06-28 01:48:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:48:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:48:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-28 01:48:13,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-28 01:48:13,321 INFO L175 Difference]: Start difference. First operand has 500 places, 566 transitions, 12633 flow. Second operand 11 states and 213 transitions. [2024-06-28 01:48:13,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 629 transitions, 14345 flow [2024-06-28 01:48:16,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 629 transitions, 13160 flow, removed 53 selfloop flow, removed 11 redundant places. [2024-06-28 01:48:16,470 INFO L231 Difference]: Finished difference. Result has 502 places, 569 transitions, 12016 flow [2024-06-28 01:48:16,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11457, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12016, PETRI_PLACES=502, PETRI_TRANSITIONS=569} [2024-06-28 01:48:16,471 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 461 predicate places. [2024-06-28 01:48:16,471 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 569 transitions, 12016 flow [2024-06-28 01:48:16,471 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:48:16,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:16,471 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:48:16,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-28 01:48:16,471 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:16,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1232192172, now seen corresponding path program 11 times [2024-06-28 01:48:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052593418] [2024-06-28 01:48:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:17,293 INFO 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:48:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052593418] [2024-06-28 01:48:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052593418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:17,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:17,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605531333] [2024-06-28 01:48:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:17,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:17,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:17,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:17,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 569 transitions, 12016 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:48:17,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:17,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:17,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:20,049 INFO L124 PetriNetUnfolderBase]: 4718/8923 cut-off events. [2024-06-28 01:48:20,049 INFO L125 PetriNetUnfolderBase]: For 334356/334435 co-relation queries the response was YES. [2024-06-28 01:48:20,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62515 conditions, 8923 events. 4718/8923 cut-off events. For 334356/334435 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 74860 event pairs, 1328 based on Foata normal form. 87/8751 useless extension candidates. Maximal degree in co-relation 62288. Up to 4856 conditions per place. [2024-06-28 01:48:20,189 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 453 selfloop transitions, 165 changer transitions 0/626 dead transitions. [2024-06-28 01:48:20,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 626 transitions, 13551 flow [2024-06-28 01:48:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:48:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:48:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-28 01:48:20,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-28 01:48:20,190 INFO L175 Difference]: Start difference. First operand has 502 places, 569 transitions, 12016 flow. Second operand 11 states and 212 transitions. [2024-06-28 01:48:20,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 626 transitions, 13551 flow [2024-06-28 01:48:23,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 626 transitions, 12927 flow, removed 41 selfloop flow, removed 9 redundant places. [2024-06-28 01:48:23,843 INFO L231 Difference]: Finished difference. Result has 504 places, 569 transitions, 11725 flow [2024-06-28 01:48:23,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11392, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11725, PETRI_PLACES=504, PETRI_TRANSITIONS=569} [2024-06-28 01:48:23,844 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 463 predicate places. [2024-06-28 01:48:23,844 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 569 transitions, 11725 flow [2024-06-28 01:48:23,844 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:48:23,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:23,844 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:48:23,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-28 01:48:23,844 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:23,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash -102399158, now seen corresponding path program 12 times [2024-06-28 01:48:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995960413] [2024-06-28 01:48:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:24,886 INFO 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:48:24,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995960413] [2024-06-28 01:48:24,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995960413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:24,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:24,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:24,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799807084] [2024-06-28 01:48:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:24,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:25,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:25,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 569 transitions, 11725 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:48:25,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:25,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:27,792 INFO L124 PetriNetUnfolderBase]: 4946/9187 cut-off events. [2024-06-28 01:48:27,792 INFO L125 PetriNetUnfolderBase]: For 404813/404907 co-relation queries the response was YES. [2024-06-28 01:48:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64743 conditions, 9187 events. 4946/9187 cut-off events. For 404813/404907 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 76259 event pairs, 1201 based on Foata normal form. 102/9104 useless extension candidates. Maximal degree in co-relation 64517. Up to 4116 conditions per place. [2024-06-28 01:48:27,943 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 334 selfloop transitions, 300 changer transitions 0/642 dead transitions. [2024-06-28 01:48:27,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 642 transitions, 13716 flow [2024-06-28 01:48:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:48:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:48:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-28 01:48:27,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382882882882883 [2024-06-28 01:48:27,944 INFO L175 Difference]: Start difference. First operand has 504 places, 569 transitions, 11725 flow. Second operand 12 states and 239 transitions. [2024-06-28 01:48:27,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 642 transitions, 13716 flow [2024-06-28 01:48:33,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 642 transitions, 13405 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:48:33,340 INFO L231 Difference]: Finished difference. Result has 512 places, 571 transitions, 12112 flow [2024-06-28 01:48:33,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11414, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12112, PETRI_PLACES=512, PETRI_TRANSITIONS=571} [2024-06-28 01:48:33,340 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 471 predicate places. [2024-06-28 01:48:33,340 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 571 transitions, 12112 flow [2024-06-28 01:48:33,341 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:48:33,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:33,341 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:48:33,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-28 01:48:33,341 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:33,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:33,342 INFO L85 PathProgramCache]: Analyzing trace with hash 17220600, now seen corresponding path program 13 times [2024-06-28 01:48:33,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:33,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707248520] [2024-06-28 01:48:33,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:33,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:34,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:48:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707248520] [2024-06-28 01:48:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707248520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:34,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:34,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:34,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729367447] [2024-06-28 01:48:34,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:34,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:34,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:34,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:34,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:34,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:34,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 571 transitions, 12112 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:48:34,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:34,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:34,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:37,813 INFO L124 PetriNetUnfolderBase]: 5079/9833 cut-off events. [2024-06-28 01:48:37,813 INFO L125 PetriNetUnfolderBase]: For 477286/477381 co-relation queries the response was YES. [2024-06-28 01:48:37,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68257 conditions, 9833 events. 5079/9833 cut-off events. For 477286/477381 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 85695 event pairs, 1526 based on Foata normal form. 103/9624 useless extension candidates. Maximal degree in co-relation 68028. Up to 5745 conditions per place. [2024-06-28 01:48:37,941 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 411 selfloop transitions, 226 changer transitions 0/645 dead transitions. [2024-06-28 01:48:37,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 645 transitions, 13994 flow [2024-06-28 01:48:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:48:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:48:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 241 transitions. [2024-06-28 01:48:37,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5427927927927928 [2024-06-28 01:48:37,942 INFO L175 Difference]: Start difference. First operand has 512 places, 571 transitions, 12112 flow. Second operand 12 states and 241 transitions. [2024-06-28 01:48:37,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 645 transitions, 13994 flow [2024-06-28 01:48:42,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 645 transitions, 13336 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-28 01:48:42,842 INFO L231 Difference]: Finished difference. Result has 516 places, 571 transitions, 11910 flow [2024-06-28 01:48:42,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11454, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11910, PETRI_PLACES=516, PETRI_TRANSITIONS=571} [2024-06-28 01:48:42,842 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 475 predicate places. [2024-06-28 01:48:42,842 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 571 transitions, 11910 flow [2024-06-28 01:48:42,843 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:48:42,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:42,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:42,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-28 01:48:42,843 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:42,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash -98680088, now seen corresponding path program 14 times [2024-06-28 01:48:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263663499] [2024-06-28 01:48:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:43,677 INFO 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:48:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263663499] [2024-06-28 01:48:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263663499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646886934] [2024-06-28 01:48:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:43,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:43,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:43,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 571 transitions, 11910 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:48:43,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:43,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:43,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:47,059 INFO L124 PetriNetUnfolderBase]: 5069/9465 cut-off events. [2024-06-28 01:48:47,059 INFO L125 PetriNetUnfolderBase]: For 465288/465381 co-relation queries the response was YES. [2024-06-28 01:48:47,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67011 conditions, 9465 events. 5069/9465 cut-off events. For 465288/465381 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 79370 event pairs, 1272 based on Foata normal form. 101/9361 useless extension candidates. Maximal degree in co-relation 66781. Up to 5770 conditions per place. [2024-06-28 01:48:47,187 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 333 selfloop transitions, 298 changer transitions 0/639 dead transitions. [2024-06-28 01:48:47,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 639 transitions, 13735 flow [2024-06-28 01:48:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:48:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:48:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-28 01:48:47,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382882882882883 [2024-06-28 01:48:47,189 INFO L175 Difference]: Start difference. First operand has 516 places, 571 transitions, 11910 flow. Second operand 12 states and 239 transitions. [2024-06-28 01:48:47,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 639 transitions, 13735 flow [2024-06-28 01:48:51,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 639 transitions, 13291 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:48:51,737 INFO L231 Difference]: Finished difference. Result has 520 places, 571 transitions, 12066 flow [2024-06-28 01:48:51,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11466, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12066, PETRI_PLACES=520, PETRI_TRANSITIONS=571} [2024-06-28 01:48:51,737 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 479 predicate places. [2024-06-28 01:48:51,737 INFO L495 AbstractCegarLoop]: Abstraction has has 520 places, 571 transitions, 12066 flow [2024-06-28 01:48:51,737 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:48:51,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:51,738 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:48:51,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-28 01:48:51,738 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:51,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash -98674508, now seen corresponding path program 15 times [2024-06-28 01:48:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477677895] [2024-06-28 01:48:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:52,541 INFO 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:48:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477677895] [2024-06-28 01:48:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477677895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649571745] [2024-06-28 01:48:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:52,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:52,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:52,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:52,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 571 transitions, 12066 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:48:52,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:52,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:52,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:55,772 INFO L124 PetriNetUnfolderBase]: 4947/9237 cut-off events. [2024-06-28 01:48:55,772 INFO L125 PetriNetUnfolderBase]: For 360342/360435 co-relation queries the response was YES. [2024-06-28 01:48:55,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64155 conditions, 9237 events. 4947/9237 cut-off events. For 360342/360435 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 76970 event pairs, 1253 based on Foata normal form. 103/9132 useless extension candidates. Maximal degree in co-relation 63924. Up to 5763 conditions per place. [2024-06-28 01:48:55,910 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 328 selfloop transitions, 298 changer transitions 0/634 dead transitions. [2024-06-28 01:48:55,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 634 transitions, 13637 flow [2024-06-28 01:48:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:48:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:48:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions. [2024-06-28 01:48:55,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-28 01:48:55,912 INFO L175 Difference]: Start difference. First operand has 520 places, 571 transitions, 12066 flow. Second operand 12 states and 234 transitions. [2024-06-28 01:48:55,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 634 transitions, 13637 flow [2024-06-28 01:48:58,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 634 transitions, 13210 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:48:59,007 INFO L231 Difference]: Finished difference. Result has 524 places, 571 transitions, 12241 flow [2024-06-28 01:48:59,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11639, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12241, PETRI_PLACES=524, PETRI_TRANSITIONS=571} [2024-06-28 01:48:59,008 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 483 predicate places. [2024-06-28 01:48:59,008 INFO L495 AbstractCegarLoop]: Abstraction has has 524 places, 571 transitions, 12241 flow [2024-06-28 01:48:59,008 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:48:59,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:59,008 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:48:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-28 01:48:59,008 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:59,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 39853642, now seen corresponding path program 16 times [2024-06-28 01:48:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163658228] [2024-06-28 01:48:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:48:59,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:59,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163658228] [2024-06-28 01:48:59,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163658228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:59,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:59,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:48:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528607363] [2024-06-28 01:48:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:59,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:48:59,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:48:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:48:59,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:59,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 571 transitions, 12241 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:48:59,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:59,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:59,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:03,171 INFO L124 PetriNetUnfolderBase]: 5069/9353 cut-off events. [2024-06-28 01:49:03,171 INFO L125 PetriNetUnfolderBase]: For 368616/368686 co-relation queries the response was YES. [2024-06-28 01:49:03,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65801 conditions, 9353 events. 5069/9353 cut-off events. For 368616/368686 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 77680 event pairs, 1446 based on Foata normal form. 80/9240 useless extension candidates. Maximal degree in co-relation 65569. Up to 6824 conditions per place. [2024-06-28 01:49:03,290 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 407 selfloop transitions, 229 changer transitions 0/644 dead transitions. [2024-06-28 01:49:03,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 644 transitions, 14099 flow [2024-06-28 01:49:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:49:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:49:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-28 01:49:03,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282555282555282 [2024-06-28 01:49:03,291 INFO L175 Difference]: Start difference. First operand has 524 places, 571 transitions, 12241 flow. Second operand 11 states and 215 transitions. [2024-06-28 01:49:03,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 644 transitions, 14099 flow [2024-06-28 01:49:07,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 644 transitions, 13487 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-28 01:49:07,156 INFO L231 Difference]: Finished difference. Result has 526 places, 583 transitions, 12375 flow [2024-06-28 01:49:07,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11649, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12375, PETRI_PLACES=526, PETRI_TRANSITIONS=583} [2024-06-28 01:49:07,156 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 485 predicate places. [2024-06-28 01:49:07,156 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 583 transitions, 12375 flow [2024-06-28 01:49:07,156 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:49:07,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:07,156 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:49:07,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-28 01:49:07,156 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:07,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash 39848062, now seen corresponding path program 17 times [2024-06-28 01:49:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180255290] [2024-06-28 01:49:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:08,008 INFO 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:49:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:08,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180255290] [2024-06-28 01:49:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180255290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:08,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:49:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560586031] [2024-06-28 01:49:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:08,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:49:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:49:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:49:08,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:08,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 583 transitions, 12375 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:49:08,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:08,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:08,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:11,410 INFO L124 PetriNetUnfolderBase]: 5141/9499 cut-off events. [2024-06-28 01:49:11,411 INFO L125 PetriNetUnfolderBase]: For 361284/361354 co-relation queries the response was YES. [2024-06-28 01:49:11,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66066 conditions, 9499 events. 5141/9499 cut-off events. For 361284/361354 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 79222 event pairs, 1432 based on Foata normal form. 78/9381 useless extension candidates. Maximal degree in co-relation 65832. Up to 6816 conditions per place. [2024-06-28 01:49:11,533 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 413 selfloop transitions, 229 changer transitions 0/650 dead transitions. [2024-06-28 01:49:11,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 650 transitions, 14066 flow [2024-06-28 01:49:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:49:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:49:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions. [2024-06-28 01:49:11,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538083538083538 [2024-06-28 01:49:11,534 INFO L175 Difference]: Start difference. First operand has 526 places, 583 transitions, 12375 flow. Second operand 11 states and 219 transitions. [2024-06-28 01:49:11,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 650 transitions, 14066 flow [2024-06-28 01:49:16,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 650 transitions, 13709 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-06-28 01:49:16,221 INFO L231 Difference]: Finished difference. Result has 534 places, 585 transitions, 12561 flow [2024-06-28 01:49:16,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12018, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12561, PETRI_PLACES=534, PETRI_TRANSITIONS=585} [2024-06-28 01:49:16,222 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 493 predicate places. [2024-06-28 01:49:16,222 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 585 transitions, 12561 flow [2024-06-28 01:49:16,222 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:49:16,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:16,222 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:49:16,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-28 01:49:16,222 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:16,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 161260860, now seen corresponding path program 18 times [2024-06-28 01:49:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202770677] [2024-06-28 01:49:16,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:17,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:49:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:17,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202770677] [2024-06-28 01:49:17,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202770677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:49:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888274984] [2024-06-28 01:49:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:17,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:49:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:17,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:49:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:49:17,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:17,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 585 transitions, 12561 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:49:17,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:17,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:17,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:20,587 INFO L124 PetriNetUnfolderBase]: 5209/10056 cut-off events. [2024-06-28 01:49:20,587 INFO L125 PetriNetUnfolderBase]: For 385978/386048 co-relation queries the response was YES. [2024-06-28 01:49:20,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68018 conditions, 10056 events. 5209/10056 cut-off events. For 385978/386048 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 88326 event pairs, 1752 based on Foata normal form. 80/9797 useless extension candidates. Maximal degree in co-relation 67781. Up to 7334 conditions per place. [2024-06-28 01:49:20,714 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 468 selfloop transitions, 175 changer transitions 0/651 dead transitions. [2024-06-28 01:49:20,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 651 transitions, 14206 flow [2024-06-28 01:49:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:49:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:49:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-06-28 01:49:20,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-06-28 01:49:20,715 INFO L175 Difference]: Start difference. First operand has 534 places, 585 transitions, 12561 flow. Second operand 12 states and 225 transitions. [2024-06-28 01:49:20,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 651 transitions, 14206 flow [2024-06-28 01:49:24,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 651 transitions, 13724 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-28 01:49:24,395 INFO L231 Difference]: Finished difference. Result has 538 places, 586 transitions, 12454 flow [2024-06-28 01:49:24,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12079, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12454, PETRI_PLACES=538, PETRI_TRANSITIONS=586} [2024-06-28 01:49:24,396 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 497 predicate places. [2024-06-28 01:49:24,396 INFO L495 AbstractCegarLoop]: Abstraction has has 538 places, 586 transitions, 12454 flow [2024-06-28 01:49:24,396 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:49:24,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:24,396 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:49:24,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-28 01:49:24,396 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:24,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash 45210442, now seen corresponding path program 19 times [2024-06-28 01:49:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:24,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808424979] [2024-06-28 01:49:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:25,274 INFO 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:49:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808424979] [2024-06-28 01:49:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808424979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:25,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:25,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:49:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546011081] [2024-06-28 01:49:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:25,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:49:25,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:49:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:49:25,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:25,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 586 transitions, 12454 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:49:25,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:25,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:25,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand